Doubly transitive lines II: Almost simple symmetries

We study lines through the origin of finite-dimensional complex vector spaces that enjoy a doubly transitive automorphism group. This paper, the second in a series, classifies those lines that exhibit almost simple symmetries. To perform this classification, we introduce a general recipe involving Schur covers to recover doubly transitive lines from their automorphism group.

[1]  Gregory Karpilovsky,et al.  Projective Representations of Finite Groups , 1985 .

[2]  Michael E. O'Nak.  Automorphisms of unitary block designs , 1972 .

[3]  Bertram Huppert,et al.  Finite Groups III , 1982 .

[4]  V. M. Levchuk,et al.  Structure of ree groups , 1985 .

[5]  J. J. Seidel,et al.  A SURVEY OF TWO-GRAPHS , 1976 .

[6]  Robert A. Wilson,et al.  The finite simple groups , 2009 .

[7]  Dustin G. Mixon,et al.  Polyphase equiangular tight frames and abelian generalized quadrangles , 2016, Applied and Computational Harmonic Analysis.

[8]  Dustin G. Mixon,et al.  The Road to Deterministic Matrices with the Restricted Isometry Property , 2012, Journal of Fourier Analysis and Applications.

[9]  Chris D. Godsil,et al.  Distance regular covers of the complete graph , 1992, J. Comb. Theory, Ser. B.

[10]  Joseph M. Renes,et al.  Symmetric informationally complete quantum measurements , 2003, quant-ph/0310075.

[11]  Harold N. Ward,et al.  On Ree’s series of simple groups , 1966 .

[12]  Gregory Karpilovsky,et al.  The Schur multiplier , 1987 .

[13]  Henrik Bäärnhielm.  Recognising the small Ree groups in their natural representations , 2012, ArXiv.

[14]  L. Grove,et al.  Classical Groups and Geometric Algebra , 2001 .

[15]  S. Waldron,et al.  The projective symmetry group of a finite frame , 2014 .

[16]  Dustin G. Mixon,et al.  Fingerprinting With Equiangular Tight Frames , 2011, IEEE Transactions on Information Theory.

[17]  Chris Godsil,et al.  Equiangular lines and covers of the complete graph , 2016 .

[18]  Joseph W. Iverson,et al.  OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS , 2017, Forum of Mathematics, Sigma.

[19]  R. Griess.  Schur multipliers of finite simple groups of Lie type , 1973 .

[20]  D. Gorenstein,et al.  THE MULTIPLICATORS OF CERTAIN SIMPLE GROUPS , 1966 .

[21]  Dustin G. Mixon,et al.  Tables of the existence of equiangular tight frames , 2015, ArXiv.

[22]  2- and 3-Covariant Equiangular Tight Frames , 2019, 2019 13th International conference on Sampling Theory and Applications (SampTA).

[23]  Peter J. Cameron,et al.  Cohomological aspects of two-graphs , 1977 .

[24]  W. Burnside,et al.  Theory of Groups of Finite Order , 1909 .

[25]  D. E. Taylor.  Regular 2‐Graphs , 1977 .

[26]  P. Cameron.  FINITE PERMUTATION GROUPS AND FINITE SIMPLE GROUPS , 1981 .

[27]  R. Griess.  Schur multipliers of some sporadic simple groups , 1974 .

[28]  Joseph W. Iverson,et al.  Doubly transitive lines I: Higman pairs and roux , 2018, Journal of Combinatorial Theory, Series A.

[29]  Martin W. Liebeck,et al.  The Subgroup Structure of the Finite Classical Groups , 1990 .

[30]  William M. Kantor,et al.  Homogeneous Designs and Geometric Lattices , 1985, J. Comb. Theory, Ser. A.

[31]  H. Wielandt,et al.  Finite Permutation Groups , 1964 .

[32]  N. J. A. Sloane,et al.  Packing Lines, Planes, etc.: Packings in Grassmannian Spaces , 1996, Exp. Math..

[33]  Thomas Strohmer,et al.  GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.

[34]  H. Najafi,et al.  Frame graph , 2018 .

[35]  J. Seidel,et al.  Spherical codes and designs , 1977 .

[36]  Donald E. Taylor,et al.  Two-Graphs and Doubly Transitive Groups , 1992, J. Comb. Theory, Ser. A.

[37]  Joseph W. Iverson,et al.  Optimal projective packings from association schemes , 2017, Optical Engineering + Applications.

[38]  Joseph W. Iverson,et al.  Optimal Line Packings from Nonabelian Groups , 2020, Discret. Comput. Geom..

[39]  G. Kemper,et al.  MATRIX GENERATORS FOR THE REE GROUPS 2 G 2(q) , 2001 .

[40]  R. Tennant.  Algebra , 1941, Nature.

[41]  J. Dixon,et al.  Permutation Groups , 1996 .

[42]  J. J. Seidel.  Geometry and Combinatorics , 2014 .

[43]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.