Linked systems of symmetric group divisible designs
Preprint
Abstract
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which are linked. Several examples of linked systems of symmetric group divisible designs are provided.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Mutually Unbiased Bush-type Hadamard Matrices and Association SchemesThe Electronic Journal of Combinatorics, 2015
- Uniformity in association schemes and coherent configurations: Cometric Q-antipodal schemes and linked systemsJournal of Combinatorial Theory, Series A, 2013
- On the equivalence between real mutually unbiased bases and a certain class of association schemesEuropean Journal of Combinatorics, 2010
- Imprimitive cometric association schemes: Constructions and analysisJournal of Algebraic Combinatorics, 2007
- Three-Class Association SchemesJournal of Algebraic Combinatorics, 1999
- Rank 5 association schemes and trialityLinear Algebra and its Applications, 1995
- Symmetric group divisible designs with the dual propertyJournal of Statistical Planning and Inference, 1977
- On groups with several doubly-transitive permutation representationsMathematische Zeitschrift, 1972