TY - ELEC
AU - Kivva, Bohdan
PY - 2018
TI - Minimal degree of the automorphism group of primitive coherent configurations
LA - eng
M3 - Moving Image
AB - 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$. In 2014 Babai proved that the automorphism group of a strongly regular graph with n vertices has minimal degree at least $cn$, with known exceptions. Strongly regular graphs correspond to primitive coherent configurations of rank 3. We extend Babai's result to primitive coherent configurations of rank 4. We also show that the result extends to non-geometric primitive distance-regular graphs of bounded diameter. The proofs combine structural and spectral methods. The results have consequences to primitive permutation groups that were previsouly known using the classification of finite simple groups (Cameron, Liebeck).
The paper is available at arXiv:1802.06959.
N2 - 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$. In 2014 Babai proved that the automorphism group of a strongly regular graph with n vertices has minimal degree at least $cn$, with known exceptions. Strongly regular graphs correspond to primitive coherent configurations of rank 3. We extend Babai's result to primitive coherent configurations of rank 4. We also show that the result extends to non-geometric primitive distance-regular graphs of bounded diameter. The proofs combine structural and spectral methods. The results have consequences to primitive permutation groups that were previsouly known using the classification of finite simple groups (Cameron, Liebeck).
The paper is available at arXiv:1802.06959.
UR - https://open.library.ubc.ca/collections/48630/items/1.0377045
ER - End of Reference