Integer Sets with Distinct Subset-Sums

DOI10.2307/2007933MaRDI QIDQ3800132zbMATH OpenOpenAlexFDO

Authors W. F. Lunnon

Publication date 1988

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

zbMATH Keywords

Atkinson-Negro-Santoro sequencebacktrack searchcomputational number theoryConway-Guy sequencedivide-and-conquerKnapsack problemMACSYMAminimal SSD setsMultidimensional Continued Fraction algorithmRichardson extrapolationSSDSubset Sum Distinctness

Mathematics Subject Classification ID

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

Recommendations

• Bigger and better subset‐sum‐distinct sets
• scientific article; zbMATH DE number 1803243
• A construction for sets of integers with distinct subset sums
• scientific article; zbMATH DE number 903683
• A sum packing problem of Erdös and the Conway-Guy sequence

Cites work

• Factoring polynomials with rational coefficients
• scientific article; zbMATH DE number 3841211 (Why is no real title available?)
• scientific article; zbMATH DE number 3917522 (Why is no real title available?)
• scientific article; zbMATH DE number 3737757 (Why is no real title available?)
• Sets of Integers Whose Subsets Have Distinct Sums
• Solving low-density subset sum problems
• Sums of lexicographically ordered sets
• Unsolved problems in number theory

Cited in

(23)

• On sums of subsets of a set of integers
• Disjoint odd integer subsets having a constant odd sum
• An extremal problem for subset-sum-distinct sequences with congruence conditions
• Integer sets with prescribed pairwise differences being distinct
• Variations on the Erdős distinct-sums problem
• Arc-routing for winter road maintenance
• An equivalent formulation to an Erdős' problem on a set having distinct subset sums
• scientific article; zbMATH DE number 1803243 (Why is no real title available?)
• scientific article; zbMATH DE number 5130028 (Why is no real title available?)
• A sum packing problem of Erdös and the Conway-Guy sequence
• Minimum-weight edge discriminators in hypergraphs
• Integer sets with distinct subset sums
• Bigger and better subset‐sum‐distinct sets
• Newman polynomials with prescribed vanishing and integer sets with distinct subset sums
• scientific article; zbMATH DE number 903683 (Why is no real title available?)
• Equal-subset-sum faster than the meet-in-the-middle
• Sets of integers with missing differences
• Some remarks on the Erdős Distinct subset sums problem
• 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
• Disjoint subsets of integers having a constant sum
• Sums of lexicographically ordered sets

Describes a project that uses

Uses Software

• REDUCE
• MACSYMA

This page was built for publication: Integer Sets with Distinct Subset-Sums

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