The asymptotic density conjecture for (p,q)(p,q)-sum-free subsets of the square grid

Let p,qp,q be positive integers. A set S[n]2S\subseteq[n]^2 is (p,q)(p,q)-sum-free if the equation px+qy=zpx+qy=z has no solution with x,y,zSx,y,z\in S, and define

μ[p,q]([n]2):=max{Sn2S[n]2 is (p,q)-sum-free}.\mu_{[p,q]}([n]^2):=\max\left\{\frac{|S|}{n^2}\mid S\subseteq[n]^2\text{ is $(p,q)$-sum-free}\right\}.

Asymptotic density conjecture. For positive integers p,qp,q and sufficiently large nn,

μ[p,q]([n]2)=(12(p+q)2+1)+O(1/n).\mu_{[p,q]}([n]^2)=\left(1-\frac{2}{(p+q)^2+1}\right)+O(1/n).

The formula matches the density supplied by the stripe construction. The paper gives an upper bound of this form in the special case p=qp=q, while the corresponding assertion for general positive integers p,qp,q remains conjectural.

Sources & referencesView supporting material

Primary source

Hong Liu, Guanghui Wang, Laurence Wilkes and Donglei Yang, “Shape of the asymptotic maximum sum-free sets in integer lattice grids”, arXiv:2108.10526 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.