August 19, 2005
Similar papers 5
June 6, 2016
We define a new statistic on the even hyperoctahedral groups which is a natural analogue of the odd length statistic recently defined and studied on Coxeter groups of types $A$ and $B$. We compute the signed (by length) generating function of this statistic over the whole group and over its maximal and some other quotients and show that it always factors nicely. We also present some conjectures.
November 11, 2016
The descent algebra of a finite Coxeter group W is a subalgebra of the group algebra defined by Solomon. Descent algebras of symmetric groups have properties that are not shared by other Coxeter groups. For instance, the natural map from the descent algebra of a symmetric group to its character ring is a surjection with kernel equal the Jacobson radical. Thus, the descent algebra implicitly encodes information about the representations of the symmetric group, and a complete s...
December 14, 2021
We consider statistics on permutations chosen uniformly at random from fixed parabolic double cosets of the symmetric group. We show that the distribution of fixed points is asymptotically Poisson and establish central limit theorems for the distribution of descents and inversions. Our proofs use Stein's method with size-bias coupling and dependency graphs, which also gives convergence rates for our distributional approximations. As applications of our size-bias coupling and ...
August 8, 2024
A pair $(\mathrm{st_1}, \mathrm{st_2})$ of permutation statistics is said to be $r$-Euler-Mahonian if $(\mathrm{st_1}, \mathrm{st_2})$ and $( \mathrm{rdes}$, $\mathrm{rmaj})$ are equidistributed over the set $\mathfrak{S}_{n}$ of all permutations of $\{1,2,\ldots, n\}$, where $\mathrm{rdes}$ denotes the $r$-descent number and $\mathrm{rmaj}$ denotes the $r$-major index introduced by Rawlings. The main objective of this paper is to prove that $(\mathrm{exc}_r, \mathrm{den}_r...
May 19, 2008
Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are a pure combinatorial algorithm to describe the irreducible decomposition of the tensor product of two irreducible representations of the symmetric group, and new symmetry results on permutation enumeration with respect to descent sets.
July 11, 2022
We present a short proof of MacMahon's classic result that the number of permutations with $k$ inversions equals the number whose major index (sum of positions at which descents occur) is $k$
May 5, 2018
This is the second of two papers introducing and investigating two bivariate zeta functions associated to unipotent group schemes over rings of integers of number fields. In the first part, we proved some of their properties such as rationality and functional equations. Here, we calculate such bivariate zeta functions of three infinite families of nilpotent groups of class 2 generalising the Heisenberg group of three by three unitriangular matrices over rings of integers of n...
July 29, 2016
In this paper, we start by giving the definitions and basic facts about hyperoctahedral number system. There is a natural correspondence between the integers expressed in the latter and the elements of the hyperoctahedral group when we use the inversion statistic on this group to code the signed permutations. We use this correspondence to define a way with which the signed permutations group can be ordered. With this classification scheme, we can find the r-th signed permutat...
October 29, 1999
The expectation of the descent number of a random Young tableau of a fixed shape is given, and concentration around the mean is shown. This result is generalized to the major index and to other descent functions. The proof combines probabilistic arguments together with combinatorial character theory. Connections with Hecke algebras are mentioned.
October 30, 2017
Let $n$ be a nonnegative integer and $I$ be a finite set of positive integers. In 1915, MacMahon proved that the number of permutations in the symmetric group $\mathfrak{S}_n$ with descent set $I$ is a polynomial in $n$. We call this the descent polynomial. However, basic properties of these polynomials such as a description of their coefficients and roots do not seem to have been studied in the literature. Much more recently, in 2013, Billey, Burdzy, and Sagan showed that th...