English

Direct constructions for general families of cyclic mutually nearly orthogonal Latin squares

Combinatorics 2014-01-31 v1

Abstract

Two Latin squares L=[l(i,j)]L=[l(i,j)] and M=[m(i,j)]M=[m(i,j)], of even order nn with entries {0,1,2,,n1}\{0,1,2,\ldots,n-1\}, are said to be nearly orthogonal if the superimposition of LL on MM yields an n×nn\times n array A=[(l(i,j),m(i,j))]A=[(l(i,j),m(i,j))] in which each ordered pair (x,y)(x,y), 0x,yn10\leq x,y\leq n-1 and xyx\neq y, occurs at least once and the ordered pair (x,x+n/2)(x,x+n/2) occurs exactly twice. In this paper, we present direct constructions for the existence of general families of three cyclic mutually orthogonal Latin squares of orders 48k+1448k+14, 48k+2248k+22, 48k+3848k+38 and 48k+4648k+46. The techniques employed are based on the principle of Methods of Differences and so we also establish infinite classes of "quasi-difference" sets for these orders.

Keywords

Cite

@article{arxiv.1401.7889,
  title  = {Direct constructions for general families of cyclic mutually nearly orthogonal Latin squares},
  author = {Fatih Demirkale and Diane Donovan and Abdollah Khodkar},
  journal= {arXiv preprint arXiv:1401.7889},
  year   = {2014}
}