Search arXivSearch

arXiv · 2404.09777

A $q$-analog of the Stirling-Eulerian Polynomials

Abstract

In 1974, Carlitz and Scoville introduced the Stirling-Eulerian polynomial $A_n(x,y|α,β)$ as the enumerator of permutations by descents, ascents, left-to-right maxima and right-to-left maxima. Recently, Ji considered a refinement of $A_n(x,y|α,β)$, denoted $P_n(u_1,u_2,u_3,u_4|α,β)$, which is the enumerator of permutations by valleys, peaks, double ascents, double descents, left-to-right maxima and right-to-left maxima. Using Chen's context-free grammar calculus, Ji proved a formula for the generating function of $P_n(u_1,u_2,u_3,u_4|α,β)$, generalizing the work of Carlitz and Scoville. Ji's formula has many nice consequences, one of which is an intriguing $γ$-positivity expansion for $A_n(x,y|α,β)$. In this paper, we prove a $q$-analog of Ji's formula by using Gessel's $q$-compositional formula and provide a combinatorial approach to her $γ$-positivity expansion of $A_n(x,y|α,β)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yao Dong, Zhicong Lin, Qiongqiong Pan. 2024-04-15. A $q$-analog of the Stirling-Eulerian Polynomials. https://arxiv.org/abs/2404.09777

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

KEEP EXPLORING

Related papers

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

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