Related papers: Metrics on permutations with the same peak set

Let $n \ge 3$ be an integer. Let $P_n = \{1, 2, 3, ..., n-1, n \}$ and let $S_n$ be the symmetric group of permutations on $P_n$. Motivated by the theory of discrete dynamical systems on the interval, we associate each permutation $\si_n$…

For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…

Given sets X and Y of positive integers and a permutation sigma = sigma_1, sigma_2, ..., sigma_n in S_n, an X,Y-descent of sigma is a descent pair sigma_i > sigma_{i+1} whose "top" sigma_i is in X and whose "bottom" sigma_{i+1} is in Y. We…

The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…

Let G be a finite group. Let pi be a permutation from S{n}. We study the distribution of probabilities of equality a{1} a{2} ...a{n-1}a{n}=a{pi{1}}^{epsilon{1}} a{pi_{2}}^{epsilon{2}}...a{pi{n-1}}^{epsilon_{n-1}} a_{pi_{n}}^{epsilon{n}},…

For a permuton $\mu$ let $H_n(\mu)$ denote the Shannon entropy of the sampling distribution of $\mu$ on $n$ points. We investigate the asymptotic growth of $H_n(\mu)$ for a wide class of permutons. We prove that if $\mu$ has a non-vanishing…

In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation is proposed. In the rank modulation…

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…

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…

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…

Let $\alpha$ and $\beta$ be uniformly random permutations of orders $2$ and $3$, respectively, in $S_{N}$, and consider, say, the permutation $\alpha\beta\alpha\beta^{-1}$. How many fixed points does this random permutation have on average?…

Given a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$, we say an index $i$ is a peak if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $P(\pi)$ denote the set of peaks of $\pi$. Given any set $S$ of positive integers, define…

A totally symmetric set is a subset of a group such that every permutation of the subset can be realized by conjugation in the group. The (non-)existence of large totally symmetric sets obstruct homomorphisms, so bounds on the sizes of…

Let $g$, $h$ be a random pair of generators of $G=Sym(n)$ or $G=Alt(n)$. We show that, with probability tending to $1$ as $n\to \infty$, (a) the diameter of $G$ with respect to $S = \{g,h,g^{-1},h^{-1}\}$ is at most $O(n^2 (\log n)^c)$, and…

Let $S_n$ denote the symmetric group. For any $\sigma \in S_n$, we let $\mathrm{des}(\sigma)$ denote the number of descents of $\sigma$, $\mathrm{inv}(\sigma)$ denote the number of inversions of $\sigma$, and $\mathrm{LRmin}(\sigma)$ denote…

Consider $N\times N$ Hermitian or symmetric random matrices $H$ where the distribution of the $(i,j)$ matrix element is given by a probability measure $\nu_{ij}$ with a subexponential decay. Let $\sigma_{ij}^2$ be the variance for the…

Motivated by the rank modulation scheme, a recent work by Sala and Dolecek explored the study of constraint codes for permutations. The constraint studied by them is inherited by the inter-cell interference phenomenon in flash memories,…

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for…

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…

We study a model of spatial random permutations over a discrete set of points. Formally, a permutation $\sigma$ is sampled proportionally to the weight $\exp\{-\alpha \sum_x V(\sigma(x)-x)\},$ where $\alpha>0$ is the temperature and $V$ is…