Concrete Billiard Arrays of Polynomial Type and Leonard Systems
Abstract
Let d denote a nonnegative integer and let F denote a field. Let V denote a d+1 dimensional vector space over F. Given an ordering \θi\i=0d of the eigenvalues of a multiplicity-free linear map A: V V, we construct a Concrete Billiard Array L with the property that for 0 ≤ i ≤ d, the i th vector on its bottom border is in the θi-eigenspace of A. The Concrete Billiard Array L is said to have polynomial type. We also show the following. Assume that there exists a Leonard system =(A;\Ei\i=0d;A*;\Ei*\i=0d) where Ei is the primitive idempotent of A corresponding to θi for 0 ≤ i ≤ d. Then, we show that after a suitable normalization, the left (resp. right) boundary of L corresponds to the -split (resp. -split) decomposition of V.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.