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

环形板上的一个巡回问题

A tour problem on a toroidal board

Simone Costa, Marco Dalai, Anita Pasotti

摘要:

在本文中,我们研究了我们在研究双嵌入和Heffter阵列时遇到的一个旅游问题,见[D. S.张文,张文,等. 22(2015)#P1.74]。令$A$是由填充单元和空单元组成的$n\times m$环形阵列。假设$A$的每行的方向$R=(r_1,\dots,r_n)$和每列的方向$C=(c_1,\dots,c_m)$是固定的。给定初始填充单元格$(i_1,j_1)$,考虑列表$ L_{R,C}=((i_1,j_1),(i_2,j_2),\ldots,(i_k,j_k),$ $(i_{k+1},j_{k+1}),\ldots)$,其中$j_{k+1}$是在方向$r_{i_k}$上紧挨着$(i_k,j_k)$的行$R_{i_k}$的填充单元格$(i_k,j_{k+1})$的列索引,并且其中$i_{k+1}$是在方向$c_{j_{k+1}}$上紧挨着$(i_k,j_{k+1})$的列$C_{j_{k+1}}$的填充单元格的行索引。我们提出了如下的“疯狂骑士之旅问题”:是否存在$R$和$C$,使得列表$L_{R,C}$覆盖$A$的所有填充单元格?在这里,我们提供了一个完整的解决方案的情况下,没有空的细胞,我们得到部分结果的正方形阵列中填充的细胞遵循一些特定的规则模式。

英文摘要:

In this paper we study a tour problem that we came cross while studying biembeddings and Heffter arrays, see [D.S. Archdeacon, Heffter arrays and biembedding graphs on surfaces, Electron. J. Combin. 22 (2015) #P1.74]. Let $A$ be an $n\times m$ toroidal array consisting of filled cells and empty cells. Assume that an orientation $R=(r_1,\dots,r_n)$ of each row and $C=(c_1,\dots,c_m)$ of each column of $A$ is fixed. Given an initial filled cell $(i_1,j_1)$ consider the list $ L_{R,C}=((i_1,j_1),(i_2,j_2),\ldots,(i_k,j_k),$ $(i_{k+1},j_{k+1}),\ldots)$ where $j_{k+1}$ is the column index of the filled cell $(i_k,j_{k+1})$ of the row $R_{i_k}$ next to $(i_k,j_k)$ in the orientation $r_{i_k}$, and where $i_{k+1}$ is the row index of the filled cell of the column $C_{j_{k+1}}$ next to $(i_k,j_{k+1})$ in the orientation $c_{j_{k+1}}$. We propose the following "Crazy Knight's Tour Problem": Do there exist $R$ and $C$ such that the list $L_{R,C}$ covers all the filled cells of $A$? Here we provide a complete solution for the case with no empty cells and we obtain partial results for square arrays where the filled cells follow some specific regular patterns.

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

↑