The largest $(k,\ell )$-sum-free subsets
<p>Let M(2,1)(N) be the infimum of the largest sum-free subset of any set of N positive integers. An old conjecture in additive combinatorics asserts that there is a constant c = c(2, 1) and a function ω(N) → ∞ as N → ∞, such that cN + ω(N) < M(2,1)(N) < (c + o(1))N. The constant c(2, 1)...
| Автори: | , |
|---|---|
| Формат: | Journal article |
| Мова: | English |
| Опубліковано: |
American Mathematical Society
2021
|