Bigger and better subset‐sum‐distinct sets

DOI10.1112/S0025579300011979zbMath0874.11026MaRDI QIDQ4346286

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)

Related Items (2)

Newman polynomials with prescribed vanishing and integer sets with distinct subset sums ⋮ Some remarks on the Erdős Distinct subset sums problem

Cites Work

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

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