2^_0 pairwise nonisomorphic maximal-closed subgroups of Sym( N) via the classification of the reducts of the Henson digraphs
DOI10.1017/JSL.2017.74OpenAlexW2963490073MaRDI QIDQ4579799FDOQ4579799
Authors: Lovkush Agarwal, Michael Kompatscher
Publication date: 10 August 2018
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.07674
Recommendations
typesfirst-order definabilityreductsorbitshomogeneous structurecanonical functionsHenson digraphsmaximal-closed subgroups of \(\mathrm{Sym}(\mathbb{N})\)
Subgroups of symmetric groups (20B35) Basic properties of first-order languages and structures (03C07) Model theory of denumerable and separable structures (03C15) Interpolation, preservation, definability (03C40) Infinite automorphism groups (20B27)
Cites Work
- Title not available (Why is that?)
- Ramsey classes of set systems
- Transitivity of permutation groups on unordered sets
- Title not available (Why is that?)
- Decidability of definability
- Ramsey precompact expansions of homogeneous directed graphs
- A survey of homogeneous structures
- Subgroups of Infinite Symmetric Groups
- The universal homogeneous binary tree
- Countable Ultrahomogeneous Undirected Graphs
- Reducts of Ramsey structures
- Reducts of random hypergraphs
- The 116 reducts of (â, <, a)
- Reducts of the random graph
- Reducts of the random partial order
- The 42 reducts of the random ordered graph
- Permutations on the random permutation
- Countable homogeneous relational structures and â”0-categorical theories
- On the Reconstruction of â”0 -Categorical Structures from their Automorphism Groups
- Reducts of the generic digraph
- Collineation group as a subgroup of the symmetric group.
- The affine and projective groups are maximal
- Reducts of structures and maximal-closed permutation groups
Cited In (7)
- A note on automorphism groups of countably infinite structures
- Reducts of structures and maximal-closed permutation groups
- Permutation groups with small orbit growth
- Reducts of the generic digraph
- Title not available (Why is that?)
- Forbidden tournaments and the orientation completion problem
- $2^{\aleph_0}$ pairwise non-isomorphic maximal-closed subgroups of Sym$(\mathbb{N})$ via the classification of the reducts of the Henson digraphs
This page was built for publication: \(2^{\aleph_{0}}\) pairwise nonisomorphic maximal-closed subgroups of \(\mathrm{Sym}(\mathbb N)\) via the classification of the reducts of the Henson digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579799)