A Note on the Erdös Distinct Subset Sums Problem

DOI10.1137/20M1385883zbMath1459.05333arXiv2006.12988OpenAlexW3134883592MaRDI QIDQ5854463

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

isoperimetric inequalityextremal combinatoricsprobabilistic methodadditive combinatoricssubset sum

Mathematics Subject Classification ID

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

Related Items (6)

Upper and lower bounds on the size of $B_k[g$ sets] ⋮ Sidon sets for linear forms ⋮ 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 ⋮ Variations on the Erdős distinct-sums problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improvement of convergence rate estimates in the Lyapunov theorem
• An improved lower bound on the greatest element of a sum-distinct set of fixed order
• A construction for sets of integers with distinct subset sums
• Siegel's Lemma and sum-distinct sets
• Sets of Integers Whose Subsets Have Distinct Sums
• Optimal numberings and isoperimetric problems on graphs
• Unsolved problems in number theory

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