On the density of Kravitz sets
Number Theory
2025-10-21 v1 Combinatorics
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.
Cite
@article{arxiv.2510.16522,
title = {On the density of Kravitz sets},
author = {Vsevolod Lev and Máté Matolcsi and Péter Pál Pach and Dániel Varga},
journal= {arXiv preprint arXiv:2510.16522},
year = {2025}
}