3 problems

Let $\overline{I_n}$ be the burnt pancake stack whose pancakes are in increasing order by size, with every burnt side facing up, and let $g(n)$ be the minimum number of flips neede…

Let $R_k^B(n)$ denote the number of signed permutations of size $n$ whose burnt-pancake distance from the sorted stack is $k$. Summation identity conjecture. If $k,n\geq1$, then ……

Let $R_k^B(n)$ denote the number of signed permutations of size $n$ whose burnt-pancake distance from the sorted stack is $k$. Polynomial formulas conjecture. If $n\geq1$, then … ……