A generalization of sumsets modulo a prime
Number Theory
2015-04-01 v2 Combinatorics
Abstract
Let be a set in an abelian group . For integers the generalized -fold sumset, denoted by , is the set of sums of elements of , where each element appears in the sum at most times. If lower bounds for are known, as well as the structure of the sets of integers for which is minimal. In this paper we generalize this result by giving a lower bound for when for a prime , and show new proofs for the direct and inverse problems in .
Cite
@article{arxiv.1501.06533,
title = {A generalization of sumsets modulo a prime},
author = {Francesco Monopoli},
journal= {arXiv preprint arXiv:1501.06533},
year = {2015}
}
Comments
12 pages