Diagonal and pandiagonal tournament Latin squares
A tournament latin square (TLS) is a latin square \(T=(t_{ij})\) with the additional requirement that \(t_{ij}=k\) implies \(t_{ik}=j\) (and so T is one of the conjugates of a symmetric latin square). Such a TLS can be used for round robin tournament scheduling by interpreting \(t_{ij}=k\) as a match in round i between teams j and k (exactly as the symmetric latin square would be used). It is shown, constructively, that diagonal and pandiagonal TLSs exist for each order n for which diagonal and pandiagonal latin squares exist, respectively. (Necessary and sufficient conditions for the existence of those squares were shown by \textit{A. Hedayat} [J. Comb. Theory, Ser A 22, 331-337 (1977; Zbl 0353.05025)] and \textit{A. Hedayat} and \textit{W. T. Federer} [Ann. Statist. 3, 445-447 (1975; Zbl 0302.62038)].)
- A complete solution to the existence and nonexistence of Knut Vik designs and orthogonal Knut Vik designs
- A simple method for constructing doubly diagonalized Latin squares
- Crisscross latin squares
- scientific article; zbMATH DE number 3443668 (Why is no real title available?)
- On Double Diagonal and Cross Latin Squares
- On the nonexistence of Knut Vik designs for all even orders
This page was built for publication: Diagonal and pandiagonal tournament Latin squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063607)
