Polynomial Triangles Revisited

Abstract

A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to fill this gap. We describe some aspects of these arrays, which generalize similar properties of the binomial coefficients. Some combinatorial models enumerated by polynomial coefficients, including lattice paths model, spin chain model and scores in a drawing game, are introduced. Several known binomial identities are then extended. In addition, we calculate recursively generating functions of column sequences. Interesting corollaries follow from these recurrence relations such as new formulae for the Fibonacci numbers and Hermite polynomials in terms of trinomial coefficients. Finally, properties of the entropy density function that characterizes polynomial coefficients in the thermodynamical limit are studied in details.

24 pages with 1 figure eps included

References in corpus (2)

• Identities in the Superintegrable Chiral Potts Model
• Card deals, lattice paths, abelian words and combinatorial identities

Cited by in corpus (8)

• A note on the gap between rank and border rank
• Asymptotic upper bounds on progression-free sets in ${\mathbb{Z}}_p^n$
• Some identities involving polynomial coefficients
• Some Elementary Congruences for the Number of Weighted Integer Compositions
• On the Combinatorics of Placing Balls into Ordered Bins
• Fractional Exclusion Statistics as an Occupancy Process
• On the combinatorics of exclusion in Haldane fractional statistics
• Some computations with the $\mathcal{F}$-homotopy limit spectral sequence