Rough ends of infinite primitive permutation groups.
From MaRDI portal
Publication:2903544
Abstract: If is a group of permutations of a set , then the suborbits of are the orbits of point-stabilisers acting on . The cardinalities of these suborbits are the subdegrees of . Every infinite primitive permutation group with finite subdegrees acts faithfully as a group of automorphisms of a locally-finite connected vertex-primitive directed graph with vertex set , and there is consequently a natural action of on the ends of . We show that if is closed in the permutation topology of pointwise convergence, then the structure of is determined by the length of any orbit of acting on the ends of . 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 are the rough ends of , and so our result is equivalent to saying that the structure of a closed primitive group whose subdegrees are all finite is determined by the length of any orbit of on its rough ends.
Recommendations
Cites work
- Analogues of Cayley graphs for topological groups
- Infinite primitive directed graphs
- Intersection matrices for finite permutation groups
- On the structure of infinite vertex-transitive graphs
- Orbital digraphs of infinite primitive permutation groups
- Subdegree growth rates of infinite primitive permutation groups.
- Topological groups and infinite graphs
Cited in
(2)
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)