Papers
Topics
Authors
Recent
Search
2000 character limit reached

Oligomorphic groups, their automorphism groups, and the complexity of their isomorphism

Published 3 Oct 2024 in math.LO and math.GR | (2410.02248v2)

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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 4 likes about this paper.