Corrigendum and Addendum to "Fra\"ıssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition''

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Mašulović, Dragan
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866914582603235328
author Mašulović, Dragan
author_facet Mašulović, Dragan
contents In Section 6 of the paper ``Fra\"ıssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition'', we applied the methods developed in earlier sections to show that a certain reduct of the generic permutation has finite big Ramsey degrees. Unfortunately, this reduct was incorrectly identified as the generic partial order. We are grateful to Jan Hubička for bringing this error to our attention. In this note we correct the statements that rely on this misidentification and demonstrate that the reduct in question is in fact the generic 2-dimensional partial order. We emphasize that the arguments presented in Section 6 remain valid, with the sole exception of the Claim in the proof of Theorem 6.4, whose role was to (incorrectly) identify the reduct of the generic permutation as the generic partial order. This correction has an unexpected positive consequence. Rather than reproving a well-known result whose existing proof is already notably elegant, this note demonstrates that our general framework can be used to establish that a previously unexplored class of generic relational structures has finite big Ramsey degrees. This observation opens a potentially new direction for further research in the thriving area of big Ramsey combinatorics. In the addendum, we combine a recent result by Oudrar and Pouzet with our analysis of finite big Ramsey degrees for structures admitting finite monomorphic decomposition to characterize the existence of finite Big Ramsey degrees for all countable relational structures whose language has a linear order and age has polynomial growth.
format Preprint
id arxiv_https___arxiv_org_abs_2605_20951
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Corrigendum and Addendum to "Fra\"ıssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition''
Mašulović, Dragan
Combinatorics
In Section 6 of the paper ``Fra\"ıssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition'', we applied the methods developed in earlier sections to show that a certain reduct of the generic permutation has finite big Ramsey degrees. Unfortunately, this reduct was incorrectly identified as the generic partial order. We are grateful to Jan Hubička for bringing this error to our attention. In this note we correct the statements that rely on this misidentification and demonstrate that the reduct in question is in fact the generic 2-dimensional partial order. We emphasize that the arguments presented in Section 6 remain valid, with the sole exception of the Claim in the proof of Theorem 6.4, whose role was to (incorrectly) identify the reduct of the generic permutation as the generic partial order. This correction has an unexpected positive consequence. Rather than reproving a well-known result whose existing proof is already notably elegant, this note demonstrates that our general framework can be used to establish that a previously unexplored class of generic relational structures has finite big Ramsey degrees. This observation opens a potentially new direction for further research in the thriving area of big Ramsey combinatorics. In the addendum, we combine a recent result by Oudrar and Pouzet with our analysis of finite big Ramsey degrees for structures admitting finite monomorphic decomposition to characterize the existence of finite Big Ramsey degrees for all countable relational structures whose language has a linear order and age has polynomial growth.
title Corrigendum and Addendum to "Fra\"ıssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition''
topic Combinatorics
url https://arxiv.org/abs/2605.20951