A partial dictionary between universal central extensions and orthogonal polynomials in the superelliptic Krichever--Novikov setting

Abstract

Let m ≥ 2, let P(x) ∈ C[x] have simple roots, and let A = C[x 1,\,u um = P(x)] be the coordinate ring of the associated superelliptic curve. The derivation algebra Der(A) and the current algebra g A (for g a simple Lie algebra) each admit a universal central extension whose center is multi-dimensional and carries linear algebraic relations among its basis elements. We establish a systematic dictionary between these relations and families of orthogonal polynomials in the parameter a encoding the branch locus of P. The dictionary has three canonical entries: (1)~the basis reduction relations in the center of Der(A) are exactly the three-term recurrence of an orthogonal polynomial family; (2)~the generating function of the center satisfies the Sturm--Liouville ODE of that family; (3)~the mixed-sector 2-cocycle equals the Legendre antiderivative (Pn-1(a)-Pn+1(a))/(2n+1) in the quadratic case. We prove the dictionary completely for P(x)=x2-2ax+1 (Legendre polynomials) and for the quartic palindromic case P(x)=x4-2ax2+1. In the quadratic case, palindromic symmetry forces the recurrence to be the Legendre three-term recurrence; in the quartic case, the odd sector is Legendre and the even sector satisfies a two-component recurrence with palindromic coefficients. We conjecture this pattern -- palindromic P forcing symmetric recurrence coefficients -- holds in all even degrees. The same dictionary governs the K\"ahler side 1A/dA: all sectors reduce to the sector-1 family at a rescaled parameter, and the recurrence and ODE entries are canonical while the mixed-cocycle entry is partially choice-dependent.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…