Skip to content
DraconiticResearch
Search Sources API
186,625 studies31 sourcesUpdated 18 min ago
PreprintarXiv licencearXiv

Vaught's Conjecture for Sums of Products of Rooted Trees

Abstract

We confirm Vaught's conjecture for each partial order 𝕏=βˆ‘ π•€βˆ j<mi𝕏i,j from the closure ⟨ ⟨ π’žrt⟩ Π⟩ Ξ£ of the class π’žrt of rooted trees under finite direct products and lexicographic sums. In addition, (a) 𝒯:=mathopTh (𝕏) is Ο‰-categorical iff all the theories 𝒯i,j:=mathopTh (𝕏i,j) are Ο‰-categorical; (b) 𝒯 satisfies VCβ™― (that is, I(𝒯)∈ {1,c}), if VCβ™― holds for all 𝒯i,j. If π•βˆˆ ⟨ ⟨ π’žrtfa⟩ Π⟩ Ξ£, where π’žrtfa is the class of finitely axiomatizable rooted trees, then (c) 𝒯 is finitely axiomatizable and (d) π•βˆˆ mathopMod (𝒯) iff 𝕐 β‰… βˆ‘ π•€βˆ j<mi𝕐i,j, where 𝕐i,j∈ mathopMod (𝒯i,j), for all indices. As a by-product we prove that (e) For each n the class π’ž n of partial orders isomorphic to a direct product of n rooted trees of size >1 is first-order definable; (f) Each Ο‰-categorical partial order from the class ⟨ ⟨ π’žrtfb⟩ Π⟩ Ξ£, where π’žrtfb is the class of finite-branching rooted trees, is finitely axiomatizable. Statement (f) is related to the results of Rosenstein (for the class of linear orders) and Schmerl (for the class of partial orders of finite width).

Related

  1. A counterexample to Vaught's Conjecture for Lω1,ω
    Nathanael L. Ackerman, Cameron E. Freer, Robin W. Knight
    arXivPreprintCC BY 4.0Full textLogic & foundationsarXiv
  2. The Type Ο‰-Vaught's Conjecture for Ο‰-stable Theories
    Hongyu Zhu
    arXivPreprintCC BY 4.0Full textLogic & foundationsarXiv
  3. Compactness of composition operators on Hardy spaces of homogeneous rooted trees
    Lei Liu, Wanxin Ma
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Dynamics of Weighted Backward Shifts on CesΓ ro Spaces of Rooted Trees
    Xiang Chen, Meng-Huan Cheng, Liang Zhang +1
    arXivPreprintarXiv licenceFull textAnalysis & PDEsDynamical systemsarXiv
  5. Hall algebras of graphs and rooted trees
    Lucas Toury
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{kurilic2026vaughts,
  title = {{Vaught's Conjecture for Sums of Products of Rooted Trees}},
  author = {Miloő S. Kurilić},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.28606},
  eprint = {2609.28606},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.28606},
}
RIS
TY  - UNPB
TI  - Vaught's Conjecture for Sums of Products of Rooted Trees
AU  - Miloő S. Kurilić
PY  - 2026
DA  - 2026/09/23
PB  - arXiv
DO  - 10.48550/arxiv.2609.28606
UR  - https://arxiv.org/abs/2609.28606
AB  - We confirm Vaught's conjecture for each partial order 𝕏=βˆ‘ _π•€βˆ _j<m_i𝕏_i,j from the closure ⟨ ⟨ π’ž^rt⟩ _Π⟩ _Ξ£ of the class π’ž^rt of rooted trees under finite direct products and lexicographic sums. In addition, (a) 𝒯:=mathopTh (𝕏) is Ο‰-categorical iff all the theories 𝒯_i,j:=mathopTh (𝕏_i,j) are Ο‰-categorical; (b) 𝒯 satisfies VC^β™― (that is, I(𝒯)∈ {1,c}), if VC^β™― holds for all 𝒯_i,j. If π•βˆˆ ⟨ ⟨ π’ž^rt_fa⟩ _Π⟩ _Ξ£, where π’ž^rt_fa is the class of finitely axiomatizable rooted trees, then (c) 𝒯 is finitely axiomatizable and (d) π•βˆˆ mathopMod (𝒯) iff 𝕐 β‰… βˆ‘ _π•€βˆ _j<m_i𝕐_i,j, where 𝕐_i,j∈ mathopMod (𝒯_i,j), for all indices. As a by-product we prove that (e) For each n the class π’ž _n of partial orders isomorphic to a direct product of n rooted trees of size >1 is first-order definable; (f) Each Ο‰-categorical partial order from the class ⟨ ⟨ π’ž^rt_fb⟩ _Π⟩ _Ξ£, where π’ž^rt_fb is the class of finite-branching rooted trees, is finitely axiomatizable. Statement (f) is related to the results of Rosenstein (for the class of linear orders) and Schmerl (for the class of partial orders of finite width).
ER  -