Related papers: On plane permutations

In this paper, we introduce plane permutations, i.e. pairs $\mathfrak{p}=(s,\pi)$ where $s$ is an $n$-cycle and $\pi$ is an arbitrary permutation, represented as a two-row array. Accordingly a plane permutation gives rise to three distinct…

Computing the reversal distances of signed permutations is an important topic in Bioinformatics. Recently, a new lower bound for the reversal distance was obtained via the plane permutation framework. This lower bound appears different from…

Let $k$ be a nonnegative integer, and let $\alpha$ and $\beta$ be two permutations of $n$ symbols. We say that $\alpha$ and $\beta$ $k$-commute if $H(\alpha\beta, \beta\alpha)=k$, where $H$ denotes the Hamming metric between permutations.…

A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…

In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…

We prove bijectively that the total number of cycles of all even permutations of $[n]=\{1,2,...,n\}$ and the total number of cycles of all odd permutations of $[n]$ differ by $(-1)^n(n-2)!$, which was stated as an open problem by Mikl\'{o}s…

We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…

In this paper, we first obtain some analogues of a formula of Zagier (1995) and Stanley (2011). For instance, we prove that the number of pairs of $n$-cycles whose product has $k$ cycles and has $m$ given elements contained in distinct…

The reconstruction problem for permutations on $n$ elements from their erroneous patterns which are distorted by transpositions is presented in this paper. It is shown that for any $n \geq 3$ an unknown permutation is uniquely…

Problem 8.1 in Astaiza et. al. asks about the relationship between the cycle decomposition of a permutation $\sigma$ and that of its symmetric tensor power $\sigma ^{\odot k}$. In this paper, we investigate this question and give formulas…

Let $\beta$ be any permutation on $n$ symbols and let $c(k, \beta)$ be the number of permutations that $k$-commute with $\beta$. The cycle type of a permutation $\beta$ is a vector $(c_1, \dots, c_n)$ such that $\beta$ has exactly $c_i$…

We show that the probability that two permutations of $n$ letters have the same number of cycles is \[\sim \frac{1}{2\sqrt{\pi\log{n}}}.\]

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

In this paper, we enumerate the pairs of permutations that are long cycles and whose product has a given cycle-type. Our main result is a simple relation concerning the desired numbers for a few related cycle-types. The relation refines a…

We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for the two types of objects as well as some new results. We also…

Universal cycle for $k$-permutations is a cyclic arrangement in which each $k$-permutation appears exactly once as $k$ consecutive elements. Enumeration problem of universal cycles for $k$-permutations is discussed and one new enumerating…

Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…

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…