Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2507.17667

Symmetric decompositions and Euler-Stirling statistics on Stirling permutations

Shi-Mei Ma·Jianfeng Wang·Guiying Yan·Jean Yeh·Yeong-Nan Yeh
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Stirling permutations introduced by Gessel-Stanley have recently received considerable attention. Motivated by Ji's work on $(α,β)$-Eulerian polynomials (Sci China Math., 2025) and Yan-Yang-Lin's work on $1/k$-Eulerian polynomials (J. Combin. Theory Ser. A, 2026), we present several symmetric decompositions of the enumerators related to Euler-Stirling statistics on Stirling permutations. Firstly, we provide a partial symmetric decomposition for the $1/k$-Eulerian polynomial. Secondly, we give several unexpected applications of the $(p,q)$-Eulerian polynomials, where $p$ marks the number of fixed points of permutations and $q$ marks that of cycles. From this paper, one can see that $(p,q)$-Eulerian polynomial contains a great deal of information about permutations and Stirling permutations. Using the change of grammars, we show that the $(α,β)$-Eulerian polynomials introduced by Carlitz-Scoville can be deduced from the $(p,q)$-Eulerian polynomials by special parametrizations. We then introduce proper and improper ascent-plateau statistics on Stirling permutations. Moreover, we introduce proper ascent, improper ascent, proper descent and improper descent statistics on permutations. Furthermore, we consider the joint distributions of Euler-Stirling statistics on permutations, including the numbers of improper ascents, proper ascents, left-to-right minima and right-to-left minina. In the final part, we first give a symmetric decomposition of the joint distribution of the ascent-plateau and left ascent-plateau statistics, and then we show that the $q$-ascent-plateau polynomials are bi-$γ$-positive, where $q$ marks the number of left-to-right minima.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shi-Mei Ma, Jianfeng Wang, Guiying Yan, Jean Yeh, Yeong-Nan Yeh. 2025-07-25. Symmetric decompositions and Euler-Stirling statistics on Stirling permutations. https://arxiv.org/abs/2507.17667

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗