Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs
J. Jonu\v{s}as, J. D. Mitchell

TL;DR
This paper investigates the automorphism groups of countable ultrahomogeneous graphs, demonstrating they contain 2-generated dense subgroups and exploring conditions for their construction with high freedom.
Contribution
It proves the existence of 2-generated dense subgroups in automorphism groups of ultrahomogeneous graphs and details methods for constructing such subgroups with flexible elements.
Findings
Automorphism groups of ultrahomogeneous graphs have 2-generated dense subgroups.
Conditions under which a given automorphism can generate a dense subgroup with another automorphism.
High freedom in choosing the second generator, including specific orbit structures.
Abstract
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random graph; infinite disjoint unions of complete graphs with vertices; the -free graphs; finite unions of the infinite complete graph ; and duals of such graphs. The groups of automorphisms of such graphs have a natural topology, which is compatible with multiplication and inversion, i.e.\ the groups are topological groups. We consider the problem of finding minimally generated dense subgroups of the groups where is ultrahomogeneous. We show that if is ultrahomogeneous, then …
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.
Taxonomy
TopicsAdvanced Topology and Set Theory · Amino Acid Enzymes and Metabolism · Finite Group Theory Research
