Double Lowering Operators on Polynomial
Abstract
Recently Sarah Bockting-Conrad introduced the double lowering operator for a tridiagonal pair. Motivated by we consider the following problem about polynomials. Let F denote an algebraically closed field. Let x denote an indeterminate, and let F x denote the algebra consisting of the polynomials in x that have all coefficients in F. Let N denote a positive integer or ∞. Let aii=0N-1, bii=0N-1 denote scalars in F such that Σh=0i-1 ah = Σh=0i-1 bh for 1 ≤ i ≤ N. For 0 ≤ i ≤ N define polynomials τi, ηi ∈ F x by τi = Πh=0i-1 (x-ah) and ηi = Πh=0i-1 (x-bh). Let V denote the subspace of F x spanned by xii=0N. An element ∈ End(V) is called double lowering whenever τi ∈ F τi-1 and ηi ∈ F ηi-1 for 0 ≤ i ≤ N, where τ-1=0 and η-1=0. We give necessary and sufficient conditions on aii=0N-1, bii=0N-1 for there to exist a nonzero double lowering map. There are four families of solutions, which we describe in detail.