Gamma positivity of variations of (α,t)-Eulerian polynomials

Abstract

In 1977 Carlitz and Scoville introduced the cycle (α,t)-Eulerian polynomials Acycn(x,y, t\,|\,α) by enumerating permutations with respect to the number of excedances, drops, fixed points and cycles. In this paper, we introduce a nine-variable generalization of the Eulerian polynomials An(u1,u2,u3,u4, f, g, t\,|\,α, β) in terms of descent based statistics of permutations and prove a connection formula between these two kinds of generalized Eulerian polynomials. By exploring the connection formula, we derive plainly the exponential generating function of the latter polynomials and various γ-positive formulas for variants of Eulerian polynomials. In particular, our results unify and strengthen the recent results by Ji and Ji-Lin. In related work to the transition matrix between the Specht and web bases, Hwang, Jang and Oh recently introduced the web permutations, which can be characterised by cycle Andr\'e permutations. We show that enumerating the latter permutations with respect to the number of drops, fixed points and cycles gives rise to the normalised γ-vectors of the (α,t)-Eulerian polynomials. Our result generalizes and unifies several known results in the literature.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…