$2^{\aleph_0}$ pairwise non-isomorphic maximal-closed subgroups of Sym$(\mathbb{N})$ via the classification of the reducts of the Henson digraphs

25 Sep 2015  ·  Agarwal Lovkush, Kompatscher Michael ·

Given two structures $\mathcal{M}$ and $\mathcal{N}$ on the same domain, we say that $\mathcal{N}$ is a reduct of $\mathcal{M}$ if all $\emptyset$-definable relations of $\mathcal{N}$ are $\emptyset$-definable in $\mathcal{M}$. In this article the reducts of the Henson digraphs are classified... Henson digraphs are homogeneous countable digraphs that omit some set of finite tournaments. As the Henson digraphs are $\aleph_0$-categorical, determining their reducts is equivalent to determining all closed supergroups $G<$ Sym$(\mathbb{N})$ of their automorphism groups. A consequence of the classification is that there are $2^{\aleph_0}$ pairwise non-isomorphic Henson digraphs which have no proper non-trivial reducts. Taking their automorphisms groups gives a positive answer to a question of Macpherson that asked if there are $2^{\aleph_0}$ pairwise non-conjugate maximal-closed subgroups of Sym$(\mathbb{N})$. By the reconstruction results of Rubin, these groups are also non-isomorphic as abstract groups. read more

PDF Abstract
No code implementations yet. Submit your code now

Categories


Logic Combinatorics Group Theory