SearcharxivSearch

arXiv subjects

Thilo Weinert

Publications and source records attributed to Thilo Weinert.

11 recordsLinked to original sources

Infinite-Exponent Partition Relations on Higher Analogues of the Real Line

We present a number of results concerning infinite-exponent partition relations on linear orders of the form $\langle {}^\alpha 2,<_{\text{lex}}\rangle$ for $\alpha$ an ordinal, generalising the setting of the real line, working throughout in ZF without the Axiom of Choice. As a particular consequence of our results, we obtain a full classification of the relation $\langle {}^\alpha 2,<_{\text{lex}}\rangle \rightarrow (\tau)^\tau$ for $\tau$ countable.

math.LO

Untranscendable order types

We introduce and study a multiplicative analogue of additive indecomposability for linear order types that we call untranscendability, as well as a strengthening that we call $s$-untranscendability. We show that, with the unique exception of the two-point type, every untranscendable type is additively indecomposable, and every $\sigma$-scattered untranscendable type is strongly indecomposable. Under the Proper Forcing Axiom, every untranscendable Aronszajn type is strongly indecomposable. We also show that a theorem of Hagendorf and Jullien, that every strictly additively indecomposable type must be strictly indecomposable to either the left or right, has a natural analogue for $s$-untranscendable types.

math.CO

Big Ramsey degrees and the two-branching pseudotree

We prove that each finite chain in the two-branching countable ultrahomogeneous pseudotree has finite big Ramsey degrees. This is in contrast to the recent result of Chodounsk\'{y}, Eskew, and Weinert that antichains of size two have infinite big Ramsey degree in the pseudotree. Combining a lower bound result of theirs with work in this paper shows that chains of length two in the pseudotree have big Ramsey degree exactly seven. The pseudotree is the first example of a countable ultrahomogeneous structure in a finite language in which some finite substructures have finite big Ramsey degrees while others have infinite big Ramsey degrees.

math.LO

Colors of the Pseudotree

We investigate big Ramsey degrees of finite substructures of the universal countable homogeneous meet-tree and its binary variant. We prove that structures containing antichains have infinite big Ramsey degrees, and the big Ramsey degree of a 2-element chain is at least 8 and 7 for the binary variant. We deduce that the generic C-relation does not have finite big Ramsey degrees.

math.CO

Calligraphy Concerning Casually Compiled Cardinal Characteristic Comparisons

The paper establishes several inequalities between cardinal characteristics of the continuum. In particular, it is shown that the partition splitting number is not larger than the uniformity of the meagre ideal; not all sets of reals having the cardinality of an the $\varepsilon$-almost bisecting number are of strong measure zero; no fewer sets of strong measure zero than indicated by the statistically reaping number suffice to cover the reals; the pair-splitting number is not smaller than the evasion number; and the subseries number is neither smaller than the pair-splitting number nor than the minimum of the unbounding number and the unbisecting number. Moreover, a diagram putting these results into context is provided and a brief historical account is given.

math.LO

Wetzel families and the continuum

We provide answers to a question brought up by Erd\H{o}s about the construction of Wetzel families in the absence of the continuum hypothesis - a Wetzel family is a family $\mathcal{F}$ of entire functions on the complex plane which pointwise assumes fewer than $\vert \mathcal{F} \vert$ values. To be more precise, we show that the existence of a Wetzel family is consistent with all possible values $\kappa$ of the continuum and, if $\kappa$ is regular, also with Martin's Axiom. In the particular case of $\kappa = \aleph_2$ this answers an open question asked by Kumar and Shelah. In the buildup to this result, we are also solving an open question of Zapletal on strongly almost disjoint functions. We also study a strongly related notion of sets exhibiting a universality property via mappings by entire functions and show that these consistently exist while the continuum equals $\aleph_2$.

math.LO

Lebesgue's Density Theorem and definable selectors for ideals

We introduce a notion of density point and prove results analogous to Lebesgue's density theorem for various well-known ideals on Cantor space and Baire space. In fact, we isolate a class of ideals for which our results hold. In contrast to these results, we show that there is no reasonably definable selector that chooses representatives for the equivalence relation on the Borel sets of having countable symmetric difference. In other words, there is no notion of density which makes the ideal of countable sets satisfy an analogue to the density theorem. The proofs of the positive results use only elementary combinatorics of trees, while the negative results rely on forcing arguments.

math.LO

The Polarised Partition Relation for Order Types

We analyse partitions of products with two ordered factors in two classes where both factors are countable or well-ordered and at least one of them is countable. This relates the partition properties of these products to cardinal characteristics of the continuum. We build on work by Erdős, Garti, Jones, Orr, Rado, Shelah and Szemerédi. In particular, we show that a theorem of Jones extends from the natural numbers to the rational ones but consistently extends only to three further equimorphism classes of countable orderings. This is made possible by applying a thirteen-year old theorem of Orr about embedding a given order into a sum of finite orders indexed over the given order.

math.LO

Partitioning subsets of generalised scattered orders

In 1956, 48 years after Hausdorff provided a comprehensive account on ordered sets and defined the notion of a scattered order, Erdő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 $κ$, we investigate the extent to which the classes of $κ$-scattered, weakly $κ$-scattered, and $κ$-saturated linear orders of size $κ$ are closed under the partition relation $τ\rightarrow (φ, n)^2$ for all $n < ω$. We prove that for a regular cardinal $κ$ such that the stick principle holds at $κ$ and $\mathfrak{b}_κ= κ^+$, the partition relation $κ^+κ\rightarrow (κ^+κ, 3)^2$ fails. Finally we generalise a result of Komjáth and Shelah about partitions of scattered linear orders to a similar result about partitions of $κ$-scattered linear orders for uncountable $κ$. Together this continues older research by Erdős, Galvin, Hajnal, Larson and Takahashi and more recent investigations by Abraham, Bonnet, Cummings, Džamonja, Komjáth, Shelah and Thompson.

math.LO