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)...

詳細記述

書誌詳細
主要な著者: Jing, Y, Wu, S
フォーマット: Journal article
言語:English
出版事項: American Mathematical Society 2021

類似資料