Combinatorics on bi-$\gamma$-positivity of $1/k$-Eulerian polynomials
Sherry H.F. Yan, Xubo Yang, Zhicong Lin

TL;DR
This paper provides a combinatorial interpretation for the bi-$ ext{γ}$-coefficients of $1/k$-Eulerian polynomials using ordered labeled forests, advancing understanding of their bi-$ ext{γ}$-positivity.
Contribution
It introduces a novel combinatorial approach involving forests and bijections to interpret bi-$ ext{γ}$-coefficients of $1/k$-Eulerian polynomials.
Findings
Established a bijection between $k$-Stirling permutations and certain forests.
Proved $ ext{γ}$-positivity of longest ascent-plateau polynomials over $k$-Stirling permutations.
Provided a combinatorial interpretation for bi-$ ext{γ}$-coefficients.
Abstract
The -Eulerian polynomials were introduced as ascent polynomials over -inversion sequences by Savage and Viswanathan. The bi--positivity of the -Eulerian polynomials 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 by using the model of certain ordered labeled forests. Our combinatorial approach consists of three main steps: (i) construct a bijection between -Stirling permutations and certain forests that are named increasing pruned even -ary forests; (ii) introduce a generalized Foata--Strehl action on increasing pruned even -ary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Advanced Combinatorial Mathematics · graph theory and CDMA systems
