AFTD Auto-Formalizing Theoretical Domains

anti_ribbon_schur_polynomial

def

For a positive integer N : ℕ, a descent set S : Finset ℕ, and a bound m : ℕ, the anti-ribbon Schur polynomial anti_ribbon_schur_polynomial N S m is the Schur polynomial of the anti-ribbon diagram anti_ribbon_diagram N S in m variables.

Statement

noncomputable def anti_ribbon_schur_polynomial (N : ℕ) (S : Finset ℕ) (m : ℕ) : MvPolynomial ℕ ℤ
Defined in
arXiv:2611.07715, Definition 5.1
Verified
06 Nov 2026
Axioms
none listed
Built on 2
  • schur_polynomialFor a finite diagram D : Finset (ℕ × ℕ) and a positive integer m : ℕ, the Schur polynomial schur_polynomial D m in MvPolynomial ℕ ℤ is the…
  • anti_ribbon_diagramFor a positive integer N and a descent set S : Finset ℕ, the anti-ribbon diagram anti_ribbon_diagram N S is the finite set of cells in ℕ ×…

Read back from the Lean

anti_ribbon_schur_polynomial N S m defines a multivariate polynomial with integer coefficients in variables indexed by ℕ (MvPolynomial ℕ ℤ) for any natural numbers N and m and any finite set of natural numbers S. It is defined as schur_polynomial (anti_ribbon_diagram N S) m, which is the Schur polynomial associated with the anti-ribbon diagram parameterized by N and S, using semistandard Young tableaux with entries bounded by m.

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

/-- Anti-ribbon Schur polynomial associated with descent set S and size N in m variables. -/
noncomputable def anti_ribbon_schur_polynomial (N : ℕ) (S : Finset ℕ) (m : ℕ) : MvPolynomial ℕ ℤ := schur_polynomial (anti_ribbon_diagram N S) m
See it in the graphDiscuss this resultChallenge it