Quasi-Complete Latin Squares: Construction and Randomization

Abstract

SUMMARY A general method for constructing quasi-complete Latin squares based on groups is given. This method leads to a relatively straightforward way of counting the number of inequivalent quasi-complete Latin squares of side at most 9. Randomization of such designs is discussed, and an explicit construction for valid randomization sets of quasi-complete Latin squares whose side is an odd prime power is given. It is shown that, contrary to common belief, randomization using a subset of all possible quasi-complete Latin squares may be valid while that using the whole set is not.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 100 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.