q-Binomials and related symmetric unimodal polynomials

被引:1
作者
Ek, Bryan [1 ]
机构
[1] Rutgers State Univ, Sch Arts & Sci, Dept Math, Piscataway, NJ 08854 USA
关键词
Partition; unimodal; dynamical programming; computer-aided; recursive; OEIS; Recurrence; combinatorics;
D O I
10.1080/10236198.2019.1572125
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The q-binomial coefficients were conjectured 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 analyse how these perturbations affect the final polynomial and analyse some specific cases.
引用
收藏
页码:262 / 293
页数:32
相关论文
共 15 条
[1]  
Andrews GE., 1998, THEORY PARTITIONS
[2]  
[Anonymous], TECH REP
[3]  
Bona M., 2006, WALK COMBINATORICS
[4]  
Branden P., 2015, HDB ENUMERATIVE COMB, V87, P437
[5]   UNIMODAL POLYNOMIALS ARISING FROM SYMMETRIC FUNCTIONS [J].
BRENTI, F .
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1990, 108 (04) :1133-1141
[6]  
Gauss C. F., THEORIA COMBINATIONI, V5, P1823
[7]  
OEIS Foundation Inc, 2022, ON LINE ENCY INTEGER
[8]   UNIMODALITY OF GAUSSIAN COEFFICIENTS - A CONSTRUCTIVE PROOF [J].
OHARA, KM .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1990, 53 (01) :29-52
[9]   SOLUTION OF 2 DIFFICULT COMBINATORIAL PROBLEMS WITH LINEAR ALGEBRA [J].
PROCTOR, RA .
AMERICAN MATHEMATICAL MONTHLY, 1982, 89 (10) :721-734
[10]  
Sloane N.J.A., 2018, The on-line encyclopedia of integer sequences