arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1206.2229math.MG
收藏

三角形铺砌:情形 $3α+ 2β= π$

Triangle Tiling: The case $3α+ 2β= π$

Michael Beeson

AI总结:

本文研究三角形铺砌中 $3α+2β=π$ 的情形,证明铺砌块边长比为有理数,给出五种形状的丢番图方程以分析可能的铺砌数 $N$,并构造新铺砌族,部分形状排除素数 $N$。

摘要:

用三角形 $T$(“铺砌块”)对三角形 $ABC$ 进行 $N$-铺砌,是指将 $ABC$ 写成 $N$ 个 $T$ 的副本的并集,这些副本仅在边界上重叠。设铺砌块 $T$ 的角度为 $(\alpha,\beta,\gamma)$,边长为 $(a,b,c)$。本文研究 $3\alpha + 2\beta = \pi$ 的情形。此时(已知)恰好有五种可能的 $ABC$ 形状与 $T$ 不相似:要么 $ABC$ 是等腰三角形,底角为 $\alpha$、$\beta$ 或 $\alpha+\beta$,要么 $ABC$ 的角度为 $(2\alpha,\beta,\alpha+\beta)$,要么 $ABC$ 的角度为 $(2\alpha, \alpha, 2\beta)$。我们证明铺砌块是有理的(其边长之比为有理数)。然后我们展示几个先前未知的铺砌族。我们还针对每种形状,给出一个关于 $N$ 和铺砌块参数的丢番图方程,只要存在某种形状的三角形的铺砌,该方程必有解。通过这些丢番图方程,得出关于 $N$ 的可能值的一些结论。例如,我们证明当 $3\alpha + 2\beta = \pi$ 时,对于五种形状中的三种,不存在 $N$ 为素数的 $N$-铺砌;该问题对于形状 $(2\alpha,\beta,\alpha+\beta)$ 和底角为 $\beta$ 的等腰三角形仍然开放。这些方程还意味着,对于每个 $N$,铺砌块 $(a,b,c)$ 和三角形 $ABC$ 的可能性是有限集合。(通常,但并非总是,只有一种可能的铺砌块。)对于五种形状中的每一种,我们给出一种在充分条件下有效的构造方法,但仍存在满足我们必要条件但我们不知道是否存在铺砌的 $N$ 值。

英文摘要:

An $N$-tiling of triangle $ABC$ by triangle $T$ (the ``tile'') is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(α,β,γ)$, and sides $(a,b,c)$. This paper takes up the case when $3α+ 2β= π$. Then there are (as was already known) exactly five possible shapes of $ABC$ not similar to $T$: either $ABC$ is isosceles with base angles $α$, $β$, or $α+β$, or the angles of $ABC$ are $(2α,β,α+β)$, or the angles of $ABC$ are $(2α, α, 2β)$. We prove that the tile is rational (the ratios of its sides are rational). We then exhibit several families of previously unknown tilings. We also exhibit, for each shape, a Diophantine equation in $N$ and the parameters of the tile that must have a solution whenever there is a tiling of some triangle of that shape. By means of these Diophantine equations, some conclusions about the possible values of $N$ are drawn. We prove, for example, that there is no $N$-tiling with $N$ prime when $3α+ 2β= π$, for three of the five shapes; that question remains open for the shape $(2α,β,α+β)$ and for isosceles triangles with base angles $β$. These equations also imply that for each $N$, there is a finite set of possibilities for the tile $(a,b,c)$ and the triangle $ABC$. (Usually, but not always, there is just one possible tile.) For each of the five shapes, we give a construction method that works under certain sufficient conditions, but there remain values of $N$ that satisfy our necessary conditions and for which we do not know whether a tiling exists. All results have been formalized in Lean.

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

↑