Papers
Topics
Authors
Recent
Search
2000 character limit reached

Extremely amenable automorphism groups of countable structures

Published 5 Nov 2024 in math.LO and math.GN | (2411.02760v1)

Abstract: In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are seprable metrizable or even Polish? We show that there are continuum many such groups. In fact we construct continuum many pairwise non-isomorphic extremely amenable groups as automorphism groups of countable structures. We also consider this classicfication problem from the point of view of descriptive set theory by showing that the class of all extremely amenable closed subgroups of $S_\infty$ is Borel and by obtaining some lower bounds for their isomorphism relation in the Borel reducibility hierarchy.

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.

Open Problems

We haven't generated a list of open problems mentioned in 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.