A combinatorial proof of Newton's identities

DOI10.1016/0012-365X(84)90171-7zbMath0535.05010OpenAlexW2089216547WikidataQ56602734 ScholiaQ56602734MaRDI QIDQ790817

Doron Zeilberger

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90171-7

zbMATH Keywords

Newton's identitiesinvolution mapping

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19)

Related Items (12)

Enumeration of weighted paths on a digraph and block hook determinant ⋮ A combinatorial approach to the Groebner bases for ideals generated by elementary symmetric functions ⋮ Sums of powers of roots via Bell polynomials ⋮ Generalized power sum and Newton-Girard identities ⋮ Combinatorialization of Sury and McLaughlin identities and general linear recurrences by a unified approach ⋮ On the behavior of multiple zeta-functions with identical arguments on the real line ⋮ Human and automated approaches for finite trigonometric sums ⋮ A generalized Newton-Girard formula for monomial symmetric polynomials ⋮ Recurrent sequences and Schur functions ⋮ K3 Surfaces of Picard Rank One and Degree Two ⋮ Context-free grammars, differential operators and formal power series ⋮ Combinatorial proofs of the Newton-Girard and Chapman-Costas-Santos identities

This page was built for publication: A combinatorial proof of Newton's identities