On the maximal number of coprime subdegrees in finite primitive permutation groups
classification
🧮 math.GR
math.CO
keywords
subdegreesgroupnon-trivialprimitivecoprimefinitepermutationgroups
read the original abstract
The subdegrees of a transitive permutation group are the orbit lengths of a point stabilizer. For a finite primitive permutation group which is not cyclic of prime order, the largest subdegree shares a non-trivial common factor with each non-trivial subdegree. On the other hand it is possible for non-trivial subdegrees of primitive groups to be coprime, a famous example being the rank 5 action of the small Janko group on 266 points which has subdegrees of lengths 11 and 12. We prove that, for every finite primitive group, the maximal size of a set of pairwise coprime non-trivial subdegrees is at most 2.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.