Search arXiv⌕ Search

arXiv · 2501.12083

Further results on $r$-Euler-Mahonian statistics

Abstract

As natural generalizations of the descent number ($\des$) and the major index ($\maj$), Rawlings introduced the notions of the $r$-descent number ($r\des$) and the $r$-major index ($r\maj$) for a given positive integer $r$. A pair $(\st_1, \st_2)$ of permutation statistics is said to be $r$-Euler-Mahonian if $ (\mathrm{st_1}, \mathrm{st_2})$ and $ (r\des, r\maj)$ are equidistributed over the set $\mathfrak{S}_{n}$ of all permutations of $\{1,2,\ldots, n\}$. The main objective of this paper is to confirm a recent conjecture posed by Liu which asserts that $(g\exc_\ell, g\den_\ell)$ is $(g+\ell-1)$-Euler-Mahonian for all positive integers $g$ and $\ell$, where $g\exc_\ell$ denotes the $g$-gap $\ell$-level excedance number and $g\den_\ell$ denotes the $g$-gap $\ell$-level Denert's statistic. This is accomplished via a bijective proof of the equidistribution of $(g\exc_\ell, g\den_\ell)$ and $ (r\des, r\maj)$ where $r=g+\ell-1$. Setting $g=\ell=1$, our result recovers the equidistribution of $(\des, \maj)$ and $(\exc, \den)$, which was first conjectured by Denert and proved by Foata and Zeilberger. Our second main result is concerned with the analogous result for $(g\exc_\ell, g\den_{g+\ell})$ which states that $(g\exc_\ell, g\den_{g+\ell})$ is $(g+\ell-1)$-Euler-Mahonian for all positive integers $g$ and $\ell$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kaimei Huang, Sherry H. F. Yan. 2025-01-21. Further results on $r$-Euler-Mahonian statistics. https://arxiv.org/abs/2501.12083

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

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗