Tridiagonal pairs, alternating elements, and distance-regular graphs
Paul Terwilliger

TL;DR
This paper explores the structure and actions of alternating elements within the positive part of a quantum algebra, relating them to tridiagonal pairs and distance-regular graphs, revealing their diagonal and bidiagonal behaviors.
Contribution
It characterizes how alternating elements act on decompositions of a vector space associated with a $q$-Serre type tridiagonal pair, connecting algebraic and combinatorial structures.
Findings
Alternating elements act as diagonal or bidiagonal on decompositions.
Special cases include eigenspaces of dimension one.
Connections to distance-regular graphs with classical parameters.
Abstract
The positive part of has a presentation with two generators , and two relations called the -Serre relations. The algebra contains some elements, said to be alternating. There are four kinds of alternating elements, denoted , , , . The alternating elements of each kind mutually commute. A tridiagonal pair is an ordered pair of diagonalizable linear maps on a nonzero, finite-dimensional vector space , that each act in a (block) tridiagonal fashion on the eigenspaces of the other one. Let , denote a tridiagonal pair on . Associated with this pair are six well-known direct sum decompositions of ; these are the eigenspace decompositions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Advanced Topics in Algebra · graph theory and CDMA systems
