Multi-Latin squares

DOI10.1016/J.DISC.2010.06.026zbMATH Open1226.05060arXiv1007.4096OpenAlexW2086720836MaRDI QIDQ539869FDOQ539869

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)

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.

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

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

zbMATH Keywords

orthogonal arrayLatin squareLatin parallelepipedmulti-Latin squaresemi-Latin squareSOMA

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Cycle switches in Latin squares
• Title not available (Why is that?)
• Critical sets of full \(n\)-Latin squares
• Title not available (Why is that?)
• Critical sets of 2-balanced Latin rectangles
• Title not available (Why is that?)
• Non-extendible Latin parallelepipeds
• Generalized Latin squares. II

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)