Polynomial eigenfunctions and recurrences of fixed length

This paper solves the fixed-length recurrence problem posed by Horozov, Shapiro and Tater. For the rational Darboux transformations specified here, it also resolves the order and classification questions raised by their two conjectures. It classifies monic polynomial sequences whose members are eigenpolynomials of one fixed nonscalar differential operator of arbitrary finite order with polynomial coefficients and for which multiplication by the variable involves a fixed number of consecutive polynomials. Orthogonality is not assumed, and only sufficiently large degrees need be prescribed. If the lowest recurrence index is $n-m+1$, with $m\ge3$, the differential order equals $m$ times the degree of the eigenvalue as a polynomial in $n$. After translating the variable, every such sequence is a finite rational Darboux transform of an explicit family with differential order $m$ and eigenvalue $n$. Necessary and sufficient conditions on the factors determine all polynomial differential eigenoperators of the resulting family. For families that cannot be obtained by these transformations from families of smaller minimum differential order, the minimum differential and recurrence orders coincide. All such families are classified in minimum differential orders at least three, including additional families in composite orders.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16547
Primary Topic
Mathematical functions and polynomials
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Polynomial eigenfunctions and recurrences of fixed length

K. Castillo
arXiv (Cornell University)
Mathematical functions and polynomials
preprint

Polynomial eigenfunctions and recurrences of fixed length

K. Castillo
preprint en

Abstract

This paper solves the fixed-length recurrence problem posed by Horozov, Shapiro and Tater. For the rational Darboux transformations specified here, it also resolves the order and classification questions raised by their two conjectures. It classifies monic polynomial sequences whose members are eigenpolynomials of one fixed nonscalar differential operator of arbitrary finite order with polynomial coefficients and for which multiplication by the variable involves a fixed number of consecutive polynomials. Orthogonality is not assumed, and only sufficiently large degrees need be prescribed. If the lowest recurrence index is $n-m+1$, with $m\ge3$, the differential order equals $m$ times the degree of the eigenvalue as a polynomial in $n$. After translating the variable, every such sequence is a finite rational Darboux transform of an explicit family with differential order $m$ and eigenvalue $n$. Necessary and sufficient conditions on the factors determine all polynomial differential eigenoperators of the resulting family. For families that cannot be obtained by these transformations from families of smaller minimum differential order, the minimum differential and recurrence orders coincide. All such families are classified in minimum differential orders at least three, including additional families in composite orders.

arXiv (Cornell University)
Mathematical functions and polynomials
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon