On Large Sum-Free Sets: Revised Bounds and Patterns

Renato Cordeiro de Amorim ()
Additional contact information
Renato Cordeiro de Amorim: School of Computer Science and Electronic Engineering, University of Essex, Colchester CO4 3SQ, UK

Mathematics, 2024, vol. 12, issue 24, 1-5

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 the 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.

Keywords: sum-free sets; additive number theory; combinatorial problems (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/24/3889/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/24/3889/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:24:p:3889-:d:1540688

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().