Double lowering operators on polynomials

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Abstract: Recently Sarah Bockting-Conrad introduced the double lowering operator

p s i

for a tridiagonal pair. Motivated by

p s i

we consider the following problem about polynomials. Let

m a t h b b F

denote an algebraically closed field. Let

x

denote an indeterminate, and let

m a t h b b F l b r a c k x b r a c k

denote the algebra consisting of the polynomials in

x

that have all coefficients in

m a t h b b F

. Let

N

denote a positive integer or

i n f t y

. Let

l b r a c e a_{i} b r a c e_{i = 0}^{N - 1}

,

l b r a c e b_{i} b r a c e_{i = 0}^{N - 1}

denote scalars in

m a t h b b F

such that

s u m_{h = 0}^{i - 1} a_{h} o t = s u m_{h = 0}^{i - 1} b_{h}

for

1 l e q i l e q N

. For

0 l e q i l e q N

define polynomials

a u_{i}, e t a_{i} i n m a t h b b F l b r a c k x b r a c k

by

a u_{i} = p r o d_{h = 0}^{i - 1} (x - a_{h})

and

e t a_{i} = p r o d_{h = 0}^{i - 1} (x - b_{h})

. Let

V

denote the subspace of

m a t h b b F l b r a c k x b r a c k

spanned by

l b r a c e x^{i} b r a c e_{i = 0}^{N}

. An element

p s i i n o p e r a t o r n a m e E n d (V)

is called double lowering whenever

p s i a u_{i} i n m a t h b b F a u_{i - 1}

and

p s i e t a_{i} i n m a t h b b F e t a_{i - 1}

for

0 l e q i l e q N

, where

a u_{- 1} = 0

and

e t a_{- 1} = 0

. We give necessary and sufficient conditions on

l b r a c e a_{i} b r a c e_{i = 0}^{N - 1}

,

l b r a c e b_{i} b r a c e_{i = 0}^{N - 1}

for there to exist a nonzero double lowering map. There are four families of solutions, which we describe in detail.

Recommendations

Cites work

Cited in

(1)

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