Row-complete latin squares of every composite order exist
A Latin square \(L\) of order \(n\) is said to be row-complete (or roman) and is denoted \(\text{RCLS}(n)\) if the ordered pairs \((L_{ij}, L_{i,j+1})\) are all distinct for \(1\leq i\leq n\) and \(1\leq j\leq n-1\). In statistics a \(\text{RCLS}(n)\) is termed a balanced repeated \((n,n,n)\) design and in graph theory a \(\text{RCLS}(n)\) leads to a decomposition of the complete directed graph on \(n\) vertices into \(n\) edge-disjoint Hamiltonian paths. Prior to this paper, much work had been done on problem of showing that \(\text{RCLS}(n)\) exist for all \(n\). This paper nicely summarizes this previous work. Essentially, all even orders were known as well as odd orders including 9, 15, 21, 25, 27, 33, and 39. In addition, there were several useful product-type theorems, including one by the author of this paper [\textit{J. Higham}, A product theorem for row-complete Latin squares, J. Comb. Des. 5, No. 4, 311-318 (1997; Zbl 0912.05022)]. In this paper the author proves that \(\text{RCLS}(n)\) exist for every odd composite order \(n>9\). This is a very significant result. It underscores the unusualness of this problem that the last cases to tackle now are the cases where the Latin square is of prime order. The author develops a general object that he terms a generating array for these squares and finds appropriate ingredients (e.g. sequenceable groups) for these arrays to construct the RCLS.
- A product theorem for row-complete Latin squares
- Complete Latin squares of order \(p^n\) exist for odd primes \(p\) and \(n>2\)
- The challenge of generating spatially balanced scientific experiment designs
- Some matrix constructions of L₂-type Latin square designs
- scientific article; zbMATH DE number 1529466
- scientific article; zbMATH DE number 1743825
- Sequenceable groups and related topics.
- scientific article; zbMATH DE number 3880723
- Choosing cross-over designs when few subjects are available
- Universal optimality of balanced uniform crossover designs
- Infinite Latin squares: neighbor balance and orthogonality
- The spectrum of group-based complete Latin squares
- Optimal and efficient crossover designs for comparing test treatments with a control treatment
- A review of uniform cross-over designs
- The construction of nearly balanced and nearly strongly balanced uniform cross-over designs
- scientific article; zbMATH DE number 54789 (Why is no real title available?)
- A product theorem for row-complete Latin squares
- Bounding the growth factor in Gaussian elimination for Buckley's class of complex symmetric matrices
- What (quilting) circles can be squared?
- On the growth factor in Gaussian elimination for generalized Higham matrices
- New complete Latin squares of odd order
- There are infinitely many Williams squares with circular structure and order a multiple of 4
- Large sets of Hamilton cycle and path decompositions
This page was built for publication: Row-complete latin squares of every composite order exist
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222176)
