On large sum-free sets: revised bounds and patterns

2023/08/01 by Renato Cordeiro de Amorim, de Amorim, Renato Cordeiro
Mathematics · #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2308.00843

Abstract

In this paper we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of [1,n] with lowest value in [(n)/(3),(n)/(2) ], and the identification of all patterns that can be used to form sum-free sets of maximum cardinality.

Related

• Squares in sumsets
• The largest (k, ℓ)-sum-free subsets
• The number of maximal sum-free subsets of integers
• On the largest sum-free subset problem in the integers
• Sharp bound on the number of maximal sum-free subsets of integers