English

On the largest size of sum-free sets in symmetric regions

Combinatorics 2026-07-08 v1

Abstract

A subset SS of a group GG is said to be sum-free (resp. Δ\Delta-free) if there are no solutions to a+b=ca+b=c (resp. a+b+c=0a+b+c=0) with a,b,cSa,b,c\in S. For a convex region RRdR\subset\mathbb{R}^d, let σ(R)\sigma(R) denote the maximal proportion of the volume of RR that a sum-free subset of RR can occupy. We prove that σ([1,1]d)=1/2\sigma([-1,1]^d)=1/2. Our proof employs a careful application of the Brunn-Minkowski inequality. Moreover, for the dd-dimensional Euclidean ball Bd(0,1)\mathbb{B}^d(0,1), we show that σ(Bd(0,1))1/2+od(1)\sigma(\mathbb{B}^d(0,1))\leq 1/2+o_d(1). 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 Δ\Delta-free subset of the unit sphere Sd1\mathbb{S}^{d-1} occupies 1/2+O(d1)1/2+O(d^{-1}) 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