Symmetric Layer-Rainbow Colorations of Cubes

From MaRDI portal
Publication:6071817




Abstract: Can we color the n3 cells of an nimesnimesn cube L with n2 colors in such a way that each layer parallel to each face contains each color exactly once and that the coloring is symmetric so that Lijell=Ljelli=Lellij for distinct i,j,ellin1,dots,n, and Liij=Ljji,Liji=Ljij,Lijj=Ljii for i,jin1,dots,n? Using transportation networks, we show that such a coloring is possible if and only if nequiv0,2mod3 (with two exceptions, n=1 and neq3). Motivated by the designs of experiments, the study of these objects (without symmetry) was initiated by Kishen and Fisher in the 1940's. These objects are also closely related to orthogonal arrays whose existence has been extensively investigated, and they are natural three-dimensional analogues of symmetric latin squares.









This page was built for publication: Symmetric Layer-Rainbow Colorations of Cubes

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