Indexed metadata

A Recurrence Relation for the "inv" Analogue of qq-Eulerian Polynomials

Chak-On Chow

Source record

Source: Crossref

Published: Apr 19, 2010

DOI: 10.37236/471

Open original source ↗

Source abstract

We study in the present work a recurrence relation, which has long been overlooked, for the qq-Eulerian polynomial Andes,inv(t,q)=∑σ∈Sntdes(σ)qinv(σ)A_n^{{\rm des},{\rm inv}}(t,q) =\sum_{\sigma\in\mathfrak{S}_n} t^{{\rm des}(\sigma)}q^{{\rm inv}(\sigma)}, where des(σ){\rm des}(\sigma) and inv(σ){\rm inv}(\sigma) denote, respectively, the descent number and inversion number of σ\sigma in the symmetric group Sn\mathfrak{S}_n of degree nn. We give an algebraic proof and a combinatorial proof of the recurrence relation.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A Recurrence Relation for the "inv" Analogue of $q$-Eulerian Polynomials — Mathematical Frontier Network