English

An improved upper bound on the Ruzsa number

Number Theory 2026-07-07 v1 Combinatorics

Abstract

Let RmR_m be the least positive integer rr such that there exists a set AZmA\subseteq \mathbb{Z}_{m} with A+A=ZmA+A=\mathbb{Z}_m for which the number of ordered solutions of n=x+yn=x+y with x,yAx,y\in A is at most rr for every nZmn\in \mathbb{Z}_m. In this note we prove that Rm128R_m\leqslant 128 for every positive integer mm, improving the previous bound Rm192R_m\leqslant 192.

Cite

@article{arxiv.2607.06167,
  title  = {An improved upper bound on the Ruzsa number},
  author = {Yuchen Ding and Yu-Chen Sun and Lilu Zhao},
  journal= {arXiv preprint arXiv:2607.06167},
  year   = {2026}
}

Comments

11 pages