Finite basis conjecture for relational structures without finite monomorphic decomposition
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 structure embeds a structure if there is an embedding from into . Finite basis conjecture. The class contains a finite subset of pairwise incomparable structures such that every member of embeds some member of . This conjecture asks for a finite basis, under embeddability, for the structures without finite monomorphic decomposition; the source states that the preceding reduction result is known, but that the relevant theorem is not known to extend in general. The status of this finite-basis assertion is not established in the supplied text.
Sources & referencesView supporting material
Primary source
Djamila Oudrar and Maurice Pouzet, “Ordered structures with no finite monomorphic decomposition. Application to the profile of hereditary classes”, arXiv:2312.05913 (2023).
Additional references
2 papers in this index state this conjecture (2014–2023). The statement above is taken from the most recent of them; the others are arXiv:1409.1432.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.