Shape of the asymptotic maximum sum-free sets in integer lattice grids

DOI10.1016/J.EJC.2022.103614MaRDI QIDQ6375892arXivWikidataFDO

Authors Hong Liu, Guanghui Wang, Laurence Wilkes, Donglei Yang

Publication date 24 August 2021

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Ramsey theory (05D10) Arithmetic combinatorics; higher degree uniformity (11B30)

Abstract: We determine the shape of all sum-free sets in ${1,2,ldots,n}^2$ of size close to the maximum $frac35n^2$, solving a problem of Elsholtz and Rackham. We show that all such asymptotic maximum sum-free sets lie completely in the stripe $frac45n-o(n)lex+ylefrac85n+o(n)$. We also determine for any positive integer $p$ the maximum size of a subset $Asubseteq{1,2,ldots,n}^2$ which forbids the triple $(x,y,z)$ satisfying $px+py=z$.

This page was built for publication: Shape of the asymptotic maximum sum-free sets in integer lattice grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375892)