We give a combinatorial interpretation of the connection constants for persistent sequences of polynomials in terms of weighted binary paths. In this way we give bijective proofs for many formulas which generalize several classical identities and recurrences, such as the upper index sum, the Lagrange and the Vandermonde sum and Euler's theorem on the coefficients of Gaussian coefficients.
A combinatorial interpretation of the connection constants for persistent sequences of polynomials
MUNARINI, EMANUELE
2005-01-01
Abstract
We give a combinatorial interpretation of the connection constants for persistent sequences of polynomials in terms of weighted binary paths. In this way we give bijective proofs for many formulas which generalize several classical identities and recurrences, such as the upper index sum, the Lagrange and the Vandermonde sum and Euler's theorem on the coefficients of Gaussian coefficients.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
