On the automorphism groups of rank-4 primitive coherent configurations
From MaRDI portal
(Redirected from Publication:6144399)
Abstract: The minimal degree of a permutation group is the minimum number of points not fixed by non-identity elements of . Lower bounds on the minimal degree have strong structural consequences on . Babai conjectured that if a primitive coherent configuration with vertices is not a Cameron scheme, then its automorphism group has minimal degree for some constant . 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.
Recommendations
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- On minimal degrees and base sizes of primitive permutation groups
- On the spectral gap and the automorphism group of distance-regular graphs
- Hamming sandwiches
- On primitive 2-closed permutation groups of rank at most four
Cites work
- A characterization of Grassmann graphs
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- A note on the asymptotic and computational complexity of graph distinguishability
- Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
- Coherent configurations. I
- Congruent Graphs and the Connectivity of Graphs
- Distance-regular graphs
- Fast matrix multiplication using coherent configurations
- Faster canonical forms for primitive coherent configurations (extended abstract)
- Finite Permutation Groups and Finite Simple Groups
- Flag algebras of symmetric design
- Graph isomorphism in quasipolynomial time (extended abstract)
- Hamming sandwiches
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3016185 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces
- Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems
- On characterizing certain graphs with four eigenvalues by their spectra
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- On minimal degrees and base sizes of primitive permutation groups
- On the automorphism groups of strongly regular graphs. I
- On the automorphism groups of strongly regular graphs. II.
- On the order of doubly transitive permutation groups
- On the order of uniprimitive permutation groups
- On the orders of primitive groups
- On the orders of primitive groups with restricted nonabelian composition factors
- On the spectral gap and the automorphism group of distance-regular graphs
- Regular graphs with four eigenvalues
Cited in
(2)
This page was built for publication: On the automorphism groups of rank-4 primitive coherent configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144399)