Zejun Huang, Chi-Kwong Li, Sharon H. Li, Nung-Sing Sze
Published 2013-03-15, updated 2015-06-05Version 3
We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, $\delta$, such that every permutation can be factored into no more than $\delta$ special transpositions. This study is related to sorting algorithms, Cayley graphs, and genomics.
Comments: 16 pages, a substantially revised version
A short note on the Stanley-Wilf Conjecture for permutations on multisets
Inversion polynomials for 321-avoiding permutations: addendum
The number of {1243, 2134}-avoiding permutations
![QR code for arXiv:1303.3776 [math.CO]](http://oss.arxitics.com/images/favicon.svg)