On large sum-free sets: revised bounds and patterns
Combinatorics
2023-10-05 v2
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 with lowest value in , and the identification of all patterns that can be used to form sum-free sets of maximum cardinality.
Keywords
Cite
@article{arxiv.2308.00843,
title = {On large sum-free sets: revised bounds and patterns},
author = {Renato Cordeiro de Amorim},
journal= {arXiv preprint arXiv:2308.00843},
year = {2023}
}