Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 25 Sep 2015 in math.LO, math.CO, and math.GR

Abstract: 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.

Summary

We haven't generated a summary for this paper yet.