Abstract
The problem of classifying cyclic Steiner quadruple systems (CSQSs) is considered. A computational approach shows that the number of isomorphism classes of such designs with orders 26 and 28 is 52,170 and 1,028,387, respectively. It is further shown that CSQSs of order 2p, where p is a prime, are isomorphic iff they are multiplier equivalent. Moreover, no CSQSs of order less than or equal to 38 are isomorphic but not multiplier equivalent.
Original language | English |
---|---|
Number of pages | 19 |
Journal | Journal of Combinatorial Designs |
Volume | 25 |
Issue number | 3 |
Early online date | 5 Aug 2016 |
DOIs | |
Publication status | Published - Mar 2017 |
MoE publication type | A1 Journal article-refereed |
Keywords
- Cyclic design
- Steiner quadruple system
- Transitive permutation group