排列排序所需的平均块交换数与Stanley的一个新结果

The Average Number of Block Interchanges Needed to Sort A Permutation and a recent result of Stanley

Miklos Bona, Ryan Flynn

备注：: 8 pages, 4 figures

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

摘要英文摘要相关论文

摘要：

我们使用一个有趣的结果，概率味的产品组成的两个排列的一个周期，每个找到一个明确的公式，平均数的块交换需要排序的排列长度$n$。

英文摘要：

We use an interesting result of probabilistic flavor concerning the product of two permutations consisting of one cycle each to find an explicit formula for the average number of block interchanges needed to sort a permutation of length $n$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

摘要英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The Sortability of Graphs and Matrices under Context Directed Swaps

The study of sorting permutations by block interchanges has recently been stimulated by a phenomenon observed in the genome maintenance of certain ciliate species. The result was the identification of a block interchange operation that applies only under certain constraints. Interestingly, this constrained block interchange operation can be generalized naturally to simple graphs and to an operation on square matrices. This more general context provides numerous techniques applicable to the original context. In this paper we consider the more general context, and obtain an enumeration, in close…

2019-04-05math.CO

Plane permutations and applications to a result of Zagier-Stanley and distances of permutations

In this paper, we introduce plane permutations, i.e. pairs $\mathfrak{p}=(s,π)$ where $s$ is an $n$-cycle and $π$ is an arbitrary permutation, represented as a two-row array. Accordingly a plane permutation gives rise to three distinct permutations: the permutation induced by the upper horizontal ($s$), the vertical $π$) and the diagonal ($D_{\mathfrak{p}}$) of the array. The latter can also be viewed as the three permutations of a hypermap. In particular, a map corresponds to a plane permutation, in which the diagonal is a fixed point-free involution. We study the transposition action on plan…

2016-06-23math.CO

Classifying Permutations under Context-Directed Swaps and the \textbf{cds} game

A special sorting operation called Context Directed Swap, and denoted \textbf{cds}, performs certain types of block interchanges on permutations. When a permutation is sortable by \textbf{cds}, then \textbf{cds} sorts it using the fewest possible block interchanges of any kind. This work introduces a classification of permutations based on their number of \textbf{cds}-eligible contexts. In prior work an object called the strategic pile of a permutation was discovered and shown to provide an efficient measure of the non-\textbf{cds}-sortability of a permutation. Focusing on the classification o…

2020-11-02math.CO

A simple framework on sorting permutations

In this paper we present a simple framework to study various distance problems of permutations, including the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. These problems are very important in the study of the evolution of genomes. We give a general formulation for lower bounds of the transposition and block-interchange distance from which the existing lower bounds obtained by Bafna and Pevzner, and Christie can be easily derived. As to the reversal distance of signed permutations, we translate it into a block-interchange …

2015-03-16cs.ITmath.COmath.IT

An Upper Bound on the Number of Circular Transpositions to Sort a Permutation

We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n-1)/2$ adjacent transpositions. We show that, if we allow all adjacent transpositions, as well as the transposition that interchanges the element in position 1 with the element in the last position, then the number of transpositions needed is at most $n^2/4$. This answers an open question posed by Feng, Chitturi and Sudborough (2010).

2014-02-20cs.DMmath.CO

On plane permutations

In this paper we generalize permutations to plane permutations. We employ this framework to derive a combinatorial proof of a result of Zagier and Stanley, that enumerates the number of $n$-cycles $ω$, for which $ω(12\cdots n)$ has exactly $k$ cycles. This quantity is $0$, if $n-k$ is odd and $\frac{2C(n+1,k)}{n(n+1)}$, otherwise, where $C(n,k)$ is the unsigned Stirling number of the first kind. The proof is facilitated by a natural transposition action on plane permutations which gives rise to various recurrences. Furthermore we study several distance problems of permutations. It turns out th…

2015-03-16math.CO