Search arXivSearch

arXiv · 2501.12055

Combinatorics on bi-$γ$-positivity of $1/k$-Eulerian polynomials

Abstract

The $1/k$-Eulerian polynomials $A^{(k)}_{n}(x)$ were introduced as ascent polynomials over $k$-inversion sequences by Savage and Viswanathan. The bi-$γ$-positivity of the $1/k$-Eulerian polynomials $A^{(k)}_{n}(x)$ 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 $A^{(k)}_{n}(x)$ by using the model of certain ordered labeled forests. Our combinatorial approach consists of three main steps: (i) construct a bijection between $k$-Stirling permutations and certain forests that are named increasing pruned even $k$-ary forests; (ii) introduce a generalized Foata--Strehl action on increasing pruned even $k$-ary trees which implies the longest ascent-plateau polynomials over $k$-Stirling permutations with initial letter $1$ are $γ$-positive, a result that may have independent interest; (iii) develop two crucial transformations on increasing pruned even $k$-ary forests to conclude our combinatorial interpretation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sherry H. F. Yan, Xubo Yang, Zhicong Lin. 2025-01-21. Combinatorics on bi-$γ$-positivity of $1/k$-Eulerian polynomials. https://arxiv.org/abs/2501.12055

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