On large sum-free sets: revised bounds and patterns

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 $\left[\frac{n}{3},\frac{n}{2}\right]$, and the identification of all patterns that can be used to form sum-free sets of maximum cardinality.