Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles
نویسندگان
چکیده
Monsky’s theorem from 1970 states that a square cannot be dissected into an odd number n of triangles of the same area, but it does not give a lower bound for the area differences that must occur. We extend Monsky’s theorem to “constrained framed maps”; based on this we can apply a gap theorem from semi-algebraic geometry to a polynomial area difference measure and thus get a lower bound for the area differences that decreases doubly-exponentially with n. On the other hand, we obtain the first superpolynomial upper bounds for this problem, derived from an explicit construction that uses the Thue–Morse sequence.
منابع مشابه
On the Area Discrepancy of Triangulations of Squares and Trapezoids
In 1970 P. Monsky showed that a square cannot be triangulated into an odd number of triangles of equal areas; further, in 1990 E. A. Kasimatis and S. K. Stein proved that the trapezoid T (α) whose vertices have the coordinates (0, 0), (0, 1), (1, 0), and (α, 1) cannot be triangulated into any number of triangles of equal areas if α > 0 is transcendental. In this paper we first establish a new a...
متن کاملFractal Tessellations from Proofs of the Pythagorean Theorem
The Pythagorean theorem can be proven geometrically through the use of dissections of squares and triangles. Four of these decompositions are paired into two compound dissections, which are used to create novel images. Pythagorean Theorem Many proofs of the Pythagorean theorem are given in the literature, for example, at the MathWorld web site [1]. Of particular interest to this work are dissec...
متن کاملA universal sequence of integers generating balanced Steinhaus figures modulo an odd number
In this paper, we partially solve an open problem, due to J. C. Molluzzo in 1976, on the existence of balanced Steinhaus triangles modulo a positive integer n, that are Steinhaus triangles containing all the elements of Z/nZ with the same multiplicity. For every odd number n, we build an orbit in Z/nZ, by the linear cellular automaton generating the Pascal triangle modulo n, which contains infi...
متن کاملA note on the bounds of Laplacian-energy-like-invariant
The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...
متن کاملEfficient Regular Polygon Dissections
We study the minimum number g(m,n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that dn/2e − 2 ≤ g(4, n) ≤ n 2 + o(n) and dn/4e ≤ g(n, 4) ≤ n 2 + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017