An improved lower bound on the greatest element of a sum-distinct set of fixed order

DOI10.1016/0097-3165(86)90116-0zbMath0584.10036OpenAlexW2090873407MaRDI QIDQ1070281

Noam D. Elkies

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90116-0

zbMATH Keywords

greatest elementpseudo-sum-distinct setssum-distinct set

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13)

Related Items (10)

Weights of exact threshold functions ⋮ Newman polynomials with prescribed vanishing and integer sets with distinct subset sums ⋮ Minimum-weight edge discriminators in hypergraphs ⋮ Some remarks on the Erdős Distinct subset sums problem ⋮ Sum-distinct sequences and Fibonacci numbers ⋮ Siegel's Lemma and sum-distinct sets ⋮ An extremal problem for subset-sum-distinct sequences with congruence conditions ⋮ A Note on the Erdös Distinct Subset Sums Problem ⋮ Variations on the Erdős distinct-sums problem ⋮ An inequality for non-negative matrices. II

Cites Work

• Sets of Integers Whose Subsets Have Distinct Sums
• Unsolved problems in number theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved lower bound on the greatest element of a sum-distinct set of fixed order