Round-dance neighbour designs from terraces

In a round-dance neighbour design, an odd number v of objects is arranged successively in (v-1)/2 rings (circular blocks) such that any two of the objects are adjacent to one another in exactly one ring. A round-dance neighbour design is also a Hamiltonian decomposition of the complete graph on v vertices. We show how such designs can be constructed from terraces, which are building blocks for row-complete Latin squares. A round-dance neighbour design is equivalent to a Tuscan square in which the reverse of each row is also a row. Terraces for the cyclic group of order n are used to construct elegantly patterned round-dance neighbour designs for n2^m+1 objects for any positive integer m.

[1]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[2]  J. Dénes,et al.  Latin squares and their applications , 1974 .

[3]  R. A. Bailey.  Quasi-complete Latin Squares: Construction and Randomization , 1984 .

[4]  Jean-Claude Bermond,et al.  Decomposition into Cycles I: Hamilton Decompositions , 1990 .

[5]  O. Mayo,et al.  Nearest Neighbour (Nn) Analysis of Field Experiments , 1983 .

[6]  E. Williams.  Experimental Designs Balanced for the Estimation of Residual Effects of Treatments , 1949 .

[7]  Henry Ernest Dudeney.  The Canterbury puzzles : and other curious problems , 1958 .

[8]  Philip Prescott.  Construction of sequentially counterbalanced designs formed from two Latin squares. , 1999 .

[9]  Basil Gordon,et al.  Sequences in groups with distinct partial products. , 1961 .

[10]  Jean-Marc Azaïs,et al.  Design of Experiments for Studying Intergenotypic Competition , 1987 .

[11]  Gareth Jones,et al.  Elementary number theory , 2019, The Student Mathematical Library.

[12]  P Prescott,et al.  Construction of uniform-balanced cross-over designs for any odd number of treatments. , 1999, Statistics in medicine.

[13]  E. N. Gilbert,et al.  Latin Squares which Contain No Repeated Digrams , 1965 .

[14]  R. M. Williams.  EXPERIMENTAL DESIGNS FOR SERIALLY CORRELATED OBSERVATIONS , 1952 .

[15]  Henry P. Wynn,et al.  Optimum Balanced Block and Latin Square Designs for Correlated Observations , 1981 .

[16]  B. A. Anderson,et al.  Every finite solvable group with a unique element of order two, except the quaternion group, has a symmetric sequencing , 1993 .

[17]  Tuvi Etzion.  Hamiltonian decomposition of K*n, patterns with distinct differences, and Tuscan squares , 1990, Discret. Math..

[18]  J. Humphreys.  A Course in Group Theory , 1996 .

[19]  Anthony J. W. Hilton,et al.  Hamiltonian decompositions of complete regular s-partite graphs , 1986, Discret. Math..

[20]  Rees Dh,et al.  Some designs of use in serology. , 1967 .

[21]  Chuan Yi Tang,et al.  A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem , 1993, Inf. Process. Lett..