Related papers: A note on a question due to A. Garsia

We prove a formula for the number of permutations in $S_n$ such that their first $n-k$ entries are increasing and their longest increasing subsequence has length $n-k$. This formula first appeared as a consequence of character polynomial…

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

Denote the symmetric group of degree $n$ by $S_n$. Let $\rho$ be an irreducible representation of $S_n$ over the field of complex numbers and $\sigma\in S_n$. In this paper, we describe the set of eigenvalues of $\rho(\sigma)$. Based on…

We consider the probability $p(S_n)$ that a pair of random permutations generates either the alternating group $A_n$ or the symmetric group $S_n$. Dixon (1969) proved that $p(S_n)$ approaches $1$ as $n\to\infty$ and conjectured that…

Recently in graph theory several authors have studied the spectrum of the Cayley graph of the symmetric group S_n generated by the transpositions (1, i) for 2 <= i <= n. Several conjectures were made and partial results were obtained. The…

We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…

We prove a recent conjecture of Blanco and Petersen (arXiv:1206.0803v2) about an expansion formula for inversions and excedances in the symmetric group.

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

We describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that…

The object of this short note is to prove a theorem and present a conjecture for the number of even entries in the character table of the symmetric group.

We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…

Given permutations $\pi \in S_n$ and $\sigma \in S_k$, let $N_\sigma(\pi)$ denote the number of occurrences of $\sigma$ in $\pi$. While pattern avoidance and the distribution of pattern occurrences in permutations have been extensively…

In this paper, we present an algorithm that enumerates a certain class of signed permutations, referred to as grid signed permutation classes. In the case of permutations, the corresponding grid classes are of interest because they are…

A permutation is called {\it {block-wise simple}} if it contains no interval of the form $p_1\oplus p_2$ or $p_1 \ominus p_2$. We present this new set of permutations and explore some of its combinatorial properties. We present a generating…

The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].

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,…

The symmetric group acts on polynomial differential forms on $\mathbb{R}^{n}$ through its action by permuting the coordinates. In this paper the $S_{n}% $-invariants are shown to be freely generated by the elementary symmetric polynomials…

The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…

We prove several general formulas for the distributions of various permutation statistics over any set of permutations whose quasisymmetric generating function is a symmetric function. Our formulas involve certain kinds of plethystic…