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.

💡 Research Summary

The paper investigates the big Ramsey degrees of finite chains in the countable, ultrahomogeneous, two‑branching pseudotree, denoted by Ψ. Big Ramsey degree BRD(A, S) for a finite substructure A of an infinite structure S is the smallest integer n such that for any finite coloring of copies of A in S, there exists a subcopy S₁ ≅ S in which at most n colors appear on the copies of A. The authors contrast their results with a recent work of Chodounský, Eskew, and Weinert, which showed that antichains of size 2 in Ψ have infinite big Ramsey degree, while singletons have degree 1.

The main contributions are:

1. Finite big Ramsey degrees for all finite chains – The authors prove that every finite chain (i.e., a linearly ordered finite substructure) of Ψ has a finite big Ramsey degree. This is the first known example of a countable ultrahomogeneous structure in a finite language where some finite substructures have finite degrees and others have infinite degrees.

2. Exact degree for chains of length 2 – Using the lower bound of ≥ 7 from the earlier paper and a detailed upper‑bound analysis, the authors show that the big Ramsey degree of a 2‑element chain is exactly 7.

The technical framework consists of several layers:

• Background and amalgamation lemmas – The paper defines the pseudotree Ψ as the Fraïssé limit of finite binary trees (each non‑terminal node has at most two immediate successors) equipped with a partial order ≤ and a meet operation ∧. An expanded language L° adds a linear order ≺_lex that distinguishes left and right successors. Strong amalgamation properties are proved for the class of finite trees with this extra order, allowing the construction of larger trees that contain prescribed finite configurations.

• A Halpern–Läuchli variant (Theorem 3.4) – The classical Halpern–Läuchli theorem gives a partition result for products of infinite trees. The authors adapt it to the setting of chains in Ψ, producing a Ramsey‑type theorem that guarantees, for any finite coloring of chains, a homogeneous subtree where the entire chain receives the same color. This variant is crucial for controlling the combinatorial explosion when dealing with multiple levels of the coding tree.

• Coding trees and “almost antichains” – The authors fix an ω‑type enumeration of Ψ° (the expanded pseudotree) that yields a coding tree S. Each node of S represents a finite initial segment of the enumeration, and the tree’s levels correspond to successive extensions of the structure. By carefully arranging left, right, and “middle” copies of Ψ° above each node, they construct substructures called “almost antichains” that mimic the behavior of genuine antichains but retain enough linear order to be treated as chains.

• Seven expansion types – To bound the degree for 2‑element chains, the authors identify seven distinct ways a chain can be embedded in the expanded structure. Each type corresponds to a particular pattern of left/right placement of the two nodes relative to the coding tree. By showing that any coloring can be reduced to at most one of these seven types in a homogeneous subcopy, they obtain an upper bound of 7.

• Matching lower bound – The earlier work of Chodounský, Eskew, and Weinert already established a lower bound of 7 for the degree of 2‑element chains. Combining this with the new upper bound yields the exact value.

The paper concludes with a discussion of the significance of the result: it demonstrates that the property “finite big Ramsey degree for all finite substructures” is not monotone with respect to substructure inclusion, even within a single ultrahomogeneous structure. Moreover, the methods—particularly the tailored Halpern–Läuchli variant and the coding‑tree framework—are likely to be applicable to other Fraïssé limits with forbidden configurations, opening avenues for further research on big Ramsey degrees and their connections to topological dynamics of automorphism groups.