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

TL;DR
This paper classifies the reducts of Henson digraphs, showing there are continuum many non-isomorphic structures with no proper non-trivial reducts, and constructs many maximal-closed subgroups of Sym$( ats)$ answering a longstanding question.
Contribution
It provides a complete classification of reducts of Henson digraphs and constructs continuum many non-isomorphic maximal-closed subgroups of Sym$( ats)$.
Findings
There are $2^{eth_0}$ non-isomorphic Henson digraphs with no proper non-trivial reducts.
There exist $2^{eth_0}$ pairwise non-conjugate maximal-closed subgroups of Sym$( ats)$.
These groups are also non-isomorphic as abstract groups.
Abstract
Given two structures and on the same domain, we say that is a reduct of if all -definable relations of are -definable in . 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 -categorical, determining their reducts is equivalent to determining all closed supergroups Sym of their automorphism groups. A consequence of the classification is that there are 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 pairwise non-conjugate maximal-closed subgroups of…
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.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Advanced Operator Algebra Research
