Doubly transitive lines. II: Almost simple symmetries (Q6122138)

From MaRDI portal
scientific article; zbMATH DE number 7810293
Language Label Description Also known as
English
Doubly transitive lines. II: Almost simple symmetries
scientific article; zbMATH DE number 7810293

    Statements

    Doubly transitive lines. II: Almost simple symmetries (English)
    0 references
    0 references
    0 references
    28 February 2024
    0 references
    Let \(\mathcal{L}\) be a finite, linearly dependent set of one-dimensional subspaces of the complex vector space \(\mathbb{C}^d\) such that the group \(G\) of unitary transformations preserving \(\mathcal{L}\) is doubly transitive on \(\mathcal{L}\). The authors classify explicitly all possibilities for the pair \((G, \mathcal{L})\) in the paper under review, thus completing part I [the authors, J. Comb. Theory, Ser. A 185, Article ID 105540, 47 p. (2022; Zbl 1476.05169)]. The proof depends on the classification of all finite doubly transitive groups (hence on the classification of finite simple groups). As a result of \textit{W. Burnside} [Theory of groups of finite order. 2nd edition. Reprint of the 1911 edition. Mineola, NY: Dover Publications (2017; Zbl 1375.20001)], \(G\) is either an affine group or almost simple. \textit{U. Dempwolff} and \textit{W. M. Kantor} [Bull. Aust. Math. Soc. 107, No. 1, 134--145 (2023; Zbl 07657549)] have determined the pairs \((G, \mathcal{L})\) where \(G\) is an affine group, and \textit{D. E. Taylor} [J. Comb. Theory, Ser. A 61, No. 1, 113--122 (1992; Zbl 0760.05056)] has solved the real version of the classification problem (here two sporadic simple groups \(G\) appear, namely the Higman-Sims group and the third Conway group). The authors treat the remaining cases where \(G\) is almost simple, using Schur coverings, association schemes and Higman pairs.
    0 references
    equiangular lines
    0 references
    doubly transitive
    0 references
    roux
    0 references
    Higman pair
    0 references
    equiangular tight frame
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references