Polynomial formulas for signed pancake stacks requiring five to nine flips
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.