Searcharxiv⌕ Search

arXiv subjects

Natasha Dobrinen

Publications and source records attributed to Natasha Dobrinen.

At least 19 recordsLinked to original sources
arXiv2026

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ý, 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↗
arXiv2026

The finite big Ramsey degrees of Henson graphs are provable in $\mathrm{ACA}_0$

Let $\mathbb{H}_{n+1}$ denote a computable copy of the $(n+1)$-clique free universal homogeneous Henson graph, $G$ denote a finite subgraph of $\mathbb{H}_{n+1}$, and $k(G,n)$ denote the big Ramsey degree of $G$ in $\mathbb{H}_{n+1}$. We prove that for any computable coloring $χ$ of the copies of $G$ in $\mathbb{H}_{n+1}$, there is a copy $\mathbb{H}'$ of $\mathbb{H}_{n+1}$ that is computable from $0^{(2δ(G,n)-1)}$ in which $χ$ takes no more than $k(G,n)$ colors, where $δ(G,n)$ denotes the maximum number of levels of a diary for $G$ in $\mathbb{H}_{n+1}$ (this is a finite number). It follows that the statement, ``Henson graphs have finite big Ramsey degrees," is provable in ACA$_0'$. Combining this with a recent result of Cholak, Dobrinen, and McCoy \cite{CDM} yields the equivalence of the statement with ACA$_0'$ over RCA$_0$.

math.LO↗
arXiv2026

The Henson graphs: colorings and codings

By recent work of \citet{DobrinenICM} and \citet{Balko7} we know that every finite $G$ in the Henson graph $\mathbb{H}_{n+1}$ (the universal ultrahomogeneous $(n+1)$-clique free graph) has exact finite big Ramsey degree $k({G,n})$. That is, there is a positive integer $k({G,n})$ such that for each finite coloring $C$ of the copies of $G$ in $\mathbb{H}_{n+1}$, there is $\tilde{\mathbb{H}}$, a substructure of $\mathbb{H}_{n+1}$ and isomorphic to $\mathbb{H}_{n+1}$, such that in $\tilde{\mathbb{H}}$ at most $k({G,n})$ colors are used on the copies of $G$ in $\tilde{\mathbb{H}}$. Moreover, for exactness, for some coloring and all corresponding $\tilde{\mathbb{H}}$, all $k({G,n})$ colors are needed. The ultimate result here is that if $|G|\geq 2$, then there is a finite computable coloring $C$ such that, for all such $\tilde{\mathbb{H}}$, we have that $\tilde{\mathbb{H}}$ computes $\emptyset^{(|G|-1)}$ (and hence the halting set).

math.LO↗
arXiv2025

Tukey-idempotency and strong p-points

We characterize strong $p$-point ultrafilters by showing that they are exactly those $p$-points that are not Tukey above $(ω^ω,\leq)$; or equivalently, those $p$-points that are not Tukey-idempotent. Moreover, we show that there are no Canjar ultrafilters on measurable cardinals. We make use of tools which were motivated by topological Ramsey spaces, developed in \cite{Benhamou/Dobrinen24}, and furthermore, show that ultrafilters arising from most of the known topological Ramsey spaces are Tukey-idempotent. Our results answer questions of Hrušák and Verner \cite[Question 5.7]{Hrusak/Verner11}, Brook-Taylor \cite[Question 3.6]{QuestionGeneralized}, and partially Benhamou and Dobrinen \cite[Question 5.6]{Benhamou/Dobrinen24}.

math.LO↗
arXiv2025

Characterisation of the big Ramsey degrees of the generic partial order

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite partial orders endowed with linear extensions form a Ramsey class (this result was announced by Nešetřil and Rödl in 1984 with first published proof by Paoli, Trotter and Walker in 1985). Towards this, we refine earlier upper bounds obtained by Hubička based on a new connection of big Ramsey degrees to the Carlson-Simpson theorem and we also introduce a new technique of giving lower bounds using an iterated application of the upper-bound theorem.

math.CO↗
arXiv2024

On the Tukey types of Fubini products

We extend the class of ultrafilters $U$ over countable sets for which $U\cdot U\equiv_T U$, extending several results from \cite{Dobrinen/Todorcevic11}. In particular, we prove that for each countable ordinal $α\geq 2$, the generic ultrafilter $G_α$ forced by $P(ω^α)/\text{fin}^{\otimesα}$ satisfy $G_α\cdot G_α\equiv_T G_α$. This answers a question posed in \cite[Question 43]{Dobrinen/Todorcevic11}. Additionally, we establish that Milliken-Taylor ultrafilters possess the property that $U\cdot U\equiv_T U$.

math.LO↗
arXiv2024

Borel sets of Rado graphs and Ramsey's Theorem

The well-known Galvin-Prikry Theorem states that Borel subsets of the Baire space are Ramsey: Given any Borel subset $\mathcal{X}\subseteq [ω]^ω$, where $[ω]^ω$ is endowed with the metric topology, each infinite subset $X\subseteq ω$ contains an infinite subset $Y\subseteq X$ such that $[Y]^ω$ is either contained in $\mathcal{X}$ or disjoint from $\mathcal{X}$. Kechris, Pestov, and Todorcevic point out in their seminal 2005 paper the dearth of similar results for homogeneous structures. Such results are a necessary step to the larger goal of finding a correspondence between structures with infinite dimensional Ramsey properties and topological dynamics, extending their correspondence between the Ramsey property and extreme amenability. In this article, we prove an analogue of the Galvin-Prikry theorem for the Rado graph. Any such infinite dimensional Ramsey theorem is subject to constraints following from the 2006 work of Laflamme, Sauer, and Vuksanovic. The proof uses techniques developed for the author's work on the Ramsey theory of the Henson graphs as well as some new methods for fusion sequences, used to bypass the lack of a certain amalgamation property enjoyed by the Baire space.

math.CO↗
arXiv2024

Cofinal types of ultrafilters over measurable cardinals

We develop the theory of cofinal types of ultrafilters over measurable cardinals and establish its connections to Galvin's property. We generalize fundamental results from the countable to the uncountable, but often in surprisingly strengthened forms, and present models with varying structures of the cofinal types of ultrafilters over measurable cardinals.

math.LO↗
arXiv2023

Infinite-dimensional Ramsey theory for binary free amalgamation classes

We develop infinite-dimensional Ramsey theory for Fraïssé limits of finitely constrained free amalgamation classes in finite binary languages. We show that our approach is optimal and in particular, recovers the exact big Ramsey degrees proved in [2] for these structures. A crucial step in the work develops the new notion of an A.3(2)-ideal and shows that Todorcevic's Abstract Ramsey Theorem holds when Axiom A.3(2) is replaced by the weaker assumption of an A.3(2)-ideal.

math.LO↗
arXiv2023

Ramsey theorem for trees with successor operation

We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for regularly branching trees. Our theorem has a number of applications both in finite and infinite combinatorics. For example, we give a short proof of the unrestricted Nešetřil-Rödl theorem, and we recover the Graham-Rothschild theorem. Our original motivation came from the study of big Ramsey degrees - various trees used in the study can be viewed as trees with a successor operation. To illustrate this, we give a non-forcing proof of a theorem of Zucker on big Ramsey degrees.

math.CO↗
arXiv2023

Exact big Ramsey degrees for finitely constrained binary free amalgamation classes

We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defined by finitely many forbidden irreducible substructures, thus refining the recent upper bounds given by Zucker. Using this characterization, we show that the Fraïssé limit of each such class admits a strong big Ramsey structure, implying that the automorphism group of the Fraïssé limit has a metrizable universal completion flow.

math.LO↗
arXiv2023

Infinite-dimensional Ramsey theory for homogeneous structures with SDAP$^+$

We prove that for any homogeneous structure $\mathbf{K}$ in a language with finitely many relation symbols of arity at most two satisfying SDAP$^+$ (or LSDAP$^+$), there are spaces of subcopies of $\mathbf{K}$, forming subspaces of the Baire space, in which all Borel sets are Ramsey. Structures satisfying SDAP$^+$ include the rationals, the Rado graph and more generally, unrestricted structures, and generic $k$-partite graphs, the latter three types with or without an additional dense linear order. As a corollary of the main theorem, we obtain an analogue of the Nash-Williams Theorem which recovers exact big Ramsey degrees for these structures, answering a question raised by Todorcevic at the 2019 Luminy Workshop on Set Theory. Moreover, for the rationals and similar homogeneous structures our methods produce topological Ramsey spaces, thus satisfying analogues of the Ellentuck theorem.

math.LO↗
arXiv2023

The Halpern--Läuchli Theorem at singular cardinals and failures of weak versions

This paper continues a line of investigation of the Halpern--Läuchli Theorem at uncountable cardinals. We prove in ZFC that the Halpern--Läuchli Theorem for one tree of height $κ$ holds whenever $κ$ is strongly inaccessible and the coloring takes less than $κ$ colors. We prove consistency of the Halpern--Läuchli Theorem for finitely many trees of height $κ$, where $κ$ is a strong limit cardinal of countable cofinality. On the other hand, we prove failure of weak forms of Halpern--\Lauchli\ for trees of height $κ$, whenever $κ$ is a strongly inaccessible, non-Mahlo cardinal or a singular strong limit cardinal with cofinality the successor of a regular cardinal. We also prove failure in $L$ of a weak version for all strongly inaccessible, non-weakly compact cardinals.

math.LO↗
arXiv2022

Fraisse Structures with SDAP+, Part I: Indivisibility

This is Part I of a two-part series regarding Ramsey properties of Fraisse structures satisfying a property called SDAP+, which strengthens the Disjoint Amalgamation Property. We prove that every Fraisse structure in a finite relational language with relation symbols of any finite arity satisfying this property is indivisible. Novelties include a new formulation of coding trees in terms of 1-types over initial segments of the Fraisse structure, and a direct proof of indivisibility which uses the method of forcing to conduct unbounded searches for finite sets. In Part II, we prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees which have a simple characterization. It follows that any such Fraisse structure admits a big Ramsey structure. Part II utilizes a theorem from Part I as a pigeonhole principle for induction arguments. This work offers a streamlined and unifying approach to Ramsey theory on some seemingly disparate classes of Fraisse structures.

math.CO↗
arXiv2022

Fraisse structures with SDAP+, Part II: Simply characterized big Ramsey structures

This is Part II of a two-part series regarding Ramsey properties of Fraisse structures satisfying a property called SDAP+, which strengthens the Disjoint Amalgamation Property. In Part I, we prove that every Fraisse structure in a finite relational language with relation symbols of any finite arity satisfying this property is indivisible. In Part II, we prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees which have a simple characterization. It follows that any such Fraisse structure admits a big Ramsey structure. Part II utilizes the notion of coding trees of 1-types developed in Part I and a theorem from Part I which functions as a pigeonhole principle for induction arguments in this paper. Our approach yields a direct characterization of the degrees without appeal to the standard method of "envelopes". This work offers a streamlined and unifying approach to Ramsey theory on some seemingly disparate classes of Fraisse structures.

math.CO↗
arXiv2022

The Ramsey Theory of Henson graphs

Analogues of Ramsey's Theorem for infinite structures such as the rationals or the Rado graph have been known for some time. In this context, one looks for optimal bounds, called degrees, for the number of colors in an isomorphic substructure rather than one color, as that is often impossible. Such theorems for Henson graphs however remained elusive, due to lack of techniques for handling forbidden cliques. Building on the author's recent result for the triangle-free Henson graph, we prove that for each $k\ge 4$, the $k$-clique-free Henson graph has finite big Ramsey degrees, the appropriate analogue of Ramsey's Theorem. We develop a method for coding copies of Henson graphs into a new class of trees, called strong coding trees, and prove Ramsey theorems for these trees which are applied to deduce finite big Ramsey degrees. The approach here provides a general methodology opening further study of big Ramsey degrees for ultrahomogeneous structures. The results have bearing on topological dynamics via work of Kechris, Pestov, and Todorcevic and of Zucker.

math.CO↗
arXiv2022

Big Ramsey degrees in universal inverse limit structures

We build a collection of topological Ramsey spaces of trees giving rise to universal inverse limit structures,extending Zheng's work for the profinite graph to the setting of Fra\"ıssé classes of finite ordered binary relational structures with the Ramsey property. This work is based on the Halpern-Läuchli theorem, but different from the Milliken space of strong subtrees. Based on these topological Ramsey spaces and the work of Huber-Geschke-Kojman on inverse limits of finite ordered graphs, we prove that for each such Fra\"ıssé class, its universal inverse limit structure has finite big Ramsey degrees under finite Baire-measurable colorings. For such \Fraisse\ classes satisfying free amalgamation as well as finite ordered tournaments and finite partial orders with a linear extension, we characterize the exact big Ramsey degrees.

math.CO↗