Polynomial growth of sumsets in abelian semigroups

Details Polynomial growth of sumsets in abelian semigroups Polynomial growth of sumsets in abelian semigroups

2002-04-03

arxiv.org/abs/math/0204052v1

Mathematics

Number Theory

8 pages. LaTex. To appear in Journal de Theorie des Nombres de Bordeaux

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Polynomial growth of sumsets in abelian semigroups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial growth of sumsets in abelian semigroups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial growth of sumsets in abelian semigroups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-640400