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

preprint2022arXivOpen access

Abstract

We determine the shape of all sum-free sets in {1,2,…,n}2\{1,2,\ldots,n\}^2 of size close to the maximum 35n2\frac{3}{5}n^2, solving a problem of Elsholtz and Rackham. We show that all such asymptotic maximum sum-free sets lie completely in the stripe 45n−o(n)≤x+y≤85n+o(n)\frac{4}{5}n-o(n)\le x+y\le\frac{8}{5}n+ o(n). We also determine for any positive integer pp the maximum size of a subset A⊆{1,2,…,n}2A\subseteq \{1,2,\ldots,n\}^2 which forbids the triple (x,y,z)(x,y,z) satisfying px+py=zpx+py=z.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.