A note on the Erdős distinct subset sums problem

2020/06/20 by Quentin Dubroff, Jacob Fox, Dubroff, Quentin +3
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Number Theory (math.NT) #Probability (math.PR)

paper · pdf · doi:10.48550/arxiv.2006.12988

openalex publication_date 2020/06/20 · openalex created_date 2020/07/29 · openalex updated_date 2026/07/28

Abstract

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of n positive integers with distinct subset sums.

Related

• Variations on the Erdős distinct-sums problem
• The Erdős distinct subset sums problem in a modular setting
• A Generalisation on Erdős Distinct Subset Sums Problem
• Siegel's Lemma and Sum-Distinct Sets
• Some Remarks on the Erdős Distinct Subset Sums Problem