Partitioning subsets of generalised scattered orders

DOI10.2969/JMSJ/78617861arXiv1701.05791WikidataQ128907476 ScholiaQ128907476MaRDI QIDQ6282169

Chris Lambie-Hanson, Thilo Weinert

Publication date: 20 January 2017

Abstract: In 1956, 48 years after Hausdorff provided a comprehensive account on ordered sets and defined the notion of a scattered order, ErdH{o}s and Rado founded the partition calculus in a seminal paper. The present paper gives an account of investigations into generalisations of scattered linear orders and their partition relations for both singletons and pairs. It provides analogues of the Milner-Rado paradox for these orders instead of ordinals. For infinite, regular $kappa$, we investigate the extent to which the classes of $kappa$-scattered, weakly $kappa$-scattered, and $kappa$-saturated linear orders of size $kappa$ are closed under the partition relation $auightarrow(varphi,n{)}^2$ for all $n<omega$. We prove that for a regular cardinal $kappa$ such that the stick principle holds at $kappa$ and $mathfrak{b}_{k}appa=kapp{a}^{+}$, the partition relation $kapp{a}^{+}kappaightarrow(kapp{a}^{+}kappa,3{)}^2$ fails. Finally we generalise a result of Komj'{a}th and Shelah about partitions of scattered linear orders to a similar result about partitions of $kappa$-scattered linear orders for uncountable $kappa$. Together this continues older research by ErdH{o}s, Galvin, Hajnal, Larson and Takahashi and more recent investigations by Abraham, Bonnet, Cummings, Dv{z}amonja, Komj'{a}th, Shelah and Thompson.

Mathematics Subject Classification ID

Ramsey theory (05D10) Total orders (06A05) Cardinal characteristics of the continuum (03E17) Partition relations (03E02) Infinite graphs (05C63)

This page was built for publication: Partitioning subsets of generalised scattered orders

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