Classification of designs with nontrivial automorphism groups

In this article, we introduce a new orderly backtrack algorithm with efficient isomorph rejection for classification of t‐designs. As an application, we classify all simple 2‐(13,3,2) designs with nontrivial automorphism groups. The total number of such designs amounts to 1,897,386. The decomposabil...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial designs 2006-11, Vol.14 (6), p.479-489
1. Verfasser: Eslami, Ziba
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this article, we introduce a new orderly backtrack algorithm with efficient isomorph rejection for classification of t‐designs. As an application, we classify all simple 2‐(13,3,2) designs with nontrivial automorphism groups. The total number of such designs amounts to 1,897,386. The decomposability of the designs is also considered. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 479–489, 2006
ISSN:1063-8539
1520-6610
DOI:10.1002/jcd.20095