A construction for sets of integers with distinct subset sums
From MaRDI portal
Publication:1379125
zbMath0932.11015MaRDI QIDQ1379125
Publication date: 18 February 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120147
Other combinatorial number theory (11B75) Special sequences and polynomials (11B83) Ramsey theory (05D10)
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-distinguishing number of sparse hypergraphs ⋮ Sorting signed permutations by reversals using link-cut trees ⋮ Arc-routing for winter road maintenance ⋮ A sum packing problem of Erdös and the Conway-Guy sequence ⋮ A Note on the Erdös Distinct Subset Sums Problem ⋮ Variations on the Erdős distinct-sums problem
This page was built for publication: A construction for sets of integers with distinct subset sums
