New characterizations of Leonard pairs
SUNY New Paltz
Minisymposium: ASSOCIATION SCHEMES
Content: Roughly speaking, a Leonard pair can be thought of as an algebraic generalization of a $Q$-polynomial distance-regular graph. Because of this connection, there are sequences of parameters associated with Leonard pairs that generalize the intersection numbers of a distance-regular graph. In this talk, we will discuss two new characterizations of Leonard pairs using these parameter sequences.