Concrete Billiard Arrays of Polynomial Type and Leonard Systems
Rings and Algebras
2025-02-14 v2
Abstract
Let denote a nonnegative integer and let denote a field. Let denote a dimensional vector space over . Given an ordering of the eigenvalues of a multiplicity-free linear map , we construct a Concrete Billiard Array with the property that for , the vector on its bottom border is in the -eigenspace of . The Concrete Billiard Array is said to have polynomial type. We also show the following. Assume that there exists a Leonard system where is the primitive idempotent of corresponding to for . Then, we show that after a suitable normalization, the left (resp. right) boundary of corresponds to the -split (resp. -split) decomposition of .
Keywords
Cite
@article{arxiv.2410.07178,
title = {Concrete Billiard Arrays of Polynomial Type and Leonard Systems},
author = {Jimmy Vineyard},
journal= {arXiv preprint arXiv:2410.07178},
year = {2025}
}
Comments
14 pages