Related papers: q Statistics on $S_n$ and Pattern Avoidance

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…

MacMahon's classic theorem states that the 'length' and 'major index' statistics are equidistributed on the symmetric group S_n. By defining natural analogues or generalizations of those statistics, similar equidistribution results have…

Let $A_n\subseteq S_n$ denote the alternating and the symmetric groups on $1,...,n$. MacMahaon's theorem, about the equi-distribution of the length and the major indices in $S_n$, has received far reaching refinements and generalizations,…

We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…

We consider Kemp's q-analogue of the binomial distribution. Several convergence results involving the classical binomial, the Heine, the discrete normal, and the Poisson distribution are established. Some of them are q-analogues of…

Let $q$ be a positive integer and $\mathcal{S}=\left\{x_0,x_1,\ldots,x_{T-1}\right\}\subseteq\mathbb{Z}_q=\{0,1,\ldots,q-1\}$ with $$0\leq x_0<x_1<\ldots< x_{T-1}\leq q-1.$$ We derive from $\mathcal{S}$ three (finite) sequences. 1. For an…

We introduce a probability distribution Q on the group of permutations of the set Z of integers. Distribution Q is a natural extension of the Mallows distribution on the finite symmetric group. A one-sided infinite counterpart of Q,…

For a set of permutation patterns $\Pi$, let $F^\text{st}_n(\Pi,q)$ be the st-polynomial of permutations avoiding all patterns in $\Pi$. Suppose $312\in\Pi$. For a class of permutation statistics which includes inversion and descent…

For $0<q<1$, let $Maj$ be the distribution on the symmetric group $S_n$ such that a permutation $\pi \in S_n$ is selected with probability proportional to $q^{maj(\pi)}$. The distribution has connections to $q$-Plancherel measure. We…

An open conjecture in pattern avoidance theory is that the distribution of the major index among 321-avoiding permutations is distributed unimodally. We construct a formula for this distribution, and in the case of 2 descents prove…

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

We prove a conjecture of Haglund which can be seen as an extension of the equidistribution of the inversion number and the major index over permutations to ordered set partitions. Haglund's conjecture implicitly defines two statistics on…

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$

We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patterns. The Mallows distribution behaves like a $q$-analogue of…

Curious spectral properties of an ensemble of random unitary matrices appearing in the quantization of a map p -> p+alpha, q -> q+f(p+alpha) in [Giraud et al. nlin.CD/0403033] are investigated. When alpha=m/n with integer co-prime m,n and…

This paper serves as a bridge between quantum computing and analogical modeling (a general theory for predicting categories of behavior in varying contexts). Since its formulation in the early 1980s, analogical modeling has been…

We introduce new natural generalizations of the classical descent and inversion statistics for permutations, called width-$k$ descents and width-$k$ inversions. These variations induce generalizations of the excedance and major statistics,…

Let S_n denote the symmetric group of all permutations of the set {1, 2, ...,n} and let S = \cup_{n\ge0} S_n. If Pi is a set of permutations, then we let Av_n(Pi) be the set of permutations in S_n which avoid every permutation of Pi in the…

We show that the distribution of the major index over the set of involutions in S_n that avoid the pattern 321 is given by the q-analogue of the n-th central binomial coefficient. The proof consists of a composition of three non-trivial…

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…