
TL;DR
The paper introduces a method to construct numerous non-isomorphic symmetrically indivisible structures and shows that symmetric indivisibility may not be preserved under language restriction.
Contribution
It provides a general construction technique for symmetrically indivisible structures and answers a key open question negatively.
Findings
Constructed 2^{} non-isomorphic structures
Demonstrated symmetric indivisibility is not necessarily preserved under language restriction
Provided a negative answer to an open question in the field
Abstract
A structure in a first-order language is \emph{indivisible} if for every coloring of in two colors, there is a monochromatic such that . Additionally, we say that is symmetrically indivisible if can be chosen to be \emph{symmetrically embedded} in (that is, every automorphism of can be extended to an automorphism of ). In the following paper we give a general method for constructing new symmetrically indivisible structures out of existing ones. Using this method, we construct many non-isomorphic symmetrically indivisible countable structures in given (elementary) classes and answer negatively the following question asked by A. Hasson, M. Kojman and A. Onshuus in "On…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
