On the largest size of sum-free sets in symmetric regions
Combinatorics
2026-07-08 v1
Abstract
A subset of a group is said to be sum-free (resp. -free) if there are no solutions to (resp. ) with . For a convex region , let denote the maximal proportion of the volume of that a sum-free subset of can occupy. We prove that . Our proof employs a careful application of the Brunn-Minkowski inequality. Moreover, for the -dimensional Euclidean ball , we show that . We present two arguments for this. The first combines some routine harmonic analysis on the sphere with known bounds on values of the ultraspherical polynomials. The second more elementary argument proceeds by establishing that the maximal -free subset of the unit sphere occupies of the sphere's surface measure. This answers a question raised by Bukh.
Keywords
Cite
@article{arxiv.2607.07991,
title = {On the largest size of sum-free sets in symmetric regions},
author = {Anubhab Ghosal and Dmitry Tsarev},
journal= {arXiv preprint arXiv:2607.07991},
year = {2026}
}
Comments
8 pages