Classification of simple 2-(11,3,3) designs (Q1011489)

From MaRDI portal
Revision as of 18:07, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Classification of simple 2-(11,3,3) designs
scientific article

    Statements

    Classification of simple 2-(11,3,3) designs (English)
    0 references
    0 references
    8 April 2009
    0 references
    With the aid of computers, the authors have established the existence of precisely 7,038,699,746 nonisomorphic 2-(11,3,3) designs without repeated blocks, as well as computing the sizes of their automorphism groups. This was the smallest case awaiting enumeration. They provide a detailed description of the backtracking and isomorph rejection phases of their algorithm, along with historical background and references. They also used their methods to confirm the previously known classifications of 2-(8,3, 6), 2-(12,3,2), and 2-(19,3,1) designs.
    0 references
    block designs
    0 references
    triple systems
    0 references
    backtracting
    0 references
    orderly algorithm
    0 references
    automorphism groups
    0 references

    Identifiers

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