The largest (k, ℓ)-sum-free subsets

2020/01/16 by Yifan Jing, Shukun Wu, Jing, Yifan +1 · 1 citation
Mathematics · #Limits and Structures in Graph Theory #Advanced Topology and Set Theory #Mathematical and Theoretical Analysis

paper · pdf · doi:10.48550/arxiv.2001.05632

Abstract

Let \mathscrM_(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)

Cited by

• The Hilton-Milner type results of (k, ℓ)-sum-free sets in \mathbb F_pⁿ

Related

• On the largest sum-free subset problem in the integers
• Large sum-free subsets of sets of integers via L¹-estimates for trigonometric series
• The number of maximal sum-free subsets of integers
• Sharp bound on the number of maximal sum-free subsets of integers
• On large sum-free sets: revised bounds and patterns