Sets of Integers Whose Subsets Have Distinct Sums

DOI10.1016/S0304-0208(08)73500-XMaRDI QIDQ4749911zbMATH OpenOpenAlexFDO

Authors 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 sequencesubsets with distinct sumssums of integers

Mathematics Subject Classification ID

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

Cited in

(16)

• An improved lower bound on the greatest element of a sum-distinct set of fixed order
• On the equal-subset-sum problem
• An extremal problem for subset-sum-distinct sequences with congruence conditions
• Erdős and the integers
• Variations on the Erdős distinct-sums problem
• Integer Sets with Distinct Subset-Sums
• A sum packing problem of Erdös and the Conway-Guy sequence
• Minimum-weight edge discriminators in hypergraphs
• A Note on the Erdös Distinct Subset Sums Problem
• Non-injective knapsack public-key cryptosystems
• Some remarks on the Erdős Distinct subset sums problem
• The Euler characteristic of the fiber product of Morse functions on the unitary group
• Variants of the Erdős distinct sums problem and variance method
• Higher degree Erdős distinct evaluations problem (extended abstract)
• The Erdõs distinct subset sums problem in a modular setting
• Sums of lexicographically ordered sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4749911)