Big Ramsey Degrees of Countable Ordinals

arXiv2305.07192MaRDI QIDQ6436337FDOQ6436337

Authors: Joanna Boyland, William Gasarch, Nathan Hurtig, Robert Rust 

Publication date: 11 May 2023

Abstract: Ramsey's theorem states that for all finite colorings of an infinite set, there exists an infinite homogeneous subset. What if we seek a homogeneous subset that is also order-equivalent to the original set? Let $S$ be a linearly ordered set and $ainN$. The big Ramsey degree of $a$ in $S$, denoted $T(a,S)$, is the least integer $t$ such that, for any finite coloring of the $a$-subsets of $S$, there exists $S^{\prime }subseteqS$ such that (i) $S^{\prime }$ is order-equivalent to $S$, and (ii) if the coloring is restricted to the $a$-subsets of $S^{\prime }$ then at most $t$ colors are used. Mav{s}ulovi'{c} & v{S}obot (2019) showed that $T(a,omega+omega)=2^a$. From this one can obtain $T(a,zeta)=2^a$. We give a direct proof that $T(a,zeta)=2^a$. Mav{s}ulovi'{c} and v{S}obot (2019) also showed that for all countable ordinals $alpha<omeg{a}^{o}mega$, and for all $ainN$, $T(a,alpha)$ is finite. We find exact value of $T(a,alpha)$ for all ordinals less than $omeg{a}^{o}mega$ and all $ainN$.

Mathematics Subject Classification ID

Ramsey theory (05D10)

This page was built for publication: Big Ramsey Degrees of Countable Ordinals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6436337)