A partition theorem for a large dense linear order

M. Dzamonja; J. Larson; W. Mitchell

Home/Archive/arXiv

arXiv · math/0506123

A partition theorem for a large dense linear order

M. Dzamonja·J. Larson·W. Mitchell

View original source ↗Read source document ↗Export metadata ↓

Abstract

Let Q_K=(Q,<_Q)$ be a strongly K-dense linear order of size K for a suitable cardinal K. We prove, for all integers m > 1 that there is a finite value t_m^+ such that the set of all m-tuples from Q can be divided into t_m^+ many classes, such that whenever any of these classes C is colored with fewer than K many colors, there is a copy Q* of Q_K such that all m-tuples from Q* in C receive the same color. As a consequence we obtain that whenever we color the m-tuples of Q with fewer than K many colors, there is a copy of Q_K all m-tuples from which are colored in at most t_m^+ colors. In other words, the partition relation Q_K -->(Q_K)^m_{ 2 we have t_m^+ > t_m, the m-th tangent number. The paper also contains similar partition results about K-Rado graphs. A consequence of our work and some earlier results of Hajnal and Komjath is that a theorem of Shelah known to follow from a large cardinal assumption in a generic extension, does not follow from any large cardinal assumption on its own.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

M. Dzamonja, J. Larson, W. Mitchell. 2005-06-07. A partition theorem for a large dense linear order. https://arxiv.org/abs/math/0506123

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Ultrahomogeneous hypertournaments

A $k$-hypertournament is a higher-arity generalisation of a tournament, consisting of a set together with an irreflexive $k$-ary relation such that the automorphism group of each substructure of size $k$ is the alternating group $\mathrm{A}_k$. We show that, for each $k \geq 3$, there are continuum-many non-isomorphic countable ultrahomogeneous $k$-hypertournaments, answering a question of Cherlin.

math.LO↗

arXiv2026

Forcing with Symmetric Systems of Models of Two Types

The purpose of this paper is to present a general method for forcing on $ω_2$ and $ω_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing with finite symmetric systems of elementary submodels, and improves earlier versions of this forcing by including models of two types. We will present several applications of the pure side condition forcing and variants thereof, by adding a Kurepa tree on $ω_2$, a club subset of $ω_2$ that avoids infinite sets from the ground model, a function bounding every canonical function below $ω_3$ on a club, and a simplified $(ω_2,1)$-morass.

math.LO↗

arXiv2026

Well begun is half done: the computation of Eulerian paths

We characterize the uniform computational strength of finding (one-way or two-way, directed or undirected) Eulerian paths in countable graphs. In the one-way case, for both directed and undirected graphs, this problem is Weihrauch-equivalent to $\mathsf{lim}\times\mathsf{C}_{\mathbb{N}}'$, where $\mathsf{C}_{\mathbb{N}}'$ is the jump of closed choice on the natural numbers. This refines the proof-theoretic strength of the existence of a one-way Eulerian path given by the reverse mathematics framework. The $\mathsf{C}_{\mathbb{N}}'$ component comes entirely from the difficulty of choosing a starting vertex: with a valid start prescribed, the problem is equivalent to $\mathsf{lim}$, which also characterizes the degree of the two-way directed/undirected Eulerian path problem. We also study the complexity of orienting the edges of a graph while preserving the existence of a one-way/two-way Eulerian path. In the one-way case, this problem is not computable, and we prove that $\mathsf{lim}_2<_{\mathrm{W}}\mathsf{OrientEP}<_{\mathrm{W}}\mathsf{C}_{2}'\sqcap\mathsf{Sort}_2$ and $\mathsf{OrientEP}\not\le_{\mathrm{W}}\mathsf{C}_{\mathbb{N}}$. On the other hand, valid orientations are uniformly computable for two-way paths and for one-way paths with a prescribed valid starting vertex.

math.LO↗