combinatorics / Enumerative combinatorics

Spahn and Zeilberger's Third Challenge: Holonomicity of the Restricted Permutation Counts

Spahn and Zeilberger's third challenge asks whether the restricted permutation counts $a_{r,s}$ and $b_{r,s}$ are holonomic for all $r, s > 1$. Answered affirmatively.

15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsAug 11, 2026Significance 15/100Registry: unreviewed

Spahn and Zeilberger's Third Challenge: Holonomicity of the Restricted Permutation Counts

Prior state unknownproved

Spahn and Zeilberger's third challenge asks whether the restricted permutation counts $a_{r,s}$ and $b_{r,s}$ are holonomic for all $r, s > 1$. Answered affirmatively.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Spahn and Zeilberger's third challenge asks whether the restricted permutation counts $a_{r,s}$ and $b_{r,s}$ are holonomic for all $r, s > 1$. Answered affirmatively.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.