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

奇数三角环拼图问题

The odd triangle ring puzzle problem

Sylvain Barré, Othmane Oukrid, Mikaël Pichot

AI总结:

本文通过Sidon序列方法解决了与奇数Moebius--Kantor CAT(0)复形相关的奇数三角环拼图问题,证明了此类拼图恰有三个族:两个不可数族和一个含十二个例外拼图的有限族。

摘要:

环拼图是满足顶点周围局部约束的欧几里得平面的镶嵌。此类拼图可能出现在几何群论中,例如作为某些二维CAT(0)复形中的嵌入平坦平面。在本文中,我们通过Sidon序列的方法解决了与唯一的奇数Moebius--Kantor CAT(0)复形相关的奇数环拼图问题。我们证明了此类拼图恰好有三个族:两个不可数族和一个包含十二个例外拼图的有限族。

英文摘要:

Ring puzzles are tessellations of the Euclidean plane respecting local constraints around vertices. Such puzzles may arise in geometric group theory, for example, as embedded flat planes in certain CAT(0) complexes of dimension 2. In the present paper, we solve the odd ring puzzle problem, which is associated with the unique odd Moebius--Kantor CAT(0) complex by the method of Sidon sequences. We prove that there are precisely three families of such puzzles, two uncountable families, and a finite family of twelve exceptional puzzles.

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

↑