Search arXivSearch

arXiv · 2509.03397

The ratio monotonicity of Eulerian-type polynomials

Abstract

This paper is motivated by determining the location of modes of some unimodal Eulerian-type polynomials. The notion of ratio monotonicity was introduced by Chen-Xia when they investigated the $q$-derangement numbers. Let $(f_n(x))_{n\geqslant 0}$ be a sequence of real polynomials satisfying the Eulerian-type recurrence relation $$f_{n+1}(x)=(anx+bx+c)f_n(x)+ax(1-x)\frac{\mathrm{d}}{\mathrm{d}x}f_n(x),~f_0(x)=1,$$ where $a,b$ and $c$ are nonnegative integers. Assume that $deg f_n(x)=n$. Setting $g_n(x)=x^nf_n\left(\frac{1}{x}\right)$, we have $$g_{n+1}(x)=(anx+b+cx)g_n(x)+ax(1-x)\frac{\mathrm{d}}{\mathrm{d}x}g_n(x),$$ We find that if $a+c\geqslant b\geqslant c>0$, then $f_n(x)$ is bi-gamma-positive and $g_n(x)$ is ratio monotone. As applications, we discover the ratio monotonicity of several Eulerian-type polynomials, including the $(exc,cyc)$ $q$-Eulerian polynomials, the $1/k$-Eulerian polynomials, a kind of generalized Eulerian polynomials studied by Carlitz-Scoville, the $(des_B,neg)$ $q$-Eulerian polynomials over the hyperoctahedral group and the $r$-colored Eulerian polynomials. In particular, let $A_n(x,q)$ be the $(exc,cyc)$ $q$-Eulerian polynomials, we find that the polynomials $x^{n-1}A_n(1/x,q)$ are ratio monotone when $0<q\leqslant 1$, while $A_n(x,q)$ are ratio monotone when $1\leqslant q\leqslant 2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jun-Ying Liu, Guanwu Liu, Shi-Mei Ma, Zhi-Hong Zhang. 2025-09-05. The ratio monotonicity of Eulerian-type polynomials. https://arxiv.org/abs/2509.03397

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO