Row-complete latin squares of every composite order exist

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1998)6:1<63::AID-JCD5>3.0.CO;2-U" /><63::AID-JCD5>3.0.CO;2-U 10.1002/(SICI)1520-6610(1998)6:1<63::AID-JCD5>3.0.CO;2-UzbMath0914.05010OpenAlexW1989923360MaRDI QIDQ4222176

Jeff Higham

Publication date: 21 June 1999

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1998)6:1<63::aid-jcd5>3.0.co;2-u

zbMATH Keywords

Latin squarerow-complete

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (13)

Optimal and efficient crossover designs for comparing test treatments with a control treatment ⋮ On the growth factor in Gaussian elimination for generalized Higham matrices ⋮ What (Quilting) Circles Can Be Squared? ⋮ Infinite Latin squares: neighbor balance and orthogonality ⋮ Universal optimality of balanced uniform crossover designs ⋮ Large sets of Hamilton cycle and path decompositions ⋮ A review of uniform cross-over designs ⋮ The construction of nearly balanced and nearly strongly balanced uniform cross-over designs ⋮ Bounding the growth factor in Gaussian elimination for Buckley's class of complex symmetric matrices ⋮ New complete Latin squares of odd order ⋮ There are infinitely many Williams squares with circular structure and order a multiple of 4 ⋮ Choosing cross-over designs when few subjects are available ⋮ The spectrum of group-based complete Latin squares

This page was built for publication: Row-complete latin squares of every composite order exist