On the automorphism groups of rank-4 primitive coherent configurations

2021/10/26 by Bohdan Kivva, Kivva, Bohdan
Computer Science · Mathematics · #Advanced Differential Equations and Dynamical Systems #Algebraic Geometry and Number Theory #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR)

paper · pdf · doi:10.48550/arxiv.2110.13861

openalex publication_date 2021/10/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The minimal degree of a permutation group G is the minimum number of points not fixed by non-identity elements of G. Lower bounds on the minimal degree have strong structural consequences on G. Babai conjectured that if a primitive coherent configuration with n vertices is not a Cameron scheme, then its automorphism group has minimal degree ≥ cn for some constant c>0. In 2014, Babai proved the desired lower bound on the minimal degree of the automorphism groups of strongly regular graphs, thus confirming the conjecture for primitive coherent configurations of rank 3. In this paper, we extend Babai's result to primitive coherent configurations of rank 4, confirming the conjecture in this special case. The proofs combine structural and spectral methods.

Related

• On the automorphism groups of distance-regular graphs and rank-4\n primitive coherent configurations
• Structure and automorphisms of primitive coherent configurations
• On the minimal degree and base size of finite primitive groups
• The Primitive Permutation Groups of Degree Less Than 4096
• Minimal degrees for faithful permutation representations of groups of order p⁶ where p is an odd prime