Ruzsa–Matolcsi conjecture on triangulations of planar sum sets
Ruzsa–Matolcsi conjecture on triangulations of planar sum sets
Let and be finite non-collinear point sets in . For a finite non-collinear set , let and denote the numbers of points of on the boundary and in the interior of its convex hull, respectively. Since the number of triangles in a triangulation of the convex hull is , Ruzsa–Matolcsi's conjecture.
Equivalently, . This is a planar discrete analogue of the Brunn–Minkowski inequality; the paper verifies it in special cases, while the general conjecture remains open.
Sources & referencesView supporting material
Primary source
Karoly J. Boroczky and Benjamin Hoffman, “A note on triangulations of sum sets”, arXiv:1311.0531 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.