A note on triangulations of sumsets

DOI10.2140/INVOLVE.2015.8.75zbMATH Open1310.11014arXiv1311.0531OpenAlexW1998058964MaRDI QIDQ2340134FDOQ2340134

Authors: Benjamin Hoffman, Károly jun. Böröczky 

Publication date: 16 April 2015

Published in: Involve (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1311.0531

Recommendations

• Triangulations and a discrete Brunn-Minkowski inequality in the plane
• On sumsets and convex hull
• On a discrete Brunn-Minkowski type inequality
• Inverse additive problems for Minkowski sumsets. I
• A Brunn-Minkowski inequality for the integer lattice

zbMATH Keywords

triangulationsBrunn-Minkowski inequalityadditive combinatoricssumsets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Cited In (8)

• Bounds on the lattice point enumerator via slices and projections
• Triangulations and a discrete Brunn-Minkowski inequality in the plane
• Sums of triangular numbers and \(t\)-core partitions
• Title not available (Why is that?)
• On the theories of triangular sets
• All \(s\)-sum sets of type 2 or 3 are triple-sum sets
• Title not available (Why is that?)
• A New Proof of Khovanskiĭ’s Theorem on the Geometry of Sumsets

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)