mathematical logic

Structures with not too fast unlabelled growth

arXiv:2507.16985

summary

The paper classifies all relational structures whose orbit‑growth on n‑element subsets is bounded by 2ⁿ divided by any polynomial, describing them via their automorphism groups, showing they are first‑order interpretable in (ℚ,<) and interdefinable with finitely bounded homogeneous structures, and proving they have only finitely many first‑order reducts, thus confirming Thomas' conjecture for this class.

Abstract

Let be the class of all structures whose growth rate on orbits of subsets of size is not faster than for any polynomial . In this article we give a complete classification of all structures in in terms of their automorphism groups. As a consequence of our classification we show that has only countably many structures up to bidefinability, all these structures are first-order interpretable in and they are interdefinable with a finitely bounded homogeneous structure. Furthermore, we also show that all structures in have finitely many first-order reduct up to interdefinability, thereby confirming Thomas' conjecture for the class .

Topics & keywords

#orbit growth#automorphism groups#homogeneous structures#first-order reducts#Thomas conjecturegrowth rateautomorphism groupfirst-order interpretabilityfinitely bounded homogeneousbidefinabilitymodel theory
Structures with not too fast unlabelled growth · wovepaper