Factorization of permutations
Combinatorics
2015-06-08 v3
Abstract
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, , such that every permutation can be factored into no more than special transpositions. This study is related to sorting algorithms, Cayley graphs, and genomics.
Keywords
Cite
@article{arxiv.1303.3776,
title = {Factorization of permutations},
author = {Zejun Huang and Chi-Kwong Li and Sharon H. Li and Nung-Sing Sze},
journal= {arXiv preprint arXiv:1303.3776},
year = {2015}
}
Comments
16 pages, a substantially revised version