The largest (k, l)-sum free subsets

@article{Jing2020TheL,
title={The largest (k, l)-sum free subsets},
author={Yifan Jing},
journal={arXiv: Combinatorics},
year={2020}
}
• Yifan Jing
• Published 2020
• Mathematics
• arXiv: Combinatorics
Let $\mathscr{M}_{(2,1)}(N)$ denotes the infimum of the size of the largest sum-free subset of any set of $N$ positive integers. An old conjecture in additive combinatorics asserts that there are a constant $c=c(2,1)$ and a function $\omega(N)\to\infty$ as $N\to\infty$, such that $cN+\omega(N) 0$. The constant $c(2,1)$ is determined by Eberhard, Green, and Manners, while the existence of $\omega(N)$ is still widely open. In this paper, we study the analogue conjecture on $(k,\ell)$-sum free… Expand
1 Citations

References

SHOWING 1-10 OF 26 REFERENCES
THE MAXIMUM SIZE OF $(k,l)$ -SUM-FREE SETS IN CYCLIC GROUPS
• Mathematics
• Bulletin of the Australian Mathematical Society
• 2018
On sums of subsets of a set of integers
• Mathematics, Computer Science
• Comb.
• 1988
On the Littlewood Problem Modulo a Prime
• Mathematics