Multi-Latin squares

DOI10.1016/J.DISC.2010.06.026MaRDI QIDQ539869zbMATH OpenOpenAlexFDO

Authors Carlo Hämäläinen, James Lefevre, Douglas S. Stones, Nicholas J. Cavenagh

Publication date 31 May 2011

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.4096

zbMATH Keywords

orthogonal arrayLatin squareLatin parallelepipedmulti-Latin squaresemi-Latin squareSOMA

Mathematics Subject Classification ID

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

Abstract: A multi-latin square of order $n$ and index $k$ is an $nimesn$ array of multisets, each of cardinality $k$, such that each symbol from a fixed set of size $n$ occurs $k$ times in each row and $k$ times in each column. A multi-latin square of index $k$ is also referred to as a $k$-latin square. A $1$-latin square is equivalent to a latin square, so a multi-latin square can be thought of as a generalization of a latin square. In this note we show that any partially filled-in $k$-latin square of order $m$ embeds in a $k$-latin square of order $n$, for each $ngeq2m$, thus generalizing Evans' Theorem. Exploiting this result, we show that there exist non-separable $k$-latin squares of order $n$ for each $ngeqk+2$. We also show that for each $ngeq1$, there exists some finite value $g(n)$ such that for all $kgeqg(n)$, every $k$-latin square of order $n$ is separable. We discuss the connection between $k$-latin squares and related combinatorial objects such as orthogonal arrays, latin parallelepipeds, semi-latin squares and $k$-latin trades. We also enumerate and classify $k$-latin squares of small orders.

Recommendations

• Generalized Latin squares. II
• scientific article; zbMATH DE number 16253
• On a generalization of the Evans Conjecture
• Embedding partial Latin squares in Latin squares with many mutually orthogonal mates
• Some results on generalized Latin squares

Cites work

• scientific article; zbMATH DE number 4122007 (Why is no real title available?)
• scientific article; zbMATH DE number 822751 (Why is no real title available?)
• A Census of Small Latin Hypercubes
• A linear algebraic approach to orthogonal arrays and Latin squares
• Embedding Incomplete Latin Squares
• Enumeration of semi-Latin squares
• Every SOMA\((n - 2, n)\) is Trojan
• Generalized latin rectangles. II: Embedding
• Isomorph-Free Exhaustive Generation
• On a generalization of the Evans Conjecture
• On avoiding odd partial Latin squares and r-multi Latin squares
• On the structure and classification of SOMAs: Generalizations of mutually orthogonal Latin squares
• Possible volumes of \(t\)-\((v,t+1)\) Latin trades
• Semi-Latin squares
• Small latin squares, quasigroups, and loops
• The theory and application of latin bitrades: A survey

Cited in

(8)

• Cycle switches in Latin squares
• scientific article; zbMATH DE number 3926936 (Why is no real title available?)
• Critical sets of full \(n\)-Latin squares
• scientific article; zbMATH DE number 16254 (Why is no real title available?)
• Critical sets of 2-balanced Latin rectangles
• scientific article; zbMATH DE number 1080080 (Why is no real title available?)
• Non-extendible Latin parallelepipeds
• Generalized Latin squares. II

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Multi-Latin squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539869)