paper

On the density of Kravitz sets

arXiv:2510.16522

Abstract

We show that for a subset of the cyclic group of prime order , if the sumset is not the whole group, then . Besides combinatorial arguments, we utilize a general technique involving linear programming.

On the density of Kravitz sets · wovepaper