Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs

DOI10.1515/FORUM-2016-0056MaRDI QIDQ2363345zbMATH OpenOpenAlexFDO

Authors J. Jonušas, J. D. Mitchell

Publication date 13 July 2017

Published in Forum Mathematicum (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.05766

zbMATH Keywords

automorphism groupsPolish groupstopological generationFraïssé limits

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30) Topological groups (topological aspects) (54H11) Infinite automorphism groups (20B27)

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 $K_n$ with $ninmathbbN$ vertices; the $K_n$-free graphs; finite unions of the infinite complete graph $K_{omega}$; and duals of such graphs. The groups $operatornameAut(Gamma)$ of automorphisms of such graphs $Gamma$ have a natural topology, which is compatible with multiplication and inversion, i.e. the groups $operatornameAut(Gamma)$ are topological groups. We consider the problem of finding minimally generated dense subgroups of the groups $operatornameAut(Gamma)$ where $Gamma$ is ultrahomogeneous. We show that if $Gamma$ is ultrahomogeneous, then $operatornameAut(Gamma)$ has 2-generated dense subgroups, and that under certain conditions given $finoperatornameAut(Gamma)$ there exists $ginoperatornameAut(Gamma)$ such that the subgroup generated by $f$ and $g$ is dense. We also show that, roughly speaking, $g$ can be chosen with a high degree of freedom. For example, if $Gamma$ is either an infinite disjoint unions of $K_n$ or a finite union of $K_{omega}$, then $g$ can be chosen to have any given finite set of orbit representatives.

Recommendations

• The group of almost automorphisms of the countable universal graph
• Topological groups, automorphisms of infinite graphs and a theorem of Trofimov
• Automorphism groups of graphs as topological groups
• A note on graphs with countable automorphism group
• Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
• scientific article; zbMATH DE number 4010538
• Cycle-types in the automorphism groups of countable homogeneous graphs
• Topological dynamics of automorphism groups, ultrafilter combinatorics, and the generic point problem
• On automorphism groups of countable structures
• Automorphism groups of comparability and covering graphs

Cites work

• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• 3/2—Generation of the sporadic simple groups
• Approximation of automorphisms of the rationals and the random graph.
• Asymmetric graphs
• Countable Ultrahomogeneous Undirected Graphs
• Density theorems for measurable transformations
• Extending partial isometries
• GROUPS OF AUTOMORPHISMS OF N₀-CATEGORICAL STRUCTURES
• Generating Dense Subgroups of Measure Preserving Transformations
• Highly transitive subgroups of the symmetric group on the natural numbers
• Turbulence, amalgamation, and generic automorphisms of homogeneous structures
• \(1\tfrac 12\)-generation of finite simple groups

Cited in

(3)

• Dense free subgroups of automorphism groups of homogeneous partially ordered sets
• Automorphism groups of finite topological rank
• Large free subgroups of automorphism groups of ultrahomogeneous spaces

This page was built for publication: Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363345)