Related papers: Metrics on permutations with the same descent set

We show that the symmetry groups of the cut cone Cut(n) and the metric cone Met(n) both consist of the isometries induced by the permutations on {1,...,n}; that is, Is(Cut(n))=Is(Met(n))=Sym(n) for n>4. For n=4 we have…

We show that any smooth permutation $\sigma\in S_n$ is characterized by the set ${\mathbf{C}}(\sigma)$ of transpositions and $3$-cycles in the Bruhat interval $(S_n)_{\leq\sigma}$, and that $\sigma$ is the product (in a certain order) of…

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

In [S. Kitaev and J. Remmel: Classifying descents according to parity] the authors refine the well-known permutation statistic "descent" by fixing parity of (exactly) one of the descent's numbers. In this paper, we generalize the results of…

We define symmetry classes and commutation symmetries in the Hilbert space H of the 1D spin-1/2 Heisenberg magnetic ring with N sites and investigate them by means of tools from the representation theory of symmetric groups S_N such as…

We consider a few special cases of the more general question: How many permutations $\pi\in\mathcal{S}_n$ have the property that $\pi^2$ has $j$ descents for some $j$? In this paper, we first enumerate Grassmannian permutations $\pi$ by the…

Let $s$ denote West's stack-sorting map. A permutation is called $t-\textit{sorted}$ if it is of the form $s^t(\mu)$ for some permutation $\mu$. We prove that the maximum number of descents that a $t$-sorted permutation of length $n$ can…

Understanding the metric structure of permutation families is fundamental to combinatorics and has applications in social choice theory, bioinformatics, and coding theory. We study permutation families defined by restriction…

The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…

This note will give an enumeration of $n$-cycles in the symmetric group ${\mathcal S}_n$ by their degree (also known as their cyclic descent number) and studies similar counting problems for the conjugacy classes of $n$-cycles under the…

Let $n$ be a positive integer and let $[n]=\{1,2,\ldots,n\}$. Let $\Gamma_n$ denote the group of permutations on $[n]$ whose restrictions to maximal proper subsets of $[n]$ are even, let $\Sigma_n$ denote the monoid of transformations on…

A permutation on an alphabet $ \Sigma $, is a sequence where every element in $ \Sigma $ occurs precisely once. Given a permutation $ \pi $= ($\pi_{1} $, $ \pi_{2} $, $ \pi_{3} $,....., $ \pi_{n} $) over the alphabet $ \Sigma $ =$\{ $0, 1,…

The concept of median/consensus has been widely investigated in order to provide a statistical summary of ranking data, i.e. realizations of a random permutation $\Sigma$ of a finite set, $\{1,\; \ldots,\; n\}$ with $n\geq 1$ say. As it…

Let (E,D,P) be a flat vector bundle with a parabolic structure over a punctured Riemann surface, (M,g). We consider a deformation of the harmonic metric equation which we call the Poisson metric equation. This equation arises naturally as…

Let the term $k$-representation refer to the permutation representations of the symmetric group $\mathfrak{S}_n$ on $k$-tuples and $k$-subsets as well as the $S^{(n-k,1^k)}$ irreducible representation of $\mathfrak{S}_n$. Endow…

Let $\sigma=(\sigma_1,..., \sigma_N)$, where $\sigma_i =\pm 1$, and let $C(\sigma)$ denote the number of permutations $\pi$ of $1,2,..., N+1,$ whose up-down signature $\mathrm{sign}(\pi(i+1)-\pi(i))=\sigma_i$, for $i=1,...,N$. We prove that…

Here we give a combinatorial interpretation of Solomon's rule for multiplication in the descent algebra of Weyl groups of type $D$, $\Sigma D_n$. From here we show that $\Sigma D_n$ is a homomorphic image of the descent algebra of the…

We say a permutation $\pi=\pi_1\pi_2\cdots\pi_n$ in the symmetric group $\mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1}<\pi_i>\pi_{i+1}$ and we let $P(\pi)=\{i \in \{1, 2, \ldots, n\} \, \vert \, \mbox{$i$ is a peak of $\pi$}\}$.…

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

Given a subset $S\subseteq\mathbb{P}$, let $\Pa(S;n)$ be the number of permutations in the symmetric group of ${1,2,...,n}$ that have peak set $S$. We prove a recent conjecture due to Billey, Burdzy and Sagan, which determines the sets that…