Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.25715

Big Ramsey degrees and structures in relational languages

Yifan Hu
View original source ↗Read source document ↗Export metadata ↓

Abstract

We establish a precompact transfer theorem for big Ramsey structures and a uniform envelope theorem for valuation hypergraphs. These yield big Ramsey structures for generic injective relational structures in languages with finitely many symbols of each positive arity, answering the existence part of Problem 6.3.2 of Balko et al. (arXiv:2110.08409), and refute Conjecture 4.7 of Braunfeld et al. (arXiv:2301.13116). We also construct a finitely constrained free amalgamation class in a finite language of maximum arity three whose Fraïssé limit has infinite singleton big Ramsey degree, giving a negative answer to the existence question in Problem 6.3.3 of Balko et al.

Explore related subjects

math.LOmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yifan Hu. 2026-10-19. Big Ramsey degrees and structures in relational languages. https://arxiv.org/abs/2610.25715

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Ultrahomogeneity of monounary algebras

A structure is ultrahomogeneous if every isomorphism between finitely generated substructures can be extended to an automorphism of the structure. The aim of this paper is to provide an explicit description of ultrahomogeneous monounary algebras of arbitrary cardinalities. We also show that a monounary algebra is ultrahomogeneous if and only if it is 1-ultrahomogeneous. These results are then viewed in the context of a several related concepts, including $ω$-categoricity, homomorphism-homogeneity, (partial-)homogeneity, and transitivity.

math.LO↗
arXiv2026

Elementary modal logics and circuit complexity

A modal logic is elementary if it is sound and complete with respect to an elementary class of Kripke frames. We prove that if a finitely axiomatizable modal logic $L$ is elementary, then the validity problem for $L$, which asks whether a given finite Kripke frame validates $L$, is in the circuit complexity class uniform $\mathsf{AC}^0$. As an application, we construct infinitely many finitely axiomatizable $\mathsf{K4}$-stable logics that are not elementary. This result provides a negative answer to Problem 6.4 in [Bezhanishvili et al., 2018] for $\mathsf{K4}$-stable logics.

math.LO↗
arXiv2026

Jumps and Iterated Jumps of Perfect Subtrees of Positive Trees

An infinite (binary) tree is \emph{positive} iff its set of paths is non-null. As an elementary observation, positives trees always have positive perfect subtrees. Given a positive tree of certain complexity, here we present several theorems concerning the distribution of the Turing jumps or iterated Turing jumps of (positive) perfect subtrees of the given tree in the universe of Turing degrees.

math.LO↗