A combinatorial identity of subset-sum powers in rings. (Q5928677): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1216/rmjm/1022008994 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086987096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Prouhet-Tarry-Escott problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tarry-Escott Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure product polynomials and the Prouhet-Tarry-Escott problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prouhet's 1851 Solution of the Tarry-Escott Problem of 1910 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1216/RMJM/1022008994 / rank
 
Normal rank

Latest revision as of 11:51, 9 December 2024

scientific article; zbMATH DE number 1583372
Language Label Description Also known as
English
A combinatorial identity of subset-sum powers in rings.
scientific article; zbMATH DE number 1583372

    Statements

    A combinatorial identity of subset-sum powers in rings. (English)
    0 references
    0 references
    1 April 2001
    0 references
    Escott showed that, for any set of \(n\) natural numbers, the sum of the \(k\)th powers of the sums of subsets of even cardinality is equal to the sum of the \(k\)th powers of the sums of subsets of odd cardinality for \(k=1, 2\ldots,n-1\). The author presents a new proof of this fact, showing that this result holds in noncommutative rings as well.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references