On permutation weights and q-Eulerian polynomials

DOI10.1007/S00026-020-00493-5MaRDI QIDQ2189565zbMATH OpenOpenAlexFDO

Authors Aman Agrawal, Caroline Choi, Nathan Sun

Publication date 16 June 2020

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.07398

zbMATH Keywords

\(q\)-Eulerian polynomialsEulerian polynomialspermutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) (q)-calculus and related topics (05A30) Enumeration in graph theory (05C30) Bernoulli and Euler numbers and polynomials (11B68)

Abstract: Weights of permutations were originally introduced by Dugan, Glennon, Gunnells, and Steingr'imsson (Journal of Combinatorial Theory, Series A 164:24-49, 2019) in their study of the combinatorics of tiered trees. Given a permutation $sigma$ viewed as a sequence of integers, computing the weight of $sigma$ involves recursively counting descents of certain subpermutations of $sigma$. Using this weight function, one can define a $q$-analog $E_n(x,q)$ of the Eulerian polynomials. We prove two main results regarding weights of permutations and the polynomials $E_n(x,q)$. First, we show that the coefficients of $E_n(x,q)$ stabilize as $n$ goes to infinity, which was conjectured by Dugan, Glennon, Gunnells, and Steingr'imsson (Journal of Combinatorial Theory, Series A 164:24-49, 2019), and enables the definition of the formal power series $W_d(t)$, which has interesting combinatorial properties. Second, we derive a recurrence relation for $E_n(x,q)$, similar to the known recurrence for the classical Eulerian polynomials $A_n(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.

Review text

\textit{W. Dugan} et al. [J. Comb. Theory, Ser. A 164, 24--49 (2019; Zbl 1407.05048)] using the weight of a permutation, defined a new \(q\)-analog of the Eulerian polynomials \(E_n(x,q)\). In this paper, two main results regarding permutation weights and the new \(q\)-Eulerian polynomials are presented. A stabilization phenomenon as \(n\) goes to infinity conjectured by Dugan et al. [loc. cit.], which gives an explicit formula for the formal power series \(W_d(t)\), extracted from \(E_n(x,q)\) was proved and a recurrence relation for the \(q\)-Eulerian polynomials \(E_n(x,q)\), similar to the known recurrence for the classical Eulerian polynomials \(A_n(x)\) was derived. Also, a recursive formula for the numbers of certain integer partitions was given. The authors conclude with a conjecture regarding the stabilized coefficients of \(W_d(t)\).

Recommendations

• A note on the weighted q-Euler numbers and polynomials
• scientific article; zbMATH DE number 5948758
• On the q-Euler numbers and polynomials with weight (, )
• Eulerian polynomials on segmented permutations
• scientific article; zbMATH DE number 6119613
• A note on the q-Euler numbers and polynomials with weight (,w)
• On several permutation polynomials over \({F_{q^2}}\)
• A note on quasi-permutation polynomials
• Identities on the weighted q-Euler numbers and q-Bernstein polynomials
• On the modified q-Euler polynomials with weight

Cites work

• Binomial posets, Möbius inversion, and permutation enumeration
• Deformations of Coxeter hyperplane arrangements
• scientific article; zbMATH DE number 988665 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Hyperplane arrangements, interval orders, and trees.
• Intransitive trees
• Major Index and Inversion Number of Permutations
• q-Bernoulli and Eulerian Numbers
• Recurrences for Eulerian polynomials of type B and type D
• Tiered trees, weights, and \(q\)-Eulerian numbers
• Torus orbits on homogeneous varieties and Kac polynomials of quivers
• 𝑞-Eulerian polynomials: Excedance number and major index

Cited in

(4)

• A \(D\)-finiteness result for products of permutations
• Eulerian polynomials on segmented permutations
• 𝑞-Eulerian polynomials: Excedance number and major index
• A complete enumeration of Ballot permutations avoiding sets of small patterns

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: On permutation weights and \(q\)-Eulerian polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189565)