Symmetric Layer-Rainbow Colorations of Cubes

DOI10.1137/22M1494488zbMATH Open1528.05009arXiv2205.02210OpenAlexW4388563194MaRDI QIDQ6071817FDOQ6071817

M. A. Bahmanian

Publication date: 29 November 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: Can we color the $n^3$ cells of an $nimesnimesn$ cube $L$ with $n^2$ 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 $L_{ijell}=L_{jelli}=L_{ellij}$ for distinct $i,j,ellin1,dots,n$, and $L_{iij}=L_{jji},L_{iji}=L_{jij},L_{ijj}=L_{jii}$ 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.

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

Recommendations

• Color symmetry and colored polyhedra
• Coloring the cube with rainbow cycles
• Symmetric colorings of polypolyhedra
• Rainbows in the hypercube
• Rainbow coloring the cube
• Rainbowness of cubic plane graphs
• Rainbow cycles in cube graphs
• Symmetric colorings of the dihedral group
• Colorings of hyperbolic plane crystallographic patterns
• Combinatorial aspects of colour symmetries

zbMATH Keywords

symmetryfactorizationorthogonal arraycirculationtransportation networkparallel classLatin cubelayer-rainbow

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A course in combinatorics.
• Orthogonal arrays. Theory and applications
• Title not available (Why is that?)
• Detachments of hypergraphs I: The Berge-Johnson problem
• A Census of Small Latin Hypercubes
• Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences
• Sets of orthogonal hypercubes of class \(r\)
• Sets of mutually orthogonal Sudoku frequency squares
• Sudoku-like arrays, codes and orthogonality
• Title not available (Why is that?)
• Nonextendible Latin cuboids
• Title not available (Why is that?)
• Title not available (Why is that?)
• The geometry of diagonal groups
• Title not available (Why is that?)
• THE RELATIONSHIP BETWEEN FINITE GROUPS AND COMPLETELY ORTHOGONAL SQUARES, CUBES, AND HYPER-CUBES

Cited In (1)

• Toward a three-dimensional counterpart of Cruse's theorem

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)