q-Binomials and related symmetric unimodal polynomials
classification
🧮 math.CO
math.NT
keywords
proofunimodalanalyzecoefficientsperturbationspolynomialsq-binomialrecurrence
read the original abstract
The q-binomial coefficients were assumed to be unimodal as early as the 1850's, but it remained unproven until Sylvester's 1878 proof using invariant theory. In 1982, Proctor gave an "elementary" proof using linear algebra. Finally, in 1989, Kathy O'Hara provided a combinatorial proof of the unimodality of the q-binomial coefficients. Very soon thereafter, Doron Zeilberger translated the argument into an elegant recurrence. We introduce several perturbations to the recurrence to create a larger family of unimodal polynomials. We analyze how these perturbations affect the final polynomial and analyze some specific cases.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.