arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1310.6776math.CO
收藏

将多维数据集分解为路径

Decomposing the cube into paths

Joshua Erde

摘要:

我们考虑的问题时,$n$维超立方体可以分解成路径的长度$k$。Mollard和Ramras \cite{MR2013}注意到,对于奇数$n$,$k$必须划分$n2^{n-1}$和$k\leq n$。后来,Anick和Ramras \cite{AR2013}证明了这两个条件对于奇数$n \leq 2^{32}$也是充分的,并证明这对于所有奇数$n$都是正确的。本文证明了这一猜想。

英文摘要:

We consider the question of when the $n$-dimensional hypercube can be decomposed into paths of length $k$. Mollard and Ramras \cite{MR2013} noted that for odd $n$ it is necessary that $k$ divides $n2^{n-1}$ and that $k\leq n$. Later, Anick and Ramras \cite{AR2013} showed that these two conditions are also sufficient for odd $n \leq 2^{32}$ and conjectured that this was true for all odd $n$. In this note we prove the conjecture.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑