Searcharxiv⌕ Search

arXiv · 2609.12405

The $q$-analogues of $γ$-positivity of Eulerian polynomials via group actions

Abstract

Han, Jouhet and Zeng established $q$-analogues of the $γ$-expansion formulas for Eulerian polynomials of types $A$ and $B$. Combinatorial interpretations of the corresponding coefficients$a_{n,k}(q)$ and $b_{n,k}(q)$, however, remained open. In this paper, we provide combinatorial interpretations for thesecoefficients by using the model of increasing binary trees, thereby resolving a problem posed by Han, Jouhet and Zeng. Our combinatorial approach consists of three main steps: 1. construct a Carlitz-type insertion bijection for increasing binary trees and derive a new combinatorial interpretation ofCarlitz's $q$-Eulerian polynomials of type $A$ in terms of such trees; 2. introduce a generalized Foata--Strehl action on increasing binary trees to interpret the coefficients $a_{n,k}(q)$;3. derive a new combinatorial interpretation for the $q$-Eulerianpolynomials of type $B$ introduced by Chow and Gessel in terms of increasing binary trees of type $B$, and develop a generalizedFoata--Strehl action on these trees to interpret the coefficients $b_{n,k}(q)$. We further give combinatorial interpretations for the quotients ${a_{n,k}(q)/(-q;q)_{k-1}}$ and ${b_{n,k}(q)/(1+q)^k(-q;q^2)_k}$ in terms of André trees and a certain class of increasing binary trees of type $B$, respectively. As an application of the latter interpretation, we obtain a combinatorial interpretation for a $q$-analogue of the secant number and prove the positivity conjecture of Han, Jouhet and Zeng.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taifeng Ding, Lintong Wang, Sherry H. F. Yan. 2026-09-11. The $q$-analogues of $γ$-positivity of Eulerian polynomials via group actions. https://arxiv.org/abs/2609.12405

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A power series expansion of the Wilf function

In this work, the author employs the Faà di Bruno formula, identities for the partial Bell polynomials, two combinatorial identities, and the (logarithmically) complete monotonicity of generating functions for several integer sequences, together with the Wronski theorem, to investigate a collection of analytic and combinatorial structures. The study establishes Taylor series expansions for various functions involving the inverse (hyperbolic) tangent function and derives the Maclaurin expansion of the Wilf function, a composite of the inverse tangent, square root, and exponential functions. The coefficients in this expansion are expressed in terms of Stirling numbers of the second kind, and their generating functions, limits, positivity, monotonicity, and logarithmic convexity are analyzed. The paper further presents closed-form formulas for special values of the Gauss hypergeometric function and for certain partial Bell polynomials, along with several infinite series representations of the circular constant and related sequences. An asymptotic rational approximation to the circular constant is recovered, and connections among several integer sequences are established via determinants.

math.CO↗

From finding a spanning subgraph $H$ to an $H$-factor

A typical Dirac-type problem in extremal graph theory is to determine the minimum degree threshold for a graph $G$ to have a spanning subgraph $H$, e.g. the Dirac theorem. A natural follow-up problem is to seek an $H$-factor, which is a spanning set of vertex-disjoint copies of $H$. In this short note, we present a method for obtaining an upper bound on the minimum degree threshold for an $H$-factor from one for finding a spanning copy of $H$. As an application, we prove that, for all $\varepsilon>0$ and sufficiently large $\ell$, any oriented graph $G$ on $\ell m$ vertices with minimum semi-degree $δ^0(G) \ge (3/8+ \varepsilon )\ell m$ contains a $C_\ell$-factor, where $C_\ell$ is an arbitrary orientation of a cycle on $\ell$ vertices. This improves a result of Wang, Yan and Zhang.

math.CO↗

Localized Erdős-Pósa Property for Subdivisions

For a graph $H$, we say that $H$ has the Erdős-Pósa property for subdivisions with function $f$, if, for every nonnegative integer $k$ and every graph $G$, either $G$ contains (as a subgraph) $k+1$ pairwise vertex-disjoint subdivisions of $H$ or there exists a set $X\subseteq V(G)$ such that $G\setminus X$ contains no $H$-subdivision and $|X|\leq f(k)$. We show that every connected graph $H$ that has the Erdős-Pósa property for subdivision also satisfies a localized version of the Erdős-Pósa property, as follows. Let $H$ be a connected graph that has the Erdős-Pósa property for subdivisions with function $f$, and let $G$ be a graph that does not contain $k+1$ vertex-disjoint subdivisions of $H$. We demonstrate the existence of a set of at most $k$ vertex-disjoint subdivisions of $H$ in $G$ such that in their union, we can find a set $X$ with the property that $G \setminus X$ contains no $H$-subdivision and $|X| \leq 2^{f(k)}mk -k(m-n)$ where $n$ and $m$ are the number of vertices and edges.

math.CO↗