April 29, 2024Open Access

Classifying primitive solvable permutation groups of rank 5 and 6

Key Points

Key points are not available for this paper at this time.

Abstract

Abstract Let 𝐺 be a finite solvable permutation group acting faithfully and primitively on a finite set Ω. Let G 0 G₀ be the stabilizer of a point 𝛼 in Ω. The rank of 𝐺 is defined as the number of orbits of G 0 G₀ in Ω, including the trivial orbit α \\. In this paper, we completely classify the cases where 𝐺 has rank 5 and 6, continuing the previous works on classifying groups of rank 4 or lower.

Read Full Paperexternally

Bookmark

View Full Paper

Cite This Study

Dey et al. (Mon,) studied this question.

synapsesocial.com/papers/68e6d073b6db64358764ea12 https://doi.org/https://doi.org/10.1515/jgth-2023-0205

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Representations of Solvable Groups1993 · 383 citations
2The Finite Primitive Permutation Groups of Rank Three1986 · 105 citations
3Primitive rank 3 groups with a prime subdegree1965 · 40 citations
4Generators and Relations for Discrete Groups1972 · 1,511 citations
5A polynomial-time algorithm for the change-making problem2004 · 60 citations

Bookmark

View Full Paper