Classification of simple 2-(11,3,3) designs
type: Item
instance of: scholarly article
title: Classification of simple 2-(11,3,3) designs
zbMATH Open document ID: 1191.05020
author: B. Tayfeh-Rezaie
author: Gholamreza Khosrovshahi
published in: Discrete Mathematics
publication date: 2009-04-08T00:00:00Z
review text: 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.
reviewed by: Chester J. Salwach
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05B07
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 05-04
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5541724
zbMATH Keywords: block designs
zbMATH Keywords: triple systems
zbMATH Keywords: backtracting
zbMATH Keywords: orderly algorithm
zbMATH Keywords: automorphism groups
MaRDI profile type: Publication
full work available at URL: j.disc.2008.07.012
OpenAlex ID: W2046252095
cites work: Q3342583
cites work: Steiner triple systems of order 19 with nontrivial automorphism group
cites work: Q4198513
cites work: On theory and applications of BIB designs with repeated blocks
cites work: Q3941422
cites work: Backtrack Programming
cites work: Q4335297
cites work: Determination of Steiner Triple Systems of Order 15
cites work: Q3770548
cites work: BIB(8,56,21,3,6) and BIB(10,30,9,3,2) designs with repeated blocks
cites work: Results on the support of BIB designs
cites work: Q3699699
cites work: Classification algorithms for codes and designs
cites work: The Steiner triple systems of order 19
cites work: Classification of 6‐(14,7,4) designs with nontrivial automorphism groups
cites work: Q4017153
cites work: Q3663313
cites work: Q3424713
cites work: Isomorph-Free Exhaustive Generation
cites work: Backtracking algorithm for finding t‐designs
cites work: Q4526641
cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
cites work: 284457 Steiner Triple Systems of Order 19 Contain a Subsystem of Order 9
cites work: Q3274167
DOI: 10.1016/J.DISC.2008.07.012
description: scientific article; zbMATH DE number 5541724