Extremely amenable automorphism groups of countable structures
Abstract
In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are separable 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 classification problem from the point of view of descriptive set theory by showing that the class of all extremely amenable closed subgroups of S∞ is Borel and their isomorphism relation is more complex than any isomorphism relation of countable structures in the Borel reducibility hierarchy.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.