A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Some relations on prefix reversal generators of the symmetric and hyperoctahedral group
[article]
2018
arXiv
pre-print
The pancake problem is concerned with sorting a permutation (a stack of pancakes of different diameter) using only prefix reversals (spatula flips). Although the problem description belies simplicity, an exact formula for the maximum number of flips needed to sort n pancakes has been elusive. In this paper we present a different approach to the pancake problem, as a word problem on the symmetric group and hyperoctahedral group. Pancake flips are considered as generators and we study the
arXiv:1803.01760v2
fatcat:7rkvf6ty3rdr7a3immx2vyu4hu