ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

RkB(n)=∑j=1k(∑i=0k−j(−1)i(i+j−1i)(ni+j))RkB(j).R_k^B(n)=\sum_{j=1}^k\left(\sum_{i=0}^{k-j}(-1)^i\binom{i+j-1}{i}\binom{n}{i+j}\right)R_k^B(j).

The identity is observed in the source and is motivated by the assertion that the functions RkB(n)R_k^B(n) are integer-valued polynomials together with the Gregory–Newton interpolation formula. No proof or resolution is supplied, so it 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.