Tiling of rectangles with squares and related problems via Diophantine approximation

被引:0
|
作者
Keleti, Tamas [1 ]
Lacina, Stephen [2 ]
Liu, Changshuo [3 ]
Liu, Mengzhen [4 ]
Rangel, Jose Ramoen Tuiran [5 ]
机构
[1] Eotvos Lorand Univ, Inst Math, Pazmany Peter Setany 1-C, H-1117 Budapest, Hungary
[2] Univ Oregon, Dept Math, Fenton Hall, Eugene, OR USA
[3] Princeton Univ, Dept Math, Fine Hall, Princeton, NJ USA
[4] Univ Cambridge, Ctr Math Sci, Dept Pure Math & Math Stat, Wilberforce Rd, Cambridge CB3 0WB, England
[5] Univ Nacl Autonoma Mexico, Fac Ciencias, Ciudad Univ, Mexico City, Mexico
基金
芬兰科学院;
关键词
Tilings; Rectangles; Squares; Cuboids; Diophantine approximation;
D O I
10.1016/j.disc.2023.113442
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor networks, we provide new and improved results on the matter using the theory of Diophantine Approximation, hence overcoming long-established difficulties, such as generalizations to higher-dimensional analogues. The universality of the method is demonstrated through its applications to different tiling problems. These include tiling rectangles with other rectangles, with their respective higher-dimensional counterparts, as well as tiling equilateral triangles, parallelograms, and trapezoids with equilateral triangles.(c) 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).
引用
收藏
页数:13
相关论文
共 50 条