Abstract:Let F denote a field and let V denote a vector space over F with finite positive dimension. We consider a pair of linear transformations A : V → V and A * : V → V that satisfy the following conditions: (i) each of A, A * is diagonalizable; (ii) there exists an orderingWe call such a pair a tridiagonal pair on V . It is known that d = δ, and forDenote this common dimension by ρ i and call A, A * sharp whenever ρ 0 = 1. Let T denote the F-subalgebra of End F (V ) generated by A, A * . We show: (i) the center Z(T… Show more
“…By [71,Theorem 4.6], the elements A, A * act on {U i } d i=0 as follows: [74,97,98,106,108,112,113,140,142,157]. Some miscellaneous results about tridiagonal pairs and systems can be found in [1,4,28,85,87].…”
There is a concept in linear algebra called a tridiagonal pair. The concept was motivated by the theory of $Q$-polynomial distance-regular graphs. We give a tutorial introduction to tridiagonal pairs, working with a special case as a concrete example. The special case is called totally bipartite, or totally bipartite (TB). Starting from first principles, we give an elementary but comprehensive account of TB tridiagonal pairs. The following topics are discussed: (i) the notion of a TB tridiagonal system; (ii) the eigenvalue array; (iii) the standard basis and matrix representations; (iv) the intersection numbers; (v) the Askey--Wilson relations; (vi) a recurrence involving the eigenvalue array; (vii) the classification of TB tridiagonal systems; (viii) self-dual TB tridiagonal pairs and systems; (ix) the $\mathbb{Z}_3$-symmetric Askey--Wilson relations; (x) some automorphisms and antiautomorphisms associated with a TB tridiagonal pair; and (xi) an action of the modular group ${\rm PSL}_2(\mathbb{Z})$ associated with a TB tridiagonal pair.
“…By [71,Theorem 4.6], the elements A, A * act on {U i } d i=0 as follows: [74,97,98,106,108,112,113,140,142,157]. Some miscellaneous results about tridiagonal pairs and systems can be found in [1,4,28,85,87].…”
There is a concept in linear algebra called a tridiagonal pair. The concept was motivated by the theory of $Q$-polynomial distance-regular graphs. We give a tutorial introduction to tridiagonal pairs, working with a special case as a concrete example. The special case is called totally bipartite, or totally bipartite (TB). Starting from first principles, we give an elementary but comprehensive account of TB tridiagonal pairs. The following topics are discussed: (i) the notion of a TB tridiagonal system; (ii) the eigenvalue array; (iii) the standard basis and matrix representations; (iv) the intersection numbers; (v) the Askey--Wilson relations; (vi) a recurrence involving the eigenvalue array; (vii) the classification of TB tridiagonal systems; (viii) self-dual TB tridiagonal pairs and systems; (ix) the $\mathbb{Z}_3$-symmetric Askey--Wilson relations; (x) some automorphisms and antiautomorphisms associated with a TB tridiagonal pair; and (xi) an action of the modular group ${\rm PSL}_2(\mathbb{Z})$ associated with a TB tridiagonal pair.
“…By [59,Theorem 1.3] we have ρ i ≤ ρ 0 d i for 0 ≤ i ≤ d. We call the sequence {ρ i } d i=0 the shape of A, A * . See [28,38,46,47,55,59] for results on the shape. The TD pair A, A * is called sharp whenever ρ 0 = 1.…”
Section: Tridiagonal Pairsmentioning
confidence: 99%
“…By [57,Theorem 1.3], if F is algebraically closed then A, A * is sharp. In any case A, A * can be "sharpened" by replacing F with a certain field extension K of F that has index [K : F] = ρ 0 [38,Theorem 4.12]. Suppose that A, A * is sharp.…”
Section: Tridiagonal Pairsmentioning
confidence: 99%
“…Define an F-algebra homomorphism σ : P → P that sends x 0 → 1 − d i=0 x i and fixes x j for 1 ≤ j ≤ d. The composition of σ with itself is the identity, so σ is an isomorphism. To obtain (37), apply σ to each side of (38) and note that σ sends K 0 to K while leaving F[x 1 , . .…”
Let F denote a field and let V denote a vector space over F with finite positive dimension. We consider a pair of linear transformations A : V → V and A * : V → V that satisfy the following conditions: (i) each of A, A * is diagonalizable; (ii) there exists anWe call such a pair a tridiagonal pair on V . It is known that d = δ and for 0It is known that if F is algebraically closed then A, A * is sharp. In this paper we classify up to isomorphism the sharp tridiagonal pairs. As a corollary, we classify up to isomorphism the tridiagonal pairs over an algebraically closed field. We obtain these classifications by proving the µ-conjecture.
“…The concept of a TD pair originated in the theory of Q-polynomial distance-regular graphs [17]. Since that beginning the TD pairs have been investigated in a systematic way; for notable papers along this line see [1,2,3,4,5,6,7,8,9,10,15,18]. Several of these papers focus on a class of TD pair said to be sharp.…”
Let K denote a field and let V denote a vector space over K with finite positive dimension. We consider an ordered pair of linear transformations A : V → V and A * : V → V that satisfy the following four conditions:We call such a pair a tridiagonal pair on V . It is known that d = δ; to avoid trivialities assume d ≥ 1. We show that there exists a unique linear transformation ∆ :and θ 0 (resp. θ d ) denotes the eigenvalue of A associated with V 0 (resp. V d ). We characterize ∆, Ψ in several ways. There are two well-known decompositions of V called the first and second split decomposition. We discuss how ∆, Ψ act on these decompositions. We also show how ∆, Ψ relate to each other. Along this line we have two main results. Our first main result is that ∆, Ψ commute. In the literature on TD pairs, there is a scalar β used to describe the eigenvalues. Our second main result is that each of ∆ ±1 is a polynomial of degree d in Ψ, under a minor assumption on β.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.