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
|
समान संसाधन
-
Generalized sum-free subsets
द्वारा: Yair Caro
प्रकाशित: (1990-01-01) -
On the largest product-free subsets of the alternating groups
द्वारा: Keevash, Peter, और अन्य
प्रकाशित: (2024) -
On the largest product-free subsets of the alternating groups
द्वारा: Keevash, P, और अन्य
प्रकाशित: (2024) -
On Sum-Free Subsets of Abelian Groups
द्वारा: Renato Cordeiro de Amorim
प्रकाशित: (2023-07-01) -
Computing the sum of k largest Laplacian eigenvalues of tricyclic graphs
द्वारा: Pawan Kumar, और अन्य
प्रकाशित: (2022-09-01)