Bigger and better subset‐sum‐distinct sets

DOI10.1112/S0025579300011979MaRDI QIDQ4346286zbMATH OpenFDO

Authors Roy Maltby

Publication date 13 November 1997

Published in Mathematika (Search for Journal in Brave)

zbMATH Keywords

Conway-Guy sequencesubset-sum-distinct sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Special sequences and polynomials (11B83) Ramsey theory (05D10)

Recommendations

• scientific article; zbMATH DE number 1803243
• Integer Sets with Distinct Subset-Sums
• A construction for sets of integers with distinct subset sums
• scientific article; zbMATH DE number 554181

Cites work

• A sum packing problem of Erdös and the Conway-Guy sequence
• Integer Sets with Distinct Subset-Sums
• Sums of lexicographically ordered sets
• Unsolved problems in number theory

Cited in

(6)

• Finding large co-Sidon subsets in sets with a given additive energy
• Newman polynomials with prescribed vanishing and integer sets with distinct subset sums
• Some remarks on the Erdős Distinct subset sums problem
• scientific article; zbMATH DE number 1803243 (Why is no real title available?)
• Integer Sets with Distinct Subset-Sums
• An equivalent formulation to an Erdős' problem on a set having distinct subset sums

This page was built for publication: Bigger and better subset‐sum‐distinct sets

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