scholarly journals LEONARD PAIRS AND THE ASKEY–WILSON RELATIONS

2004 ◽  
Vol 03 (04) ◽  
pp. 411-426 ◽  
Author(s):  
PAUL TERWILLIGER ◽  
RAIMUNDAS VIDUNAS

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 which satisfy the following two properties: (i) There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing A* is diagonal. (ii) There exists a basis for V with respect to which the matrix representing A* is irreducible tridiagonal and the matrix representing A is diagonal. We call such a pair a Leonard pair on V. Referring to the above Leonard pair, we show there exists a sequence of scalars β,γ,γ*,ϱ,ϱ*,ω,η,η* taken from K such that both [Formula: see text] The sequence is uniquely determined by the Leonard pair provided the dimension of V is at least 4. The equations above are called the Askey–Wilson relations.

2019 ◽  
Vol 7 (1) ◽  
pp. 1-19
Author(s):  
Kazumasa Nomura ◽  
Paul Terwilliger

Abstract Let F denote a field and let V denote a vector space over F with finite positive dimension. Consider a pair A, A* of diagonalizable F-linear maps on V, each of which acts on an eigenbasis for the other one in an irreducible tridiagonal fashion. Such a pair is called a Leonard pair. We consider the self-dual case in which there exists an automorphism of the endomorphism algebra of V that swaps A and A*. Such an automorphism is unique, and called the duality A ↔ A*. In the present paper we give a comprehensive description of this duality. In particular,we display an invertible F-linearmap T on V such that the map X → TXT−1is the duality A ↔ A*. We express T as a polynomial in A and A*. We describe how T acts on 4 flags, 12 decompositions, and 24 bases for V.


Author(s):  
Jun Liao ◽  
Heguo Liu ◽  
Yulei Wang ◽  
Zuohui Wu ◽  
Xingzhong Xu

Let α be a linear transformation of the m × n-dimensional vector space M_{m×n}(C) over the complex field C such that α(X) = AX −XB, where A and B are m×m and n×n complex matrices, respectively. In this paper, the dimension formulas for the kernels of the linear transformations α^2 and α^3 are given, which generalizes the work of Gracia in [J.M. Gracia. Dimension of the solution spaces of the matrix equations [A, [A, X]] = 0 and [A[A, [A, X]]] = 0. Linear and Multilinear Algebra, 9:195–200, 1980.].


2010 ◽  
Vol 09 (04) ◽  
pp. 543-552 ◽  
Author(s):  
TATSURO ITO ◽  
PAUL TERWILLIGER

Let 𝔽 denote a field and let V denote a vector space over 𝔽 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 ordering [Formula: see text] of the eigenspaces of A such that A* Vi ⊆ Vi-1 + Vi + Vi+1 for 0 ≤ i ≤ d, where V-1 = 0 and Vd+1 = 0; (iii) there exists an ordering [Formula: see text] of the eigenspaces of A* such that [Formula: see text] for 0 ≤ i ≤ δ, where [Formula: see text] and [Formula: see text]; (iv) there is no subspace W of V such that AW ⊆ W, A* W ⊆ W, W ≠ 0, W ≠ V. We call such a pair a tridiagonal pair on V. It is known that d = δ, and for 0 ≤ i ≤ d the dimensions of Vi, [Formula: see text], Vd-i, [Formula: see text] coincide. Denote this common dimension by ρi and call A, A*sharp whenever ρ0 = 1. Let T denote the 𝔽-subalgebra of End 𝔽(V) generated by A, A*. We show: (i) the center Z(T) is a field whose dimension over 𝔽 is ρ0; (ii) the field Z(T) is isomorphic to each of E0TE0, EdTEd, [Formula: see text], [Formula: see text], where Ei (resp. [Formula: see text]) is the primitive idempotent of A (resp. A*) associated with Vi (resp. [Formula: see text]); (iii) with respect to the Z(T)-vector space V the pair A, A* is a sharp tridiagonal pair.


2008 ◽  
Vol 16 (3) ◽  
pp. 269-275 ◽  
Author(s):  
Karol Pąk

Linear Map of MatricesThe paper is concerned with a generalization of concepts introduced in [13], i.e. introduced are matrices of linear transformations over a finitedimensional vector space. Introduced are linear transformations over a finitedimensional vector space depending on a given matrix of the transformation. Finally, I prove that the rank of linear transformations over a finite-dimensional vector space is the same as the rank of the matrix of that transformation.


1977 ◽  
Vol 29 (5) ◽  
pp. 937-946
Author(s):  
Hock Ong

Let F be a field, F* be its multiplicative group and Mn(F) be the vector space of all n-square matrices over F. Let Sn be the symmetric group acting on the set {1, 2, … , n}. If G is a subgroup of Sn and λ is a function on G with values in F, then the matrix function associated with G and X, denoted by Gλ, is defined byand letℐ(G, λ) = { T : T is a linear transformation of Mn(F) to itself and Gλ(T(X)) = Gλ(X) for all X}.


1998 ◽  
Vol 57 (1) ◽  
pp. 59-71 ◽  
Author(s):  
Rachel Thomas

In this paper we consider the characterisation of those elements of a transformation semigroup S which are a product of two proper idempotents. We give a characterisation where S is the endomorphism monoid of a strong independence algebra A, and apply this to the cases where A is an arbitrary set and where A is an arbitrary vector space. The results emphasise the analogy between the idempotent generated subsemigroups of the full transformation semigroup of a set and of the semigroup of linear transformations from a vector space to itself.


2010 ◽  
Vol 37 ◽  
pp. 141-188 ◽  
Author(s):  
P. D. Turney ◽  
P. Pantel

Computers understand very little of the meaning of human language. This profoundly limits our ability to give instructions to computers, the ability of computers to explain their actions to us, and the ability of computers to analyse and process text. Vector space models (VSMs) of semantics are beginning to address these limits. This paper surveys the use of VSMs for semantic processing of text. We organize the literature on VSMs according to the structure of the matrix in a VSM. There are currently three broad classes of VSMs, based on term-document, word-context, and pair-pattern matrices, yielding three classes of applications. We survey a broad range of applications in these three categories and we take a detailed look at a specific open source project in each category. Our goal in this survey is to show the breadth of applications of VSMs for semantics, to provide a new perspective on VSMs for those who are already familiar with the area, and to provide pointers into the literature for those who are less familiar with the field.


10.37236/75 ◽  
2009 ◽  
Vol 16 (2) ◽  
Author(s):  
Richard P. Stanley

Promotion and evacuation are bijections on the set of linear extensions of a finite poset first defined by Schützenberger. This paper surveys the basic properties of these two operations and discusses some generalizations. Linear extensions of a finite poset $P$ may be regarded as maximal chains in the lattice $J(P)$ of order ideals of $P$. The generalizations concern permutations of the maximal chains of a wider class of posets, or more generally bijective linear transformations on the vector space with basis consisting of the maximal chains of any poset. When the poset is the lattice of subspaces of ${\Bbb F}_q^n$, then the results can be stated in terms of the expansion of certain Hecke algebra products.


1993 ◽  
Vol 114 (1) ◽  
pp. 111-130 ◽  
Author(s):  
A. Sudbery

AbstractWe construct a non-commutative analogue of the algebra of differential forms on the space of endomorphisms of a vector space, given a non-commutative algebra of functions and differential forms on the vector space. The construction yields a differential bialgebra which is a skew product of an algebra of functions and an algebra of differential forms with constant coefficients. We give necessary and sufficient conditions for such an algebra to exist, show that it is uniquely determined by the differential algebra on the vector space, and show that it is a non-commutative superpolynomial algebra in the matrix elements and their differentials (i.e. that it has the same dimensions of homogeneous components as in the classical case).


Sign in / Sign up

Export Citation Format

Share Document