ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let c9c9-categorical mean categorical in every infinite cardinality, and for an c9c9-categorical structure c4c4 let un(c4)u_n(c4) denote the number of orbits of c0goperatornameAut(c4)c0 goperatorname{Aut}(c4) on nn-element subsets of c4c4. A structure is bidefinable with another when each is definable in the other. Let S(2)S(2) be the generic two-tournament structure and let its betweenness reduct be the reduct mentioned in the source.

Primitive intermediate-growth conjecture. If a primitive c9c9-categorical structure c4c4 satisfies

2np(n)<un(c4)<2nq(n)\frac{2^n}{p(n)}<u_n(c4)<\frac{2^n}{q(n)}

for some polynomials pp and qq, then c4c4 is bidefinable with S(2)S(2) or its betweenness reduct.

The conjecture proposes a classification of primitive c9c9-categorical structures with orbit growth lying between two polynomially corrected copies of 2n2^n. The source presents it after noting that the circular-order betweenness structure has the slowest known primitive growth in this range; it remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.