Name
Abstract | ||
|---|---|---|
Generalizing the pancake sorting problem, we consider a reachability problem which asks whether an arbitrary two dimensional array can be obtained from an initial array by prefix reversals. In the case of the pancake sorting problem, sorting is always possible, whereas, it is not clear whether a rearrangement of two dimensional arrays is always possible. We shall prove any array is reachable from the initial array by prefix reversals unless the numbers of both rows and columns are divisible by 4. Using group theory, we also give a necessary and sufficient condition that an array is reachable from the initial array in such a case. We also give upper bounds on the number of prefix reversals to rearrange. |
Year | Venue | Field |
|---|---|---|
2015 | RP | Row and column spaces,Combinatorics,Group theory,Generalization,Sorting,Prefix,Reachability problem,Mathematics,Pancake sorting |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
7 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akihiro Yamamura | 1 | 96 | 13.29 |