The slowest-growth conjecture outside the order-interpretable class

Let c9c9-categorical mean categorical in every infinite cardinality, and for an c9c9-categorical structure c4c4 let un(c4)u_n(c4) be the number of orbits of c0goperatornameAut(c4)c0 goperatorname{Aut}(c4) on nn-element subsets of c4c4. Let a4a4 be the countable circular order and let b2c4a0b2c4a0 denote its betweenness relation.

Slowest-growth conjecture. If an c9c9-categorical structure c4c4 is not interpretable in (Q;<)(\mathbb Q;<), then

un(c4)un((S;Betw))u_n(c4)\geq u_n((\mathbb S;\operatorname{Betw}))

for all sufficiently large nn.

The claim formalizes the observation that the circular-order betweenness structure appears to have the slowest known unlabelled growth outside the class of structures interpretable in (Q;<)(\mathbb Q;<). It remains open.

Sources & referencesView supporting material

Primary source

Manuel Bodirsky, Bertalan Bodor and Paolo Marimon, “Taking model-complete cores”, arXiv:2512.21278 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.