Abstract
All right resurved. The problem of factoring a permutation as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances, is considered. In particular, the minimum number, δ, such that every permutation can be factored into no more than δ special transpositions is investigated. This study is related to sorting algorithms, Cayley graphs, and genomics.
Original language | English |
---|---|
Article number | 20 |
Pages (from-to) | 286-303 |
Number of pages | 18 |
Journal | Electronic Journal of Linear Algebra |
Volume | 30 |
Publication status | Published - 1 Jun 2015 |
Keywords
- Bubble sort
- Cayley graph
- Genomics
- Permutation
- Symmetric group
ASJC Scopus subject areas
- Algebra and Number Theory