Combinatorics on bi-γ-positivity of 1/k-Eulerian polynomials

Abstract

The 1/k-Eulerian polynomials A(k)n(x) were introduced as ascent polynomials over k-inversion sequences by Savage and Viswanathan. The bi-γ-positivity of the 1/k-Eulerian polynomials A(k)n(x) was known but to give a combinatorial interpretation of the corresponding bi-γ-coefficients still remains open. The study of the theme of bi-γ-positivities from purely combinatorial aspect was proposed by Athanasiadis. In this paper, we provide a combinatorial interpretation for the bi-γ-coefficients of A(k)n(x) by using the model of certain ordered labeled forests. Our combinatorial approach consists of three main steps: (i) construct a bijection between k-Stirling permutations and certain forests that are named increasing pruned even k-ary forests; (ii) introduce a generalized Foata--Strehl action on increasing pruned even k-ary trees which implies the longest ascent-plateau polynomials over k-Stirling permutations with initial letter 1 are γ-positive, a result that may have independent interest; (iii) develop two crucial transformations on increasing pruned even k-ary forests to conclude our combinatorial interpretation.

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…