Some remarks on the Erdős Distinct subset sums problem

DOI10.1142/s1793042123500860arXiv2208.12182OpenAlexW4363672267MaRDI QIDQ6133820

Stefan Steinerberger

Publication date: 21 August 2023

Published in: International Journal of Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

random walksErdős distinct subset sums problem

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Sums of independent random variables; random walks (60G50) Additive bases, including sumsets (11B13) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Tuples of \(n\) natural numbers such that all sums are different and a measure concentration phenomenon
• Siegel's Lemma and sum-distinct sets
• Integer Sets with Distinct Subset-Sums
• A sum packing problem of Erdös and the Conway-Guy sequence
• Bigger and better subset‐sum‐distinct sets
• Sets of Integers Whose Subsets Have Distinct Sums
• Newman polynomials with prescribed vanishing and integer sets with distinct subset sums
• Optimal numberings and isoperimetric problems on graphs
• A Note on the Erdös Distinct Subset Sums Problem

This page was built for publication: Some remarks on the Erdős Distinct subset sums problem