Agrawal, A and Choi, C and Sun, N (2020) On Permutation Weights and qEulerian Polynomials. In: Annals of Combinatorics, 24 (2). pp. 363378.

PDF
ANN_COM_24_2_363378_2020.pdf  Published Version Download (342kB)  Preview 
Abstract
Weights of permutations were originally introduced by Dugan et al. (Journal of Combinatorial Theory, Series A 164:24â��49, 2019) in their study of the combinatorics of tiered trees. Given a permutation Ï� viewed as a sequence of integers, computing the weight of Ï� involves recursively counting descents of certain subpermutations of Ï�. Using this weight function, one can define a qanalog En(x, q) of the Eulerian polynomials. We prove two main results regarding weights of permutations and the polynomials En(x, q). First, we show that the coefficients of En(x, q) stabilize as n goes to infinity, which was conjectured by Dugan et al. (Journal of Combinatorial Theory, Series A 164:24â��49, 2019), and enables the definition of the formal power series Wd(t) , which has interesting combinatorial properties. Second, we derive a recurrence relation for En(x, q) , similar to the known recurrence for the classical Eulerian polynomials An(x). Finally, we give a recursive formula for the numbers of certain integer partitions and, from this, conjecture a recursive formula for the stabilized coefficients mentioned above. Â© 2020, Springer Nature Switzerland AG.
Item Type:  Journal Article 

Publication:  Annals of Combinatorics 
Publisher:  Birkhauser 
Additional Information:  Copy right for this article belongs to Birkhauser 
Keywords:  qEulerian polynomials, Eulerian polynomials, permutations 
Department/Centre:  Division of Physical & Mathematical Sciences > Physics 
Date Deposited:  13 Nov 2020 10:12 
Last Modified:  13 Nov 2020 10:12 
URI:  http://eprints.iisc.ac.in/id/eprint/65765 
Actions (login required)
View Item 