Related papers: Inversions in Colored Permutations, Derangements, …

The number of inversions is a statistic on permutation groups measuring the degree to which the entries of a permutation are out of order. We provide a generalization of that statistic by introducing the statistic number of pseudoinversions…

Recently Cheng et al. (Adv. in Appl. Math. 143 (2023) 102451) generalized the inversion number to partial permutations, which are also known as Laguerre digraphs, and asked for a suitable analogue of MacMahon's major index. We provide such…

Inversion sequences, also known as subexcedant sequences, form a fundamental class of objects in enumerative combinatorics. In this paper, we study the joint distribution of five statistics on inversion sequences. While several statistics…

In the work of Varchenko, Zagier, Thibon, and Reiner, Saliola, Welker, linear algebraic properties of the multiplication map on the group algebra of the group algebra element are studied, which is the sum over all permutations weighted by…

We propose a unified approach to prove general formulas for the joint distribution of an Eulerian and a Mahonian statistic over a set of colored permutations by specializing Poirier's colored quasisymmetric functions. We apply this method…

We define new statistics, (c, d)-descents, on the colored permutation groups Z_r \wr S_n and compute the distribution of these statistics on the elements in these groups. We use some combinatorial approaches, recurrences, and generating…

We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices…

We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…

In a recent paper, Regev and Roichman introduced the <_L order and the L-descent number statistic, des_L, on the group of colored permutations, C_a \wr S_n. Here we define the L-reverse major index statistic, rmaj_L, on the same group and…

We consider several generalizations of the classical $\gamma$-positivity of Eulerian polynomials (and their derangement analogues) using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove…

We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…

The $k$-arrangements are permutations whose fixed points are $k$-colored. We prove enumerative results related to statistics and patterns on $k$-arrangements, confirming several conjectures by Blitvi\'c and Steingr\'imsson. In particular,…

In this paper we introduce the definition of marked permutations. We first present a bijection between Stirling permutations and marked permutations. We then present an involution on Stirling derangements. Furthermore, we present a…

The inversion number and the major index are equidistributed on the symmetric group. This is a classical result, first proved by MacMahon, then by Foata by means of a combinatorial bijection. Ever since many refinements have been derived,…

In this paper, we first introduce the number of signed permutations with exactly $k$ inversions, which is denoted by $i_B(n,k)$ and called \textit{Mahonian numbers of type $B$}. Then we provide a recurrence relation for the Mahonian numbers…

In 2000 Babson and Steingr{\'\i}msson introduced the notion of vincular patterns in permutations. They shown that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved…

Inversion formulas have been found, converting between Stirling, tanh and Lah numbers. Tanh and Lah polynomials, analogous to the Stirling polynomials, have been defined and their basic properties established. New identities for Stirling…

We introduce and study new refinements of inversion statistics for permutations, such as k-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the…

In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…

We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…