Home > Research > Publications & Outputs > On the area discrepancy of triangulations of sq...
View graph of relations

On the area discrepancy of triangulations of squares and trapezoids

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

On the area discrepancy of triangulations of squares and trapezoids. / Schulze, Bernd.
In: The Electronic Journal of Combinatorics , Vol. 18 , No. 1, P137, 2011.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Schulze B. On the area discrepancy of triangulations of squares and trapezoids. The Electronic Journal of Combinatorics . 2011;18 (1):P137.

Author

Schulze, Bernd. / On the area discrepancy of triangulations of squares and trapezoids. In: The Electronic Journal of Combinatorics . 2011 ; Vol. 18 , No. 1.

Bibtex

@article{194ba6c91e27451eab526115dbd5ade1,
title = "On the area discrepancy of triangulations of squares and trapezoids",
abstract = "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 asymptotic upper bound for the minimal difference between the smallest and the largest area in triangulations of a square into an odd number of triangles. More precisely, using some techniques from the theory of continued fractions, we construct a sequence of triangulations Tni of the unit square into ni triangles, ni odd, so that the difference between the smallest and the largest area in Tni is O(1n3i).We then prove that for an arbitrarily fast-growing function f:N→N, there exists a transcendental number α>0 and a sequence of triangulations Tni of the trapezoid T(α) into ni triangles, so that the difference between the smallest and the largest area in Tni is O(1f(ni)).",
author = "Bernd Schulze",
year = "2011",
language = "English",
volume = "18 ",
journal = "The Electronic Journal of Combinatorics ",
publisher = "Electronic Journal of Combinatorics",
number = "1",

}

RIS

TY - JOUR

T1 - On the area discrepancy of triangulations of squares and trapezoids

AU - Schulze, Bernd

PY - 2011

Y1 - 2011

N2 - 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 asymptotic upper bound for the minimal difference between the smallest and the largest area in triangulations of a square into an odd number of triangles. More precisely, using some techniques from the theory of continued fractions, we construct a sequence of triangulations Tni of the unit square into ni triangles, ni odd, so that the difference between the smallest and the largest area in Tni is O(1n3i).We then prove that for an arbitrarily fast-growing function f:N→N, there exists a transcendental number α>0 and a sequence of triangulations Tni of the trapezoid T(α) into ni triangles, so that the difference between the smallest and the largest area in Tni is O(1f(ni)).

AB - 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 asymptotic upper bound for the minimal difference between the smallest and the largest area in triangulations of a square into an odd number of triangles. More precisely, using some techniques from the theory of continued fractions, we construct a sequence of triangulations Tni of the unit square into ni triangles, ni odd, so that the difference between the smallest and the largest area in Tni is O(1n3i).We then prove that for an arbitrarily fast-growing function f:N→N, there exists a transcendental number α>0 and a sequence of triangulations Tni of the trapezoid T(α) into ni triangles, so that the difference between the smallest and the largest area in Tni is O(1f(ni)).

M3 - Journal article

VL - 18

JO - The Electronic Journal of Combinatorics

JF - The Electronic Journal of Combinatorics

IS - 1

M1 - P137

ER -