Double lowering operators on polynomials

From MaRDI portal



Abstract: Recently Sarah Bockting-Conrad introduced the double lowering operator psi for a tridiagonal pair. Motivated by psi we consider the following problem about polynomials. Let mathbbF denote an algebraically closed field. Let x denote an indeterminate, and let mathbbFlbrackxbrack denote the algebra consisting of the polynomials in x that have all coefficients in mathbbF. Let N denote a positive integer or infty. Let lbraceaibracei=0N−1, lbracebibracei=0N−1 denote scalars in mathbbF such that sumh=0i−1ahot=sumh=0i−1bh for 1leqileqN. For 0leqileqN define polynomials aui,etaiinmathbbFlbrackxbrack by aui=prodh=0i−1(x−ah) and etai=prodh=0i−1(x−bh). Let V denote the subspace of mathbbFlbrackxbrack spanned by lbracexibracei=0N. An element psiinoperatornameEnd(V) is called double lowering whenever psiauiinmathbbFaui−1 and psietaiinmathbbFetai−1 for 0leqileqN, where au−1=0 and eta−1=0. We give necessary and sufficient conditions on lbraceaibracei=0N−1, lbracebibracei=0N−1 for there to exist a nonzero double lowering map. There are four families of solutions, which we describe in detail.


The data is called double lowering whenever the double lowering space \(\neq 0.\) The problem is to find necessary and sufficient conditions for the data to be double lowering. In the main theorem the author find them. A very nicely organized paper with a lot of interesting results.



Cites work









This page was built for publication: Double lowering operators on polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2023435)