A note on triangulations of sumsets
From MaRDI portal
Publication:2340134
Abstract: For finite sets A and B in the plane, we write A+B to denote the set of sums of the elements of A and B. In addition, we write tr(A) to denote the common number of triangles in any triangulation of the convex hull of A using the points of A as vertices. We consider the conjecture that tr(A+B)^{1/2}geq tr(A)^{1/2}+tr(B)^{1/2}. If true, this conjecture would be a discrete, two-dimensional analogue to the Brunn-Minkowski inequality. We prove the conjecture in three special cases.
Recommendations
Cited in
(8)- Bounds on the lattice point enumerator via slices and projections
- All \(s\)-sum sets of type 2 or 3 are triple-sum sets
- scientific article; zbMATH DE number 5693598 (Why is no real title available?)
- Sums of triangular numbers and \(t\)-core partitions
- scientific article; zbMATH DE number 2151241 (Why is no real title available?)
- A New Proof of Khovanskiĭ’s Theorem on the Geometry of Sumsets
- Triangulations and a discrete Brunn-Minkowski inequality in the plane
- On the theories of triangular sets
This page was built for publication: A note on triangulations of sumsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340134)