Sorting a Permutation by block moves
| dc.creator | Bona, Miklos | |
| dc.creator | Flynn, Ryan | |
| dc.date | 2008-06-17 | |
| dc.date.accessioned | 2026-07-07T09:45:03Z | |
| dc.date.available | 2026-07-07T09:45:03Z | |
| dc.description | We prove a lower and an upper bound on the number of block moves necessary to sort a permutation. We put our results in contrast with existing results on sorting by block transpositions, and raise some open questions. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/0806.2787 | |
| dc.identifier | http://arxiv.org/abs/0806.2787 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/163080 | |
| dc.subject | Combinatorics | |
| dc.subject | 68R05 | |
| dc.title | Sorting a Permutation by block moves | |
| dc.type | text |