25 problems
Finite-arity conjecture. For every , there are only finitely many -ary finitely homogeneous structures modulo trace equivalence.
Binary trace-equivalence conjecture. Every structure admitting quantifier elimination in a finite binary relational language is trace equivalent to either the trivial structure,…
Countability and finite arity conjecture. There are only countably many finitely homogeneous structures modulo trace equivalence. More strongly, for every there are only fi…
The tractability conjecture. If does not pp-construct , then is polynomial-time solvable.
Bodirsky's Ramsey expansion conjecture. Every finitely bounded homogeneous structure has a finitely bounded Ramsey expansion.
Homogeneous-structure conjecture. (i) Let be a homogeneous structure over a finite relational language . Then there is an m.e.c. with ultraproduct elementarily equivalent to…
Pp-construction conjecture. If is NP-hard, then has a pp-construction in .
The stability conjecture. Any infinite set-homogeneous -hypergraph with stable theory is complete or has complete complement.
Countability conjecture. There are finitely homogeneous structures up to trace equivalence.
Modulus-of-continuity conjecture. Every group topology on strictly coarser than is of the form for some -modulus of continuity.
Primitive homogeneous structures conjecture. The distinguishing number of every primitive homogeneous countably infinite structure is two or infinite.
Let be a finitely homogeneous NIP structure. Structural conjecture. The following hold: 1. The automorphism group acts oligomorphically on the space of…
Construction completeness conjecture. This construction produces all homogeneous finite-dimensional permutation structures.
Homogeneity-after-naming conjecture. The class remains homogeneous after naming .
3-type extension conjecture. All 3-types involving realized 2-types are realized in .
3-type realization conjecture. If realizes all 3-types, then is fully generic.
Primitivity Conjecture. Every primitive homogeneous finite-dimensional permutation structure can be constructed as follows: identify certain orders, up to reversal; then take the F…
Classification conjecture. Every homogeneous finite-dimensional permutation structure with lattice of -definable equivalence relations isomorphic to is interde…
Genericity conjecture. Then is fully generic.
Braun's Primitivity Conjecture. Every primitive homogeneous finite-dimensional permutation structure can be constructed by this procedure, yielding a fully generic structure, possi…
Cherlin's metric homogeneity classification conjecture. The countable metrically homogeneous graphs are the following: those of diameter , namely the homogeneous grap…
A structure is primitive if no nontrivial equivalence relation on its domain is invariant under its automorphism group; it is binary if its language has relation symbols of arity a…
Dichotomy conjecture. is either in P or NP-complete.
Let be a homogeneous structure with a finite relational signature. An expansion of is a structure obtained by adding relations to its signature; its age is the cl…
Thomas's conjecture. The structure has only finitely many reducts up to first-order interdefinability.