Difference Covering Arrays and Pseudo-Orthogonal Latin Squares


Creative Commons License

DEMİRKALE F., DONOVAN D., Hall J., KHODKAR A., Rao A.

GRAPHS AND COMBINATORICS, vol.32, no.4, pp.1353-1374, 2016 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 32 Issue: 4
  • Publication Date: 2016
  • Doi Number: 10.1007/s00373-015-1649-8
  • Journal Name: GRAPHS AND COMBINATORICS
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1353-1374
  • Yıldız Technical University Affiliated: Yes

Abstract

A pair of Latin squares, A and B, of order n, is said to be pseudo-orthogonal if each symbol in A is paired with every symbol in B precisely once, except for one symbol with which it is paired twice and one symbol with which it is not paired at all. A set of t Latin squares, of order n, are said to be mutually pseudo-orthogonal if they are pairwise pseudo-orthogonal. A special class of pseudo-orthogonal Latin squares are the mutually nearly orthogonal Latin squares (MNOLS) first discussed in 2002, with general constructions given in 2007. In this paper we develop row complete MNOLS from difference covering arrays. We will use this connection to settle the spectrum question for sets of 3 mutually pseudo-orthogonal Latin squares of even order, for all but the order 146.