Integer Sets with Distinct Subset-Sums

DOI10.2307/2007933zbMath0654.10016OpenAlexW4254110683MaRDI QIDQ3800132

W. F. Lunnon

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2007933

zbMATH Keywords

Richardson extrapolationbacktrack searchKnapsack problemdivide-and-conquerSSDcomputational number theoryMACSYMAConway-Guy sequenceAtkinson-Negro-Santoro sequenceminimal SSD setsMultidimensional Continued Fraction algorithmSubset Sum Distinctness

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Enumerative combinatorics (05A99) Sequences and sets (11B99)

Related Items (10)

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 ⋮ Sums of lexicographically ordered sets ⋮ Bigger and better subset‐sum‐distinct sets ⋮ Arc-routing for winter road maintenance ⋮ A sum packing problem of Erdös and the Conway-Guy sequence ⋮ Unnamed Item ⋮ An extremal problem for subset-sum-distinct sequences with congruence conditions ⋮ Variations on the Erdős distinct-sums problem

Uses Software

• REDUCE
• MACSYMA

Cites Work

• Sums of lexicographically ordered sets
• Factoring polynomials with rational coefficients
• Solving low-density subset sum problems
• 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: Integer Sets with Distinct Subset-Sums