Distance-regular graphs and new block designs obtained from the Mathieu groups (Q6122404): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New 5-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding the Mathieu group \(M_{12}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5377018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some transitive combinatorial structures constructed from the unitary group \(U(3,3)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some distance-regular graphs with many vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal permutation sets for decoding the binary Golay codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Error-Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved partial permutation decoding for Reed-Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: t-designs from the large Mathieu groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Decoding of Systematic Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some symmetric designs invariant under the small Ree groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new family of symmetry codes and related new five-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry codes over GF(3) and new five-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Finite Simple Groups / rank
 
Normal rank

Latest revision as of 13:54, 27 August 2024

scientific article; zbMATH DE number 7811705
Language Label Description Also known as
English
Distance-regular graphs and new block designs obtained from the Mathieu groups
scientific article; zbMATH DE number 7811705

    Statements

    Distance-regular graphs and new block designs obtained from the Mathieu groups (English)
    0 references
    0 references
    0 references
    0 references
    1 March 2024
    0 references
    Distance-regular graphs admitting a vertex-transitive action of the Mathieu groups \(M_{11}\), \(M_{12}\), \(M_{22}\), \(M_{23}\), and \(M_{24}\) are constructed with the use of a computer. For \(M_{11}\), it is proved that up to isomorphism, there are exactly five strongly regular graphs and exactly three distance-regular graphs of diameter at least three with at most \(2000\) vertices and for which the rank of the permutation representation of the group is at most \(25\), admitting a transitive action of the group \(M_{11}\). Similar theorems are derived for the groups \(M_{12}\), \(M_{22}\), \(M_{23}\), and \(M_{24}\). Eight new 2-designs having the full automorphism group isomorphic to \(M_{22}\) are also constructed.
    0 references
    Mathieu group
    0 references
    distance-regular graph
    0 references
    strongly regular graph
    0 references
    block design
    0 references
    permutation decoding
    0 references
    PD-set
    0 references

    Identifiers

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