Resolvable perfect cyclic designs

DOI10.1016/0097-3165(80)90003-5zbMath0444.05021MaRDI QIDQ1144578

Eric Mendelsohn, N. S. Mendelsohn, Frank E. Bennett

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(80)90003-5

zbMATH Keywords

orthogonal arrays; quasigroups; resolvable designs; perfect cyclic designs

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

05B30: Other designs, configurations

05B15: Orthogonal arrays, Latin squares, Room squares

20N05: Loops, quasigroups

Related Items

Special issue: 2nd Shanghai conference on designs, codes and finite geometries. Shanghai Jiao Tong Univ., Shanghai, China, May 14--18, 1996, Recent progress on the existence of perfect Mendelsohn designs, Perfect Mendelsohn designs with block size six, Perfect Mendelsohn designs with block size six, Almost resolvable perfect Mendelsohn designs with block size five, Existence of perfect Mendelsohn designs with \(k=5\) and \(\lambda{}>1\), Constructions of perfect Mendelsohn designs, Some new Latin power sets not based on groups, The existence of perfect Mendelsohn designs with block size 7, Mendelsohn designs associated with a class of idempotent quasigroups, On the existence of pure \((v, 4, 3)\)-PMD, On the existence of perfect Mendelsohn designs with \(k=7\) and \(\lambda{}\) even