Abstract
Two Latin squares of order $n$ are orthogonal if in their superposition, each of the $n^{2}$ ordered pairs of symbols occurs exactly once. Colbourn, Zhang and Zhu, in a series of papers, determined the integers $r$ for which there exist a pair of Latin squares of order $n$ having exactly $r$ different ordered pairs in their superposition. Dukes and Howell defined the same problem for Latin squares of different orders $n$ and $n+k$. They obtained a non-trivial lower bound for $r$ and solved the problem for $k geq frac{2n}{3} $. Here for $k < frac{2n}{3}$, some constructions are shown to realize many values of $r$ and for small cases $(3leq n leq 6)$, the problem has been solved.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
