Status: proved as a short deduction from classical results; priority qualified.
Lean status: verified. Conjectures.FussFinal proves real-rootedness of the literal sum over Fuss–Dyck words, its closed formula and scalar reduction, including the boundary. Conjectures.FussRoots proves the stated simple-negative-root count and proves that any ordinary-case root relation transfers to the Fuss case. The cited ordinary-case interlacing theorems are inputs to that transfer and are not re-proved in Lean. Strict standalone compilation, axiom audit and isolated kernel replay passed; the combined repository gate is pending.
For every and , the polynomial counting -Dyck paths with exactly factors , by the number of factors , is real-rooted. The Fuss parameter changes this polynomial only by a positive scalar.
The exact refinement is classical Kreweras/cycle-lemma enumeration. Its real-rooted binomial factor is already proved in the ordinary-Dyck work of Bóna et al. and Wang–Zhang. This note identifies their uniform scalar reduction for the conjecture still listed by Alexandersson and supplies a self-contained proof. It does not claim a new enumeration or root-preserving method.
Exact formula
Let the paths have north steps and east steps, staying weakly above . For ,
For the polynomial is the positive constant . Therefore
When , there is one simple zero at zero and simple negative zeros. The proof covers every parameter simultaneously. It also transfers the previously established root-order statements for the ordinary-Dyck family.
Proof and audit
PROOF.md gives the exact cyclic-block count and an elementary Rolle argument for the binomial factor. It includes the empty-path convention, constant boundary, orbit periodicity issue, endpoint multiplicities and degree count. An independent reviewer checked the full argument.
NOVELTY.md records the prior-work audit and classical attributions. No explicit earlier statement resolving this exact named Fuss conjecture was found in the inspected sources. Alexandersson–Leite's recent graph-peaks full text could not be retrieved, so an unconditional priority claim is not justified.
verify.py independently enumerates 10,188 paths across 18 small parameter pairs to check the source convention and coefficient formula. It does not approximate roots and is not a proof step. Run it with Python 3; it has no external dependencies.
Conjecture sources:
- https://www.symmetricfunctions.com/realRootedOpenProblems.htm
- https://www.symmetricfunctions.com/realRootedCatalan.htm
Coordination and review: issue #95.