Polynomial growth of sumsets in abelian semigroups
classification
🧮 math.NT
math.CO
keywords
polynomialabeliangrowthlatticepointprovesemigroupsumsets
read the original abstract
Let S be an abelian semigroup, and A a finite subset of S. The sumset hA consists of all sums of h elements of A, with repetitions allowed. Let |hA| denote the cardinality of hA. Elementary lattice point arguments are used to prove that an arbitrary abelian semigroup has polynomial growth, that is, there exists a polynomial p(t) such that |hA| = p(h) for all sufficiently large h. Lattice point counting is also used to prove that sumsets of the form h_1A_1 + >... + h_rA_r have multivariate polynomial growth.
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.