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)...
Autors principals: | Jing, Y, Wu, S |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
American Mathematical Society
2021
|
Ítems similars
-
Generalized sum-free subsets
per: Yair Caro
Publicat: (1990-01-01) -
On the largest product-free subsets of the alternating groups
per: Keevash, Peter, et al.
Publicat: (2024) -
On the largest product-free subsets of the alternating groups
per: Keevash, P, et al.
Publicat: (2024) -
On Sum-Free Subsets of Abelian Groups
per: Renato Cordeiro de Amorim
Publicat: (2023-07-01) -
Computing the sum of k largest Laplacian eigenvalues of tricyclic graphs
per: Pawan Kumar, et al.
Publicat: (2022-09-01)