Rough ends of infinite primitive permutation groups.

DOI10.1515/JGT.2011.108zbMATH Open1252.20001arXiv1012.0537OpenAlexW3102294288MaRDI QIDQ2903544FDOQ2903544

Authors: Simon M. Smith 

Publication date: 10 August 2012

Published in: Journal of Group Theory (Search for Journal in Brave)

Abstract: If $G$ is a group of permutations of a set $Omega$, then the suborbits of $G$ are the orbits of point-stabilisers $G_{a}lpha$ acting on $Omega$. The cardinalities of these suborbits are the subdegrees of $G$. Every infinite primitive permutation group $G$ with finite subdegrees acts faithfully as a group of automorphisms of a locally-finite connected vertex-primitive directed graph $Gamma$ with vertex set $Omega$, and there is consequently a natural action of $G$ on the ends of $Gamma$. We show that if $G$ is closed in the permutation topology of pointwise convergence, then the structure of $G$ is determined by the length of any orbit of $G$ acting on the ends of $Gamma$. Examining the ends of a Cayley graph of a finitely generated group to determine the structure of the group is often fruitful. B. Kr{"o}n and R. G. M{"o}ller have recently generalised the Cayley graph to what they call a {it rough Cayley graph}, and they call the ends of this graph the {it rough ends} of the group. It transpires that the ends of $Gamma$ are the rough ends of $G$, and so our result is equivalent to saying that the structure of a closed primitive group $G$ whose subdegrees are all finite is determined by the length of any orbit of $G$ on its rough ends.

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

Recommendations

• Subdegree growth rates of infinite primitive permutation groups.
• Orbital digraphs of infinite primitive permutation groups
• Analogues of Cayley graphs for topological groups
• Action of primitive groups
• Infinite primitive directed graphs

zbMATH Keywords

subdegreesorbital digraphssuborbitsinfinite primitive permutation groupsorbits of point-stabilizersrough Cayley graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Primitive groups (20B15) General theory for infinite permutation groups (20B07)

Cites Work

• Analogues of Cayley graphs for topological groups
• Topological groups and infinite graphs
• Intersection matrices for finite permutation groups
• On the structure of infinite vertex-transitive graphs
• Infinite primitive directed graphs
• Subdegree growth rates of infinite primitive permutation groups.
• Orbital digraphs of infinite primitive permutation groups

Cited In (2)

• Orbital digraphs of infinite primitive permutation groups
• Subdegree growth rates of infinite primitive permutation groups.

This page was built for publication: Rough ends of infinite primitive permutation groups.

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