More Universal Minimal Flows of Groups of Automorphisms of Uncountable Structures
Dana Bartosova

TL;DR
This paper computes universal minimal flows for automorphism groups of various uncountable homogeneous structures, expanding the class of known extremely amenable groups and providing a straightforward construction method.
Contribution
It introduces a simple construction for uncountable homogeneous structures and determines their automorphism groups' universal minimal flows, broadening the understanding of extremely amenable groups.
Findings
Computed universal minimal flows for automorphism groups of uncountable structures
Provided a new easy construction method for these structures
Expanded the class of known extremely amenable groups
Abstract
In this paper, we compute universal minimal flows of groups of automorphisms of uncountable -homogeneous graphs, -free graphs, hypergraphs, partially ordered sets, and their extensions with an -homogeneous ordering. We present an easy construction of such structures, expanding the jungle of extremely amenable groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
