pith. sign in

arxiv: 0704.3314 · v1 · submitted 2007-04-25 · 🧮 math.NT · math.CO

Geometric structure of sumsets

classification 🧮 math.NT math.CO
keywords latticepointssumsetsconvexhullsapproximationcentralcompare
0
0 comments X
read the original abstract

Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that sumsets occupy all the central lattice points in convex hulls, giving us a kind of approximation to lattice points in polytopes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.