On sums of subsets of a set of integers (Q1116968): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Subset sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflexivity for Subspace Maps and Linear Spaces of Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representation of r-th powers by subset sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: An addition theorem modulo p / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEX FOURIER--BESSEL TRANSFORMS / rank
 
Normal rank

Latest revision as of 14:19, 19 June 2024

scientific article
Language Label Description Also known as
English
On sums of subsets of a set of integers
scientific article

    Statements

    On sums of subsets of a set of integers (English)
    0 references
    0 references
    1988
    0 references
    For each set \(A\subset \{1,2,\ldots,n\}\), let \(A^*=\{\sum_{b\in B}b: B\subseteq A\}\). Let \(p(n,r)\), \(r\geq 2\) (resp. \(f(n,m)\), \(m\geq 1\)) be such that \(A^*\) contains no \(r\)th power of an integer (resp. such that \(m\not\in A^*)\). Estimates on asymptotic formulae for \(p(n,r)\) and \(f(n,m)\) are obtained; a special case gives a conjecture of Erdős and Graham that \(f(n,m)\sim (\tfrac 12+o(1))(n/\log n)\). The proofs rely on a technical result which is established using the Hardy-Littlewood method.
    0 references
    maximum cardinality
    0 references
    sums of subsets
    0 references
    asymptotic formulae
    0 references
    Hardy-Littlewood method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references