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)...
Autori principali: | Jing, Y, Wu, S |
---|---|
Natura: | Journal article |
Lingua: | English |
Pubblicazione: |
American Mathematical Society
2021
|
Documenti analoghi
Documenti analoghi
-
Generalized sum-free subsets
di: Yair Caro
Pubblicazione: (1990-01-01) -
On the largest product-free subsets of the alternating groups
di: Keevash, Peter, et al.
Pubblicazione: (2024) -
On the largest product-free subsets of the alternating groups
di: Keevash, P, et al.
Pubblicazione: (2024) -
On Sum-Free Subsets of Abelian Groups
di: Renato Cordeiro de Amorim
Pubblicazione: (2023-07-01) -
Computing the sum of k largest Laplacian eigenvalues of tricyclic graphs
di: Pawan Kumar, et al.
Pubblicazione: (2022-09-01)