Polynomial formulas for signed pancake stacks requiring five to nine flips
Let denote the number of signed permutations of size whose burnt-pancake distance from the sorted stack is . Polynomial formulas conjecture. If , then
and
These formulas were obtained by polynomial fitting and also explain the zero entries in the cited data table; the source provides no proof or resolution, so the conjecture remains open.
References
- Saúl A. Blanco, Charles Buehrle and Akshay Patidar, “On the number of pancake stacks requiring four flips to be sorted”, arXiv:1902.04055 (2019).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.