← All problems

The planar discrete Brunn–Minkowski conjecture for triangulation counts

8 years old · traced to

For finite two-dimensional sets A,BoneA,B one in the plane that are not collinear, let [A][A] and [B][B] denote their convex hulls, and let tr(A){\rm tr}(A) and tr(B){\rm tr}(B) be the numbers of full-dimensional simplices in triangulations using the respective sets as vertex sets. Planar discrete Brunn–Minkowski conjecture.

tr(A+B)12≥tr(A)12+tr(B)12.{\rm tr}(A+B)^{\frac12}\geq {\rm tr}(A)^{\frac12}+{\rm tr}(B)^{\frac12}.

This replaces volume in the Brunn–Minkowski inequality by the number of triangles in a triangulation; in the plane this number is independent of the triangulation. The conjecture is presented as the basic planar case of the paper’s proposed discrete analogue.

References
  1. Károly J. Böröczky, Máté Matolcsi, Imre Z. Ruzsa, Francisco Santos and Oriol Serra, “Triangulations and a discrete Brunn-Minkowski inequality in the plane”, arXiv:1812.04117 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.