Shakan's conjecture on arbitrarily large improvements for sum-free subsets
Shakan's conjecture on arbitrarily large improvements for sum-free subsets
Let be a set of size . A subset of is sum-free if it contains no satisfying
Let denote the largest size of a sum-free subset of .
Shakan's conjecture. For every positive integer , there exists such that
for every .
The question asks whether the standard lower bound for the largest sum-free subset can be improved by an arbitrarily large additive constant for sufficiently large sets. Bourgain proved a fixed improvement in broad circumstances, including the bound for sets with coprime elements apart from , but the asserted arbitrary improvement remains open.
Sources & referencesView supporting material
Primary source
George Shakan, “On the largest sum-free subset problem in the integers”, arXiv:2207.14210 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.