Search arXivSearch

arXiv · 2601.20201

Further refinements of Euler-Mahonian statistics for multipermutations

Abstract

Permutation statistics constitute a classical subject of enumerative combinatorics. In her study of the genus zeta function, Denert discovered a new Mahonian statistic for permutations, which is called the Denert's statistic ({\bf $\den$}) by Foata and Zeilberger. As natural extensions of the $r$-descent number ({\bf $r\des$}) and the $r$-major index ({\bf $r\maj$}) introduced by Rawlings, Liu introduced the $g$-gap $\ell$-level descent number ({\bf $g\des_{\ell}$}) and the $g$-gap $\ell$-level major index ({\bf $g\maj_{\ell}$}) for permutations. In this paper, we introduce the $g$-gap $\ell$-level Denert's statistic ({\bf $g\den_{\ell}$}) and the $g$-gap $\ell$-level excedance number ({\bf $g\exc_{\ell}$}) for multipermutations, which serve as natural generalizations of the Denert's statistic ({\bf $\den$}) and the excedance number ({\bf $\exc$}) for multipermutations first introduced by Han. By constructing two explicit bijections, we establish the equidistribution of the pairs $(g\exc_{\ell}, g\den_{h} )$ and $(g\des_{\ell}, g\maj_{\ell})$ over multipermutations for all $1\leq h\leq g+\ell$. Our result provides a new proof of the equidistribution of the pairs ($\des$, $\maj$) and ($\exc$, $\den$) over multipermutations originally derived by Han and enables us to confirm a recent conjecture posed by Huang-Lin-Yan. Furthermore, we demonstrate that for all $1\leq h\leq g+\ell$, the pair $(g\exc_\ell, g\den_{h})$ is $r$-Euler-Mahonian over multipermutations of $M=\{1^k, 2^k, \ldots, n^k\}$ where $r=g+\ell-1$ and $k\geq 1$, which extends a recent novel result derived by Liu from permutations to multipermutations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kaimei Huang, Yongzhou Wen, Sherry H. F. Yan. 2026-01-28. Further refinements of Euler-Mahonian statistics for multipermutations. https://arxiv.org/abs/2601.20201

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

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO