Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 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

Oligomorphic groups, their automorphism groups, and the complexity of their isomorphism (2410.02248v2)

Published 3 Oct 2024 in math.LO and math.GR

Abstract: The paper follows two interconnected directions. 1. Let $G$ be a Roelcke precompact closed subgroup of the group $\Sym(\omega)$ of permutations of the natural numbers. Then $\Inn(G)$ is closed in $\Aut(G)$, where $\Aut(G)$ carries the topology of pointwise convergence for its (faithful) action on the cosets of open subgroups. Under the stronger hypothesis that~$G$ is oligomorphic, $N_G/G$ is profinite, where $N_G$ denotes the normaliser of~$G$ in $\Sym(\omega)$, and the topological group $\Out(G)= \Aut(G)/\Inn(G)$ is totally disconnected, locally compact. 2a. We provide a general method to show smoothness of the isomorphism relation for appropriate Borel classes of oligomorphic groups. We apply it to two such classes: the oligomorphic groups with no algebraicity, and the oligomorphic groups with finitely many {essential} subgroups up to conjugacy. 2b. Using this method we also show that if $G$ is in such a Borel class, then $\Aut(G)$ is topologically isomorphic to an oligomorphic group, and $\Out(G)$ is profinite.

Summary

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

X Twitter Logo Streamline Icon: https://streamlinehq.com