Latin cubes with forbidden entries

From MaRDI portal
Publication:668044

zbMATH Open1409.05038arXiv1809.02392MaRDI QIDQ668044FDOQ668044


Authors: Carl Johan Casselgren, Lan Anh Pham, Klas Markström Edit this on Wikidata


Publication date: 5 March 2019

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

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=2k 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.


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

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



Recommendations



Cites Work


Cited In (2)





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)