Primitive pseudo-finite permutation groups of finite SU-rank

2025/04/11 by Ulla Karhumäki, Karhumäki, Ulla, Nicholas Ramsey +1 · 1 citation
Engineering · Mathematics · #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Logic (math.LO) #Rings, Modules, and Algebras #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2504.08501

openalex publication_date 2025/04/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study definably primitive pseudo-finite permutation groups of finite SU-rank. We show that if (G,X) is such a permutation group, then the rank of G can be bounded in terms of the rank of X, providing an analogue of a theorem of Borovik and Cherlin in the setting of definably primitive permutation groups of finite Morley rank.

Cited by

• When any four solutions are independent

Related

• Primitive permutation groups of finite Morley rank and affine type
• The Primitive Permutation Groups of Degree Less Than 4096
• Classifying Solvable Primitive Permutation Groups of Low Rank
• Primitive permutation groups of bounded orbital diameter
• On groups of finite upper rank