包含层彩虹拉丁立方的层彩虹拉丁立方
Sharp Embeddings of Layer-Rainbow Cubes and Orthogonal Pairs
AI总结:
该研究建立经典拉丁方嵌入定理的三维类比,证明当且仅当n≥2m时,阶为m的层彩虹立方可嵌入阶为n的层彩虹立方,还等价于完全三部3-均匀超图1-因子分解的嵌入定理。
摘要:
我们建立了经典定理的三维类比:当且仅当n≥2m时,阶为m的拉丁方可嵌入阶为n的拉丁方。设L为一个n×n×n数组,固定其中一个坐标即可得到L的一个“层”;若L填充有n²个符号且每个层恰好包含每个符号各一次,则称L为“层彩虹立方”;若L填充有n个符号且每个层均为拉丁方,则称L为“层拉丁立方”。目前关于部分层拉丁立方的嵌入问题研究较少,现有结果在包含立方的阶数方面远非最优;相比之下,层彩虹立方的嵌入结果似乎完全未知。我们完全解决了该问题,证明当且仅当n≥2m时,阶为m的层彩虹立方可嵌入阶为n的层彩虹立方。等价地,我们的结果可视为完全三部3-均匀超图的1-因子分解的嵌入定理。
英文摘要:
We determine the exact extension threshold for one-factorizations of complete tripartite $3$-uniform hypergraphs. Equivalently, for $n>m$, every order-$m$ layer-rainbow cube embeds in one of order $n$ if and only if $n\ge2m$. We then study injectively orthogonal pairs, in which no ordered pair of symbols is repeated. Such pairs exist in every positive order except $2$, and every order-$m$ pair with $m\ge3$ embeds in every order $n\ge3m$. At the sharp order $2m$, embedding occurs exactly when the pair has a disjoint mate. The symbol-pair graph carries three distinguished one-factorizations whose triple intersections recover the cube, yielding several sufficient conditions for sharp embedding, including a finite-group construction. Finally, layer-rainbow cubes are proper $n^2$-colorings of the square of the Hamming graph, and the three one-factorizations of an orthogonal pair recover the Hamming geometry of the cells.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。