A Note on the Erdös Distinct Subset Sums Problem

DOI10.1137/20M1385883MaRDI QIDQ5854463zbMATH OpenOpenAlexFDO

Authors Quentin Dubroff, Jacob Fox, Max Wenqiang Xu

Publication date 17 March 2021

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.12988

zbMATH Keywords

additive combinatoricsextremal combinatoricsisoperimetric inequalityprobabilistic methodsubset sum

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)

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.

Cites work

• A construction for sets of integers with distinct subset sums
• An improved lower bound on the greatest element of a sum-distinct set of fixed order
• An improvement of convergence rate estimates in the Lyapunov theorem
• scientific article; zbMATH DE number 3121715 (Why is no real title available?)
• scientific article; zbMATH DE number 18980 (Why is no real title available?)
• scientific article; zbMATH DE number 3632542 (Why is no real title available?)
• scientific article; zbMATH DE number 903683 (Why is no real title available?)
• Optimal numberings and isoperimetric problems on graphs
• Sets of Integers Whose Subsets Have Distinct Sums
• Siegel's Lemma and sum-distinct sets
• The probabilistic method
• Unsolved problems in number theory

Cited in

(10)

• Variations on the Erdős distinct-sums problem
• Sidon sets for linear forms
• Upper and lower bounds on the size of \(B_k[g]\) sets
• scientific article; zbMATH DE number 7688183 (Why is no real title available?)
• Recovering affine linearity of functions from their restrictions to affine lines
• Some remarks on the Erdős Distinct subset sums problem
• Sum-distinguishing number of sparse hypergraphs
• Variants of the Erdős distinct sums problem and variance method
• Higher degree Erdős distinct evaluations problem (extended abstract)
• The Erdõs distinct subset sums problem in a modular setting

This page was built for publication: A Note on the Erdös Distinct Subset Sums Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854463)