Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
117 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Polynomial Triangles Revisited (1202.0228v7)

Published 1 Feb 2012 in math.CO, cond-mat.stat-mech, math-ph, and math.MP

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.

Citations (21)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com
Youtube Logo Streamline Icon: https://streamlinehq.com