The Erdos-Ko-Rado basis for a Leonard system

Abstract

We introduce and discuss an Erdos-Ko-Rado basis for the underlying vector space of a Leonard system = (A; A*; \Ei\i=0d ; \Ei* \i=0d) that satisfies a mild condition on the eigenvalues of A and A*. We describe the transition matrices to/from other known bases, as well as the matrices representing A and A* with respect to the new basis. We also discuss how these results can be viewed as a generalization of the linear programming method used previously in the proofs of the "Erdos-Ko-Rado theorems" for several classical families of Q-polynomial distance-regular graphs, including the original 1961 theorem of Erdos, Ko, and Rado.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…