Many symmetrically indivisible structures
From MaRDI portal
Publication:2947239
DOI10.1002/MALQ.201400091zbMATH Open1354.03041arXiv1411.1202OpenAlexW3125236107MaRDI QIDQ2947239FDOQ2947239
Publication date: 22 September 2015
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
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 symmetric indivisibility of countable structures" (Cont. Math. 558(1):453--466): Let be a symmetrically indivisible structure in a language . Let . Is symmetrically indivisible?
Full work available at URL: https://arxiv.org/abs/1411.1202
Recommendations
Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63) Transversal (matching) theory (05D15) Model theory of denumerable and separable structures (03C15) Applications of model theory (03C98)
Cites Work
Cited In (1)
This page was built for publication: Many symmetrically indivisible structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947239)