arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.08845math.CO
收藏

第二个跳跃定理

The Second Leaper Theorem

Nikolai Beluhov

摘要:

$(p, q)$ -跳跃者是一个精灵棋子,它可以从一个正方形$a$移动到任何一个正方形$a + (\pm p, \pm q)$或$a + (\pm q, \pm p)$。设$L$是$(p, q)$ -跳跃者,$p + q$是奇数,$C$是$(p + q) \times (p + q)$棋盘中$L$的循环.我们发现,存在第二个跳跃$M$,不同于$L$,这样一个哈密顿循环$M$存在于$C$的平方。我们用连分数描述了$C$和$M$.我们引入了方向图的概念,大致上是一个跳跃图,从中提取了所有的信息保存的移动方向,我们研究了方向图方面的$C$和$D$。我们引入了对偶广义棋盘的概念,一个广义棋盘$B$的一个以上的平方,使跳跃图的一个跳跃者$L$在$B$是连接和同构的第二个跳跃者$M$的跳跃图,不同于$L$,在$B$,我们给出了构造对偶广义棋盘。

英文摘要:

A $(p, q)$-leaper is a fairy chess piece that, from a square $a$, can move to any of the squares $a + (\pm p, \pm q)$ or $a + (\pm q, \pm p)$. Let $L$ be a $(p, q)$-leaper with $p + q$ odd and $C$ a cycle of $L$ within a $(p + q) \times (p + q)$ chessboard. We show that there exists a second leaper $M$, distinct from $L$, such that a Hamiltonian cycle $D$ of $M$ exists over the squares of $C$. We give descriptions of $C$ and $M$ in terms of continued fractions. We introduce the notion of a direction graph, roughly a leaper graph from which all information has been abstracted away save for the directions of the moves, and we study $C$ and $D$ in terms of direction graphs. We introduce the notion of a dual generalized chessboard, a generalized chessboard $B$ of more than one square such that the leaper graph of a leaper $L$ over $B$ is connected and isomorphic to the leaper graph of a second leaper $M$, distinct from $L$, over $B$, and we give constructions for dual generalized chessboards.

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

↑