Home Mathematics Rough ends of infinite primitive permutation groups
Article
Licensed
Unlicensed Requires Authentication

Rough ends of infinite primitive permutation groups

  • Simon M. Smith EMAIL logo
Published/Copyright: March 6, 2012
Journal of Group Theory
From the journal Volume 15 Issue 2

Abstract.

If is a group of permutations of a set , then the suborbits of  are the orbits of point-stabilizers 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ön and R. G. Möller have recently generalised the Cayley graph to what they call a rough Cayley graph, and they call the ends of this graph the 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.

Received: 2010-12-02
Revised: 2011-10-16
Published Online: 2012-03-06
Published in Print: 2012-March

© 2012 by Walter de Gruyter Berlin Boston

Downloaded on 2.3.2026 from https://www.degruyterbrill.com/document/doi/10.1515/jgt.2011.108/html
Scroll to top button