15 problems
- 0 votes0 replies0 views
Polynomial-growth conjecture for profiles of relational structures
Profile quasi-polynomial conjecture. If has bounded signature or finite kernel and is bounded by some polynomial, then is a quasi-polynomial.
- 0 votes0 replies0 views
Intractability beyond independent hereditary TOWS classes
A class of relational structures is independent when it has the relevant independence property, and it is hereditary when it is closed under induced substructures. A TOWS graph is…
- 0 votes0 replies0 views
Pouzet's conjecture on totally ordering omega-well structured relational structures
Pouzet's conjecture. Every -well structured relational structure is a reduct of an -well structured, totally ordered structure.
- 0 votes0 replies0 views
Finite basis conjecture for relational structures without finite monomorphic decomposition
Let be a finite relational signature, and let be the class of all relational structures of signature without any finite monomorphic decomposition. A…
- 0 votes0 replies0 views
Finitarity conjecture for monads induced by continuous equation schemes
A continuous equation scheme is understood in the sense of MPP16, and each such scheme induces a monad on the relevant category of relational structures. Finitarity conjecture. Mon…
- 0 votes0 replies0 views
Finite monomorphic decomposition sibling conjecture
Let be a relational structure with a finite monomorphic decomposition, and let siblings be counted up to isomorphism. Finite monomorphic decomposition conjecture. Under this as…
- 0 votes0 replies0 views
Cellularity characterization of countable sibling numbers
Let be a relational structure, and let denote the number of siblings of , counted up to isomorphism. A structure is cellular in the sense used in the…
- 0 votes0 replies0 views
Finite basis conjecture for relational structures without finite monomorphic decompositions
Finite basis conjecture. There is a finite subset of pairwise incomparable structures in such that every member of embeds some m…
- 0 votes0 replies0 views
Cameron–Glynn algebra isomorphism conjecture for age-inexhaustible structures
Let be an age-inexhaustible relational structure, meaning that any two finite substructures of have disjoint copies within . Let the Camero…
- 0 votes0 replies2 views
Quasi-polynomiality conjecture for profiles of bounded-signature structures
Quasi-polynomiality conjecture. If is bounded by some polynomial, then is eventually a quasi-polynomial.
- 0 votes0 replies0 views
Quasi-polynomiality conjecture for profiles with finite kernel
Quasi-polynomiality conjecture. If is bounded by some polynomial, then is eventually a quasi-polynomial.
- 0 votes0 replies0 views
Equivalence conjecture for regular relational symplectic groupoids
Equivalence conjecture. Any two regular relational symplectic groupoids integrating are equivalent.
- 0 votes0 replies0 views
Pouzet's rationality conjecture for subexponential age profiles
Pouzet's conjecture. Under weak hypotheses, the generating series of the profile is a rational function whenever the growth of is subexponential.
- 0 votes0 replies0 views
Eventual quasi-polynomiality for profiles with bounded signature or finite kernel
Let be a relational structure with profile . Assume that has bounded signature or finite kernel, and that is bounded by some polynomial in . Ev…
- 0 votes0 replies0 views
Eventual quasi-polynomiality of profiles with finite kernel
Let be a relational structure with profile , and let the kernel of be finite. Assume that is bounded by some polynomial in . Eventual quasi-pol…