Proved as a short deduction from classical results. The exact refinement comes from classical Kreweras/cycle-lemma enumeration, and its real-rooted binomial polynomial is already known from Bóna et al. and Wang–Zhang. The contribution recorded here is the positive scalar reduction for every Fuss parameter. The proof has been independently reviewed. Priority is qualified as described in NOVELTY.md; no claim of a new root-preserving method is made.
The theorem
For integers , let be the north-east lattice paths from to staying weakly above . For , define
Occurrences are contiguous factors in the step word. The conjecture attributed to P. Alexandersson (2023) is that every is real-rooted.
For we prove the exact formula
For ,
Consequently, the nonconstant polynomials have a simple zero at zero and exactly simple negative zeros. In particular, the conjecture holds for every parameter choice.
The empty-path case, if included, is . Values with outside are zero enumerators and need no nonzero-polynomial convention in the stated theorem.
1. Counting north runs by cyclic rotation
Put . Append one east step to an -Dyck path. Split the resulting word into its blocks
Use height . The block increments are
A block sequence is called good if its proper prefix sums are nonnegative. The appended path gives a good sequence. Conversely, the last increment of any good sequence must equal : its final sum is , its penultimate sum is nonnegative, and every increment is at least . Thus its last block has , and the penultimate sum is zero. Deleting that final east step gives an -Dyck path. Within a block the north steps only increase height, so checking block endpoints suffices.
For completeness, the required cycle lemma is elementary in this setting. For any integer sequence with total , set and . Among , let be the first occurrence of the minimum. The rotation beginning with has nonnegative proper prefix sums. Prefixes before wrapping are nonnegative by minimality. After wrapping, a proper prefix has value with , which is nonnegative since and the sums are integers. If , the prefix reaching the original final index has value because then .
Conversely, a good rotation beginning after index forces for , and for . Therefore is exactly that first minimum. There is one good rotation.
No orbit here can have fewer than distinct rotations. A period of length would express the total sum as times an integer, contradicting total sum . Hence a rotation-invariant collection of these sequences has exactly one good sequence per elements.
Every positive is one maximal north run, hence contributes one factor. Every contributes exactly one factor. Fix positive slots and slots of size at least two. For :
- choose the positive slots in ways;
- choose which receive excess above one in ways;
- distribute total excess positively among those slots in ways.
This set is rotation invariant. Dividing by proves (1). If , every positive slot equals one; there are tuples and no factors. Division by proves (2).
2. The real-zero argument
For , write , , and . Both are nonnegative integers. The polynomial in the sum in (1) equals
If , this is and the claim is immediate. Suppose . Define
Repeated Rolle's theorem shows that has precisely simple zeros in , a zero of multiplicity one at zero, and a zero of multiplicity at one. Here is the degree count that rules out missing or repeated interior zeros. After derivatives, , the endpoint multiplicities are and . Inductively, Rolle supplies distinct interior zeros, one in each gap created by the preceding derivative's interior zeros and the endpoints. These zeros and endpoint multiplicities total , the full degree. Thus there are no others, and the interior zeros are simple.
Leibniz's rule gives the polynomial identity
The quotient in the first line is a polynomial because of the endpoint multiplicities. It has exactly simple zeros in . The map is a bijection from onto . Equation (4), together with , therefore proves that every zero of is simple and negative. Its constant term is one, so multiplying by adds a distinct simple zero at zero. The prefactor in (1) is positive. This proves the theorem.
3. Relation to the ordinary-Dyck results
Equation (1), including the constant boundary (2), gives the stronger scalar identity
Thus, for fixed , the zeros do not depend on at all. The real-rootedness theorem for already appears in Bóna et al.; the consecutive and rowwise interlacing statements for that case are proved by Wang–Zhang. Formula (5) transfers those root statements whenever the same indices are used.
The proof above includes the elementary Rolle argument only to make the real-zero conclusion independently checkable. Its binomial polynomial is a classical Jacobi form, and its ordinary-Dyck instance is already known. The only target-specific step needed for the named Fuss conjecture is the uniform enumeration leading to (5). Classical refined Fuss–Narayana enumeration may already imply that step; the novelty audit must distinguish an unrecorded deduction from an explicit prior resolution.
Sources and scope
- P. Alexandersson's stated conjecture and explicit path convention: https://www.symmetricfunctions.com/realRootedOpenProblems.htm and https://www.symmetricfunctions.com/realRootedCatalan.htm .
- M. Bóna, S. Dimitrov, G. Labelle, Y. Li, J. Pappe, A. R. Vindas-Meléndez and Y. Zhuang, A Combinatorial Proof of a Symmetry for a Refinement of the Narayana Numbers, Electron. J. Combin. 32(2) (2025), P2.46, DOI https://doi.org/10.37236/12681 . The ordinary-Dyck enumeration is Theorem 2; its real-rootedness is Theorem 27.
- B. Wang and C. X. T. Zhang, Interlacing Property of a Family of Generating Polynomials over Dyck Paths, Electron. J. Combin. 31(1) (2024), P1.63, DOI https://doi.org/10.37236/12375 . Theorem 2 recalls ordinary-Dyck real-rootedness, and Theorems 8 and 11 prove the interlacing statements.
No numerical root check is used in the proof. The literal path enumerator, formula, root simplicity and conditional transfer of ordinary-case root relations are Lean-verified; see the Lean status.