Papers › Classifying Primitive Solvable Permutation Groups of Rank 5 and 6
Classifying Primitive Solvable Permutation Groups of Rank 5 and 6
Anakin Dey, Kolton O'Neal, Duc Van Khanh Tran, Camron Upshur, Yong Yang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Let G be a finite solvable permutation group acting faithfully and primitively on a finite set Ω. Let G₀ be the stabilizer of a point α∈Ω The rank of G is defined as the number of orbits of G₀ in Ω, including the trivial orbit {α}. In this paper, we completely classify the cases where G has rank 5 and 6, continuing the previous works on classifying groups of rank 4 or lower.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections