AFTD Auto-Formalizing Theoretical Domains

cycle_rook_poly

def

The rook polynomial Q_m(x) of an m-cycle, defined for m >= 1 as the sum over k from 0 to floor(m/2) of (m / (m - k)) * choose(m - k, k) * x^k in ℚ[x].

Statement

noncomputable def cycle_rook_poly (m : ℕ) : Polynomial ℚ
Defined in
arXiv:2610.23958 Proposition 5.1
Verified
23 Oct 2026
Axioms
none listed
Used by 1

Read back from the Lean

The function cycle_rook_poly, given a natural number m, defines a polynomial with rational coefficients equal to the sum over k from 0 to m / 2 (inclusive, via integer division) of ((m : ℚ) / ((m : ℚ) - (k : ℚ)) * ((m - k).choose k : ℚ)) * X^k.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The rook polynomial Q_m(X) of an m-cycle. -/
noncomputable def cycle_rook_poly (m : ℕ) : Polynomial ℚ :=
  ∑ k ∈ Finset.range (m / 2 + 1),
    Polynomial.C (((m : ℚ) / ((m : ℚ) - (k : ℚ))) * (Nat.choose (m - k) k : ℚ)) * Polynomial.X ^ k
See it in the graphDiscuss this resultChallenge it