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

三角形平铺 V:用整数边长的瓦片进行平铺

Triangle Tiling V: Tilings by a tile with integer sides

Michael Beeson

AI总结:

本文研究三角形平铺问题,证明若存在整数边长且含120度角的瓦片的N-平铺,则N至少为96,并据此排除多种N值,如7、11、14等,同时给出各形状ABC的最小未解N值。

摘要:

三角形ABC被三角形T进行N-平铺,是指将ABC表示为N个与T全等的三角形的并集,这些三角形仅在边界处重叠。三角形T称为“瓦片”。瓦片可能与ABC相似,也可能不相似。我们希望通过完全刻画三元组(ABC, T, N)来理解可能的平铺,使得ABC可以被T进行N-平铺。特别地,这种理解应使我们能够指定对于哪些N存在瓦片T和三角形ABC能被T进行N-平铺;或者给定N,确定哪些瓦片和三角形可用于N-平铺;或者给定ABC,确定哪些瓦片和N可用于对ABC进行N-平铺。这是关于该主题的系列论文中的第五篇。之前的论文已将问题归结为T具有120度角且边长为整数的情况。这正是本文研究的问题。我们仍然无法完全解决该问题,但我们证明:如果存在由这样的瓦片进行的任何N-平铺,则N至少为96。将此结果与之前的工作相结合,我们可以消除对具有120度角的瓦片的例外情况,获得确定性的不存在结果。例如,不存在7-平铺、11-平铺、14-平铺、19-平铺、31-平铺、41-平铺等。关于数字N=96:ABC有几种可能的形状,对于每种形状,我们展示了目前尚不知道是否存在N-平铺的最小N。例如,对于等边ABC,截至2012年5月最简单的未解情况是N=135。对于这些最小N的每个例子,瓦片必须具有边(3,5,7)。

英文摘要:

An N-tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC. We wish to understand possible tilings by completely characterizing the triples (ABC, T, N) such that ABC can be N-tiled by T. In particular, this understanding should enable us to specify for which N there exists a tile T and a triangle ABC that is N-tiled by T; or given N, to determine which tiles and triangles can be used for N-tilings; or given ABC, to determine which tiles and N can be used to N-tile ABC. This is the fifth paper in a series of papers on this subject. The previous papers have reduced the problem the case when T has a 120 degree angle and integer side lengths. That is the problem we take up in this paper. We are still not able to completely solve the problem, but we prove that if there are any N-tilings by such tiles, then N is at least 96. Combining this results with our earlier work, we can remove the exception for a tile with a 120 degree angle, obtaining definitive non-existence results. For example, there is no 7-tiling, no 11-tiling, no 14-tiling, no 19-tiling, no 31-tiling, no 41-tiling, etc. Regarding the number N=96: There are several possible shapes of ABC, and for each shape, we exhibit the smallest N for which it is presently unknown whether there is an N-tiling. For example, for equilateral ABC, the simplest unsolved case as of May, 2012 is N=135. For each of these minimal-N examples, the tile would have to have sides (3,5,7).

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

↑