A combinatorial proof of Newton's identities
From MaRDI portal
Publication:790817
DOI10.1016/0012-365X(84)90171-7zbMATH Open0535.05010OpenAlexW2089216547WikidataQ56602734 ScholiaQ56602734MaRDI QIDQ790817FDOQ790817
Authors: 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
Cited In (13)
- Enumeration of weighted paths on a digraph and block hook determinant
- Recurrent sequences and Schur functions
- Combinatorial proofs of the Newton-Girard and Chapman-Costas-Santos identities
- An exterior-algebraic proof of Newton's formulae
- Human and automated approaches for finite trigonometric sums
- Combinatorialization of Sury and McLaughlin identities and general linear recurrences by a unified approach
- K3 Surfaces of Picard Rank One and Degree Two
- A combinatorial approach to the Groebner bases for ideals generated by elementary symmetric functions
- Generalized power sum and Newton-Girard identities
- Context-free grammars, differential operators and formal power series
- On the behavior of multiple zeta-functions with identical arguments on the real line
- A generalized Newton-Girard formula for monomial symmetric polynomials
- Sums of powers of roots via Bell polynomials
This page was built for publication: A combinatorial proof of Newton's identities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790817)
