pith. sign in

arxiv: 2407.20307 · v5 · pith:M5GJK5NUnew · submitted 2024-07-29 · 🧮 math.LO · math.CO

Fra\"{i}ss\'{e}'s Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition

Dragan Ma\v{s}ulovi\'c , Veljko Tolji\'c This is my paper

Pith reviewed 2026-05-23 22:51 UTC · model grok-4.3

classification 🧮 math.LO math.CO
keywords big Ramsey degreesmonomorphic decompositionFraïssé's conjectureLaver's theoremcountable structuresRamsey theoryrelational structures
0
0 comments X

The pith

A countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if every monomorphic part in its minimal decomposition does.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that for countable structures admitting a finite monomorphic decomposition, finite big Ramsey degrees hold for the whole structure precisely when they hold for each monomorphic part in the minimal decomposition. It also shows that a countable monomorphic structure has finite big Ramsey degrees exactly when it is chainable by a chain with finite big Ramsey degrees. These characterizations depend on structural properties of chains, Laver's resolution of Fraïssé's conjecture, and a new product Ramsey theorem for big Ramsey degrees. A sympathetic reader would care because the results reduce the question for composite structures to questions about simpler components.

Core claim

A countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. A countable monomorphic structure has finite big Ramsey degrees if and only if it is chainable by a chain with finite big Ramsey degrees. Both characterizations require deep structural properties of chains. Fraïssé's conjecture, resolved positively by Laver, is used for the monomorphic case, while a product Ramsey theorem for big Ramsey degrees is developed for the decomposition case.

What carries the argument

Minimal monomorphic decomposition, which partitions the structure into monomorphic parts whose individual big Ramsey degrees determine the property for the whole structure.

If this is right

  • The big Ramsey degrees of a structure with finite monomorphic decomposition are determined by those of its monomorphic parts.
  • The result combines with recent work on ordered structures to characterize finite big Ramsey degrees for all countable relational structures whose language has a linear order and whose age has polynomial growth.
  • Big Ramsey degrees can be analyzed in certain product settings via the product Ramsey theorem developed in the paper.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Decomposition techniques of this kind may extend to other Ramsey-theoretic properties such as small Ramsey degrees.
  • The classification of all countable structures with finite big Ramsey degrees can now focus on identifying their monomorphic components.
  • The approach suggests checking specific families of monomorphic structures by reducing them to chains.

Load-bearing premise

The characterizations depend on deep structural properties of chains together with Laver's positive resolution of Fraïssé's conjecture.

What would settle it

A countable monomorphic structure with finite big Ramsey degrees that cannot be chained by any chain with finite big Ramsey degrees would falsify the monomorphic characterization.

Figures

Figures reproduced from arXiv: 2407.20307 by Dragan Ma\v{s}ulovi\'c, Veljko Tolji\'c.

Figure 1
Figure 1. Figure 1: The three summations on trees •0 (a vertex labeled by 0) and •1 (a vertex labeled by 1); the chains these trees encode are k • 0k = ∅ – the empty chain, and k • 1k = 1 – the trivial one-element chain. Assume that Ai have been defined for all i < m and let us define three operations on trees as follows: • For n ∈ N and τ0, . . . , τn ∈ S i<m Ai let σ be the tree whose root is labeled by +, edges going out o… view at source ↗
Figure 2
Figure 2. Figure 2: Encoding branches in a small labeled tree [PITH_FULL_IMAGE:figures/full_fig_p025_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: A binary category Consider a finite, bipartite digraph with loops where all the arrows go from one class of vertices into the other, and the out-degree of all the vertices in the first class is 2 (modulo loops), see [PITH_FULL_IMAGE:figures/full_fig_p033_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: An (A, B)-diagram in C (of shape ∆) if the amalgamation problem GF : ∆ → C has a solution in C whose tip is C, then F has a solution in B. Then TB(A, B) 6 TC(G(A), C). We can now execute the first step of the plan. Theorem 6.2. The generic permutation has big Ramsey degrees. Proof. Let B = Permemb and C = Chemb ×Chemb . Let Q = (Q, ≺1, ≺2) be the generic permutation, and let Q1 = (Q, ≺1) and Q2 = (Q, ≺2). … view at source ↗
read the original abstract

In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite for this result is the characterization of monomorphic structures with finite big Ramsey degrees: a countable monomorphic structure has finite big Ramsey degrees if and only if it is chainable by a chain with finite big Ramsey degrees. Interestingly, both characterizations require deep structural properties of chains. Fra\"{i}ss\'{e}'s Conjecture (actually, its positive resolution due to Laver) is instrumental in the characterization of monomorphic structures with finite big Ramsey degrees, while the analysis of big Ramsey combinatorics of structures admitting a finite monomorphic decomposition requires a product Ramsey theorem for big Ramsey degrees. We find this last result particularly intriguing because big Ramsey degrees misbehave notoriously when it comes to general product statements. In the addendum, we combine a recent result by Oudrar and Pouzet with our analysis of finite big Ramsey degrees for structures admitting finite monomorphic decomposition to characterize the existence of finite Big Ramsey degrees for all countable relational structures whose language has a linear order and age has polynomial growth.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proves that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if every monomorphic part in its minimal monomorphic decomposition does. It also gives a characterization of monomorphic structures with finite big Ramsey degrees: such a structure has finite big Ramsey degrees if and only if it is chainable by a chain with finite big Ramsey degrees. Both results rely on Laver's positive resolution of Fraïssé's conjecture together with a new product Ramsey theorem for big Ramsey degrees that the paper develops specifically for chains. An addendum combines the main result with a theorem of Oudrar and Pouzet to characterize finite big Ramsey degrees for all countable relational structures whose language contains a linear order and whose age has polynomial growth.

Significance. If the central claims hold, the work supplies a clean reduction of the finite-big-Ramsey-degree property for decomposable structures to their monomorphic components, thereby extending the reach of existing results on chains. The careful construction of a product theorem that applies precisely when the factors are chains with finite big Ramsey degrees (avoiding the known counterexamples to unrestricted products) is a substantive technical contribution. The addendum yields a characterization for an entire class of structures with linear orders and polynomial-growth ages, which is a concrete advance in the structural theory of big Ramsey degrees.

major comments (2)
  1. [product theorem section] The product Ramsey theorem for big Ramsey degrees (developed to handle the decomposition case) is load-bearing for the main theorem; the manuscript should make explicit, in the statement or proof, the precise hypotheses on the factors that allow the result to hold while general products fail.
  2. [monomorphic characterization] The characterization of monomorphic structures invokes Laver's theorem on the well-quasi-ordering of countable chains; the manuscript should verify that the reduction from arbitrary monomorphic structures to chainable ones preserves the finite-big-Ramsey-degree property in both directions.
minor comments (2)
  1. [abstract] The abstract refers to 'the addendum'; clarify whether this material appears as a numbered section of the main text or as a separate appendix.
  2. [introduction] Notation for monomorphic decompositions and minimal decompositions should be introduced with a short definitional paragraph or diagram before the main theorems are stated.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive assessment and the recommendation of minor revision. We address the two major comments below and will incorporate the requested clarifications in the revised manuscript.

read point-by-point responses

  1. Referee: [product theorem section] The product Ramsey theorem for big Ramsey degrees (developed to handle the decomposition case) is load-bearing for the main theorem; the manuscript should make explicit, in the statement or proof, the precise hypotheses on the factors that allow the result to hold while general products fail.

    Authors: We agree that the hypotheses on the factors should be stated more explicitly to distinguish the result from known counterexamples to unrestricted products. In the revised version we will add a dedicated remark immediately following the statement of the product theorem, specifying that the factors are required to be chains each having finite big Ramsey degrees; this is the precise condition under which the theorem holds and which circumvents the obstructions that arise for arbitrary structures. revision: yes

  2. Referee: [monomorphic characterization] The characterization of monomorphic structures invokes Laver's theorem on the well-quasi-ordering of countable chains; the manuscript should verify that the reduction from arbitrary monomorphic structures to chainable ones preserves the finite-big-Ramsey-degree property in both directions.

    Authors: We appreciate the request for an explicit bidirectional verification. While the one-direction implication (chainable by a finite-BRD chain implies finite BRD for the monomorphic structure) follows directly from the product construction, the converse relies on Laver's theorem to reduce to a minimal chainable representative. In the revision we will insert a short paragraph after the statement of the characterization that confirms both directions: if a monomorphic structure has finite BRD then, by Laver, it is chainable by a chain that itself must have finite BRD (otherwise the product would yield infinite degrees), thereby establishing the equivalence. revision: yes

Circularity Check

0 steps flagged

No circularity; results rest on external Laver theorem and new product construction

full rationale

The derivation chain invokes Laver's positive resolution of Fraïssé's Conjecture as an external input for the monomorphic characterization and constructs a new product Ramsey theorem for big Ramsey degrees to handle the finite monomorphic decomposition case. Both steps are presented as independent arguments rather than reductions to fitted parameters, self-definitions, or prior self-citations; the product result is explicitly tailored to avoid known counterexamples and is not claimed to follow from the target statement. The addendum further combines an external result by Oudrar and Pouzet. No load-bearing step reduces by construction to the paper's own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Claims rest on Laver's theorem as background and on a newly developed product Ramsey theorem; no free parameters or invented entities are introduced in the abstract.

axioms (2)
  • standard math Laver's positive resolution of Fraïssé's Conjecture (countable chains are well-quasi-ordered under embeddability)
    Explicitly stated as instrumental for the monomorphic characterization.
  • ad hoc to paper Product Ramsey theorem for big Ramsey degrees
    Developed within the paper to handle the decomposition case.

pith-pipeline@v0.9.0 · 5761 in / 1359 out tokens · 25319 ms · 2026-05-23T22:51:34.461078+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

  1. [1]

    P. J. Cameron. Homogeneous permutations. Electron. J. C ombin., 9(2): #R2, 2002-3

    work page 2002

  2. [2]

    Dasilva Barbosa, D

    K. Dasilva Barbosa, D. Maˇ sulovi´ c, R. Nenadov. A short n ote on the characterization of countable chains with finite big Ramsey spectra. Order https://doi.org/10.1007/s11083-023-09647-5

    work page doi:10.1007/s11083-023-09647-5

  3. [3]

    D. Devlin. Some partition theorems and ultrafilters on ω . Ph.D. Thesis, Dartmouth College, 1979

    work page 1979

  4. [4]

    Erd˝ os, A

    P. Erd˝ os, A. Hajnal. On a classification of denumerable o rder types and an application to the partition calculus. Fundamenta Mathe maticae 51 (1962), 117–129

    work page 1962

  5. [5]

    Fra ¨ ıss´ e

    R. Fra ¨ ıss´ e. Sur la comparaison des types d’ordres. C. R. Acad. Sci. Paris 226 (1948) 1330–1331

    work page 1948

  6. [6]

    Fra ¨ ıss´ e

    R. Fra ¨ ıss´ e. Sur certains relations qui g´ en´ eralisent l’ordre des nombres rationnels. C. R. Acad. Sci. Paris 237(1953), 540–542

    work page 1953

  7. [7]

    Fra ¨ ıss´ e

    R. Fra ¨ ıss´ e. Sur l’extension aux relations de quelquespropri´ et´ es des or- dres. Ann. Sci. ´Ecole Norm. Sup. 71(1954), 363–388

    work page 1954

  8. [8]

    Fra ¨ ıss´ e

    R. Fra ¨ ıss´ e. Theory of relations, Revised edition, With an appendix by Norbert Sauer. Studies in Logic and the Foundations of Mathe matics,

    work page

  9. [9]

    North-Holland, Amsterdam, 2000

    work page 2000

  10. [10]

    Hausdorff

    F. Hausdorff. Grundz¨ uge einer Theorie der Geordnete Meng en. Math- ematische Annalen 65 (1908), 435–505. 37

    work page 1908

  11. [11]

    Hubiˇ cka

    J. Hubiˇ cka. Big Ramsey degrees using parameter spaces. Preprint avail- able at arXiv:2009.00967, 2020

    work page arXiv 2009

  12. [12]

    R. Laver. On Fra ¨ ıss´ e’s order type conjecture. Annals of Mathematics, 93(1971), 89–111

    work page 1971

  13. [13]

    Maˇ sulovi´ c

    D. Maˇ sulovi´ c. Pre-adjunctions and the Ramsey proper ty. European Journal of Combinatorics 70 (2018), 268–283

    work page 2018

  14. [14]

    Maˇ sulovi´ c

    D. Maˇ sulovi´ c. Finite big Ramsey degrees in universalstructures. Jour- nal of Combinatorial Theory Ser. A 170 (2020), 105–137

    work page 2020

  15. [15]

    Maˇ sulovi´ c

    D. Maˇ sulovi´ c. Ramsey degrees: big v. small. EuropeanJournal of Com- binatorics, 95 (2021), Article 103323

    work page 2021

  16. [16]

    Maˇ sulovi´ c

    D. Maˇ sulovi´ c. Big Ramsey spectra of countable chains. Order 40 (2023), 237–256

    work page 2023

  17. [17]

    Maˇ sulovi´ c, B.ˇSobot

    D. Maˇ sulovi´ c, B.ˇSobot. Countable ordinals and big Ramsey degrees. Combinatorica 41 (2021), 425–446

    work page 2021

  18. [18]

    M. Pouzet. Application de la notion de relation presque -encha ˆ ınable au d´ enombrement des restrictions finies d’une relation. Z. Math. Logik Grundlag. Math., 27 (1981) 289–332

    work page 1981

  19. [19]

    Pouzet, N

    M. Pouzet, N. M. Thi´ ery. Some relational structures wi th polynomial growth and their associated algebras I – Quasi-polynomialt y of the pro- file. The Electronic Journal of Combinatorics 20(2) (2013), #P1

    work page 2013

  20. [20]

    H. J. Pr¨ omel, B. Voigt. Baire sets of k-parameter words are Ramsey. Transactions of the American Mathematical Society, 291(19 85), 189– 201

    work page

  21. [21]

    J. H. Schmerl. Countable homogeneous partially ordere d sets. Algebra Universalis 9(1979), 317–321

    work page 1979

  22. [22]

    S. Solecki. Finite Ramsey theory through category theo ry. arXiv:2205.10446

    work page arXiv

  23. [23]

    A. Zucker. Big Ramsey degrees and topological dynamics . Groups, Geom., Dyn., 13 (2019), 235–276. 38

    work page 2019