On sums of subsets of a set of integers

DOI10.1007/BF02189086zbMath0666.10035MaRDI QIDQ1116968

S. H. Smith

Publication date: 1988

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

Hardy-Littlewood methodasymptotic formulaemaximum cardinalitysums of subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Applications of the Hardy-Littlewood method (11P55) Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13)

Related Items (12)

On a conjecture of Alon ⋮ On threshold properties of \(k\)-SAT: An additive viewpoint ⋮ Sur le nombre d'éléments exceptionnels d'une base additive ⋮ Subset-sum problems with different summands: Computation ⋮ Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks ⋮ On subset sums of \(r\)-sets ⋮ Phase transition and finite-size scaling for the integer partitioning problem ⋮ Solving dense subset-sum problems by using analytical number theory ⋮ The largest $(k,\ell )$-sum-free subsets ⋮ The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\) ⋮ On consecutive subset sums ⋮ Erratum to: ``New analytical results in subset-sum problem

Cites Work

• Subset sums
• On representation of r-th powers by subset sums
• Reflexivity for Subspace Maps and Linear Spaces of Operators
• An addition theorem modulo p
• COMPLEX FOURIER--BESSEL TRANSFORMS

This page was built for publication: On sums of subsets of a set of integers