Search arXivSearch

arXiv · 2608.09962

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

Abstract

Let $S$ be the unit forward shift, and let $$ \mathcal{A} = \mathbb{K}[x]\langle S,S^{-1}\rangle \big/ \bigl(Sx-(x+1)S\bigr) $$ be the algebra of finite Laurent-shift operators with polynomial coefficients over a characteristic-zero field $\mathbb{K}$. We classify all $\mathfrak{sl}_2$-triples in $\mathcal{A}$ with fixed lowering operator $F=1-S$. Writing $D=S-1$ and $X=xS^{-1}$, every completion is uniquely determined by $λ\in\mathbb{K}$ and $g\in\mathbb{K}[S,S^{-1}]$, with $$ H=2(X+g)D-λ,\qquad E=(X+g)^2D-λ(X+g). $$ We give an intrinsic recognition and reconstruction from $H$ and determine the exact extreme shifts of $H$ and $E$. The associated monic eigenpolynomials form a $Δ$-Appell sequence. Multiplication by $x$ has finite lower recurrence bandwidth exactly when $g\in S^{-1}\mathbb{K}[S]$; in this case, the bandwidth equals the right endpoint of the Cartan stencil. Otherwise, $H$ and $E$ remain finite-order, while the degree recurrence has an infinite tail whose eventual signed coefficients form a polynomial recovering the lowest Laurent term of $g$. Over $\mathbb{R}$, positive-measure orthogonality occurs exactly for translated monic Charlier systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kyle Singh. 2026-07-25. Fixed-Lowering $\mathfrak{sl}_2$-Triples for Laurent-Shift Operators: Exact Stencil Endpoints and Recurrence Locality. https://arxiv.org/abs/2608.09962

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA