Latin cubes with forbidden entries

MaRDI QIDQ668044zbMATH OpenFDO

Authors Carl Johan Casselgren, Lan Anh Pham, Klas Markström

Publication date 5 March 2019

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.02392, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p2

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Abstract: We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant $gamma>0$ such that if $n=2^k$ and $A$ is $3$-dimensional $nimesnimesn$ array where every cell contains at most $gamman$ symbols, and every symbol occurs at most $gamman$ times in every line of $A$, then $A$ is {em avoidable}; that is, there is a Latin cube $L$ of order $n$ such that for every $1leqi,j,kleqn$, the symbol in position $(i,j,k)$ of $L$ does not appear in the corresponding cell of $A$.

Review text

Summary: We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant \(\gamma > 0\) such that if \(n=2^t\) and \(A\) is a \(3\)-dimensional \(n\times n\times n\) array where every cell contains at most \(\gamma n\) symbols, and every symbol occurs at most \(\gamma n\) times in every line of \(A\), then \(A\) is \textit{avoidable}; that is, there is a Latin cube \(L\) of order \(n\) such that for every \(1\leq i,j,k\leq n\), the symbol in position \((i,j,k)\) of \(L\) does not appear in the corresponding cell of \(A\).

Recommendations

• Latin cubes of even order with forbidden entries
• Avoiding Arrays of Odd Order by Latin Squares
• Latin squares with forbidden entries
• On avoiding some families of arrays
• Avoiding (m,m,m)-arrays of order n=2ᵏ

Cites work

• A Census of Small Latin Hypercubes
• A note on Latin squares with restricted support
• Avoiding (m,m,m)-arrays of order n=2ᵏ
• Avoiding Arrays of Odd Order by Latin Squares
• Extension from precoloured sets of edges
• scientific article; zbMATH DE number 6383870 (Why is no real title available?)
• Latin squares with forbidden entries
• Maximal partial Latin cubes
• Nonextendible Latin cuboids
• On the finite completion of partial latin cubes
• Some partial Latin cubes and their completions

Cited in

(3)

• Latin cubes of even order with forbidden entries
• Avoiding multiple entry arrays
• Extendibility of Latin hypercuboids

This page was built for publication: Latin cubes with forbidden entries

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