2000 character limit reached
On sumsets and convex hull
Published 24 Jul 2013 in math.CO and math.NT | (1307.6316v1)
Abstract: One classical result of Freimann gives the optimal lower bound for the cardinality of A+A if A is a d-dimensional finite set in the Euclidean d-space. Matolcsi and Ruzsa have recently generalized this lower bound to |A+kB| if B is d-dimensional, and A is contained in the convex hull of B. We characterize the equality case of the Matolcsi-Ruzsa bound. The argument is based partially on understanding triangulations of polytopes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.