An illustrated encyclopedia of area relations

Abstract

To any combinatorial triangulation T of a square, there is an associated polynomial relation pT among the areas of the triangles of T. With the goal of understanding this polynomial, we consider polynomials obtained from pT by choosing l of its variables and specializing pT to these variables by zeroing out the remaining variables. We show that for fixed l, the set El of integer polynomials that appear as irreducible factors of such specializations is finite. We compute this area encyclopedia El for l≤ 4. We also show that in any dissection of a square into l triangles, the areas of the triangles must satisfy a polynomial in El. Our results are obtained by studying the rational map that associates to each drawing of T the tuple of areas of the triangles in that drawing. By analyzing the ways of approaching the base locus, we derive restrictions on points of the closure of the image of this map.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…