A theorem contained in the paper 'A combinatoric formula' by Wang, Lee and Tan (J. Math. Anal. Appl. 160 (1991) 500--503) gives rise to the definition of certain polynomials associated with boards: Stimulated by the analogy to the well-known rook polynomials, we call them 'dual rook polynomials'. We
Generalized Rook Polynomials
β Scribed by Jay Goldman; James Haglund
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 288 KB
- Volume
- 91
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are established with absolute Stirling numbers and permutations, Bessel polynomials, matchings, multiset permutations, hypergeometric functions, Abel polynomials and forests, and polynomial sequences of binomial type. Factorization and reciprocity theorems are proved and a q-analogue is given.
π SIMILAR VOLUMES
## ABSTRACC It is shown that a p +q node graph G, representation can be drawn for a chessboard C(p, q) i.e. an array of p rows and q columns. It is shown further that the coefficients of the rook polynomial for C(p, q) correspond 1: 1 inversely with the coefficients of the chromatic polynomial for
Connections between q-rook polynomials and matrices over finite fields are exploited to derive a new statistic for Garsia and Remmel's q-hit polynomial. Both this new statistic mat and another statistic for the q-hit polynomial recently introduced by Dworkin are shown to induce different multiset Ma