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

非零和Heffter阵列及其应用

Non-zero sum Heffter arrays and their applications

Simone Costa, Stefano Della Fiore, Anita Pasotti

摘要:

在本文中,我们引入了一类新的部分填充数组,Heffter阵列,涉及到不同的家庭,图分解和双嵌入。非零和Heffter阵列$\mathrm{N}\mathrm{H}(m,n; h,k)$是$m \times n$ p.f.在$\mathbb{Z}_{2nk+1}$中具有条目的数组,使得:每行包含$h$填充的单元格,每列包含$k$填充的单元格;对于每个$x\in \mathbb{Z}_{2nk+1}\setminus\{0\}$,$x$或$-x$出现在数组中;每行和列中的元素之和不同于$0$(在$\mathbb{Z}_{2nk+1}$中)。在这里,我们首先解释与相对差族和完全多部图的路分解的联系。然后,我们提出了一个完整的解决方案的存在性问题和建设性的完整解决方的情况下,矩形的情况下,没有空的细胞时,额外的,非常严格的,“全球简单”的属性是必需的。最后,我们展示了如何使用这些数组来构造完全图的双嵌入。

英文摘要:

In this paper we introduce a new class of partially filled arrays that, as Heffter arrays, are related to difference families, graph decompositions and biembeddings. A non-zero sum Heffter array $\mathrm{N}\mathrm{H}(m,n; h,k)$ is an $m \times n$ p. f. array with entries in $\mathbb{Z}_{2nk+1}$ such that: each row contains $h$ filled cells and each column contains $k$ filled cells; for every $x\in \mathbb{Z}_{2nk+1}\setminus\{0\}$, either $x$ or $-x$ appears in the array; the sum of the elements in every row and column is different from $0$ (in $\mathbb{Z}_{2nk+1}$). Here first we explain the connections with relative difference families and with path decompositions of the complete multipartite graph. Then we present a complete solution for the existence problem and a constructive complete solution for the square case and for the rectangular case with no empty cells when the additional, very restrictive, property of "globally simple" is required. Finally, we show how these arrays can be used to construct biembeddings of complete graphs.

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

↑