paper

Fixed-Lowering -Triples for Laurent-Shift Operators: Exact Stencil Endpoints and Recurrence Locality

arXiv:2608.09962

Abstract

Let be the unit forward shift, and let be the algebra of finite Laurent-shift operators with polynomial coefficients over a characteristic-zero field . We classify all -triples in with fixed lowering operator . Writing and , every completion is uniquely determined by and , with We give an intrinsic recognition and reconstruction from and determine the exact extreme shifts of and . The associated monic eigenpolynomials form a -Appell sequence. Multiplication by has finite lower recurrence bandwidth exactly when ; in this case, the bandwidth equals the right endpoint of the Cartan stencil. Otherwise, and remain finite-order, while the degree recurrence has an infinite tail whose eventual signed coefficients form a polynomial recovering the lowest Laurent term of . Over , positive-measure orthogonality occurs exactly for translated monic Charlier systems.

20 pp. under submitted to the "Journal of Difference Equations and Applications"

Fixed-Lowering $\mathfrak{sl}_2$-Triples for Laurent-Shift Operators: Exact Stencil Endpoints and Recurrence Locality · wovepaper