English

Double Lowering Operators on Polynomial

Quantum Algebra 2021-01-29 v2 Combinatorics

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 F\mathbb F denote an algebraically closed field. Let xx denote an indeterminate, and let F[x]\mathbb F\lbrack x \rbrack denote the algebra consisting of the polynomials in xx that have all coefficients in F\mathbb F. Let NN denote a positive integer or \infty. Let {ai}i=0N1\lbrace a_i\rbrace_{i=0}^{N-1}, {bi}i=0N1\lbrace b_i\rbrace_{i=0}^{N-1} denote scalars in F\mathbb F such that h=0i1ahh=0i1bh\sum_{h=0}^{i-1} a_h \not= \sum_{h=0}^{i-1} b_h for 1iN1 \leq i \leq N. For 0iN0 \leq i \leq N define polynomials τi,ηiF[x]\tau_i, \eta_i \in \mathbb F\lbrack x \rbrack by τi=h=0i1(xah)\tau_i = \prod_{h=0}^{i-1} (x-a_h) and ηi=h=0i1(xbh)\eta_i = \prod_{h=0}^{i-1} (x-b_h). Let VV denote the subspace of F[x]\mathbb F\lbrack x \rbrack spanned by {xi}i=0N\lbrace x^i\rbrace_{i=0}^N. An element ψEnd(V)\psi \in \operatorname{End}(V) is called double lowering whenever ψτiFτi1\psi \tau_i \in \mathbb F \tau_{i-1} and ψηiFηi1\psi \eta_i \in \mathbb F \eta_{i-1} for 0iN0 \leq i \leq N, where τ1=0\tau_{-1}=0 and η1=0\eta_{-1}=0. We give necessary and sufficient conditions on {ai}i=0N1\lbrace a_i\rbrace_{i=0}^{N-1}, {bi}i=0N1\lbrace b_i\rbrace_{i=0}^{N-1} for there to exist a nonzero double lowering map. There are four families of solutions, which we describe in detail.

Keywords

Cite

@article{arxiv.2003.09666,
  title  = {Double Lowering Operators on Polynomial},
  author = {Paul Terwilliger},
  journal= {arXiv preprint arXiv:2003.09666},
  year   = {2021}
}
R2 v1 2026-06-23T14:22:31.539Z