Sets of Integers Whose Subsets Have Distinct Sums

DOI10.1016/S0304-0208(08)73500-XzbMath0511.10038OpenAlexW1493733990MaRDI QIDQ4749911

Richard K. Guy

Publication date: 1982

Published in: Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73500-x

zbMATH Keywords

Conway-Guy sequencesums of integerssubsets with distinct sums

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Special sequences and polynomials (11B83)

Related Items (12)

Minimum-weight edge discriminators in hypergraphs ⋮ Some remarks on the Erdős Distinct subset sums problem ⋮ Sums of lexicographically ordered sets ⋮ Erdős and the integers ⋮ On the equal-subset-sum problem ⋮ A sum packing problem of Erdös and the Conway-Guy sequence ⋮ Non-injective knapsack public-key cryptosystems ⋮ Integer Sets with Distinct Subset-Sums ⋮ 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 improved lower bound on the greatest element of a sum-distinct set of fixed order

This page was built for publication: Sets of Integers Whose Subsets Have Distinct Sums