Quasi-uniform Posets and Leonard Pairs Associated With Singular Linear Spaces Over Finite Fields
|
|
- Elijah Short
- 6 years ago
- Views:
Transcription
1 46 1ff ffi ± μ Vol. 46, No Ω1 ADVANCES IN MATHEMATICS (CHINA) Jan., 2017 doi: /sxjz b Quasi-uniform Posets and Leonard Pairs Associated With Singular Linear Spaces Over Finite Fields LI Zengti, ZHANG Baohuan (College of Mathematics and Information Science, Langfang Teachers University, Langfang, Hebei, , P. R. China) Abstract: Let F n+l be the (n + l)-dimensional singular linear space over a finite field F with elements. Denote by L(m, k; n + l, n) the set of all subspaces of type (m 1,k 1)ofF n+l such that 0 k 1 k and 0 m 1 m. If we partially order L(m, k; n + l, n) byordinary inclusion, then L(m, k; n + l, n) is a poset. In this paper, we prove that L(m, k; n + l, n) isa uasi-uniform poset and construct a Leonard pair from L(m, m; n + l, n). Keywords: finite field; singular linear space; uniform poset; Leonard pair MR(2010) Subject Classification: 05B25; 05C50 / CLC number: O157.3 Document code: A Article ID: (2017) Introduction Terwilliger [4] introduced the uniform poset, discussed its algebraic structure and gave eleven families of examples. Woramannotai [10] constructed a family of uniform posets by using the dual polar graphs. Miklavi c and Terwilliger [3] constructed a family of uniform posets by using bipartite Q-polynomial distance-regular graphs. Terwilliger [5] obtained Leonard pairs from classical posets. Their researches stimulate us to consider the uniformity and Leonard pairs of other posets. Let F be a finite field with elements, where is a prime power. Let F n+l be the (n + l)-dimensional singular linear space over F. Denote by L(m, k; n + l, n) thesetofall subspaces of type (m 1,k 1 )off n+l such that 0 k 1 k and 0 m 1 m. If we partially order L(m, k; n + l, n) by ordinary inclusion, then L(m, k; n + l, n) is a poset. In this paper, we prove that L(m, k; n + l, n) is a uasi-uniform poset and construct a Leonard pair from the uniform poset L(m, m; n + l, n). The paper is organized as follows. In Section 1, we recall singular linear spaces, uasi-uniform posets and Leonard pairs. In Section 2, we show that L(m, k; n + l, n) is a uasi-uniform poset. In Section 3, we construct a Leonard pair from L(m, m; n + l, n). 1 Preliminaries In this section we introduce singular linear spaces, uasi-uniform posets and Leonard pairs. Received date: Revised date: Foundation item: The work is supported by NSFC (No ), the NSF of Hebei Province (No. A ), the Specialized Research Fund for the Doctoral Program of Higher Education of China (No ) and the Key Fund Project of Langfang Teachers University (No. LSLZ201403). lizengti@126.com
2 No. 1 Li Z. T. and Zhang B. H.: Quasi-uniform Posets and Leonard Pairs Singular Linear Spaces For two non-negative integers n and l, letf n+l denote the (n + l)-dimensional row vector space over F. The set of all (n + l) (n + l) nonsingular matrices over F of the form ( ) T11 T 12, 0 T 22 where T 11 and T 22 are nonsingular n n and l l matrices, respectively, forms a group under matrix multiplication, called the singular general linear group over F and denoted by GL n+l,n (F ). Let P be an m-dimensional subspace of F n+l. Denote also by P an m (n + l) matrixof rank m whose rows span the subspace P and call the matrix P a matrix representation of the subspace P. There is an action of GL n+l,n (F )onf n+l defined as follows, F n+l GL n+l,n (F ) F n+l, ((x 1,x 2,,x n,x n+1,...,x n+l ),T) (x 1,x 2,,x n,x n+1,,x n+l )T. The above action induces an action on the set of subspaces of F n+l ; i.e., a subspace P is carried by T GL n+l,n (F ) to the subspace PT. The vector space F n+l together with the above group action, is called the (n + l)-dimensional singular linear space over F. For 1 i n + l, let e i all other coordinates are 0. be the row vector in F n+l whose i-th coordinate is 1 and Denoted by E the l-dimensional subspace of F n+l generated by e n+1,e n+2,,e n+l. An m-dimensional subspace P of F n+l is called a subspace of type (m, k) if dim(p E) =k. A subspace of type (m, k) is also called (m, k)-subspace. The collection of all the subspaces of types (m, 0) in F n+l,where0 m n, is the attenuated space [9]. For a fixed subspace P of type (m 1,k 1 )inf n+l,letm (m 1,k 1 ; m, k; n + l, n) denotetheset of all the subspaces of type (m, k) containing P, and let N (m 1,k 1 ; m, k; n + l, n) = M (m 1,k 1 ; m, k; n + l, n). By the transitivity of GL n+l,n (F ) on the set of all subspaces of the same type, N (m 1,k 1 ; m, k; n+ l, n) is independent of the particular choice of the subspace P of type (m 1,k 1 ). [9, Lemma 2.3] Lemma 1.1 M (m 1,k 1 ; m, k; n + l, n) is non-empty if and only if 0 k 1 k l and 0 m 1 k 1 m k n hold. Moreover, if M (m 1,k 1 ; m, k; n + l, n) isnon-empty,then [ ] [ ] N (m 1,k 1 ; m, k; n + l, n) = (l k)(m k m1+k1) n (m 1 k 1 ) l k1. (m k) (m 1 k 1 ) k k Quasi-uniform Posets and Incidence Algebras Let P be a poset with partial order. Asusual,wewritea<bwhenever a b and a b. For any two elements a, b P,wesayb covers a, denoted by a b, ifa<band there exists no c P such that a<c<b. Let P be a finite poset with the minimum element, denoted by 0.
3 36 ADVANCES IN MATHEMATICS (CHINA) Vol. 46 By a rank function on P, we mean a function r from P to the set of all the integers such that r(0) = 0 and r(a) =r(b) 1 whenever a b. In this paper, we always assume that P is a poset with the rank function r. The maximum value of r(x) is called the rank of P, denoted by N. Definition 1.1 [4] Let P be a finite poset with N 2. Define the lowering matrices L i, the raising matrices R i and the projection matrices F i (0 i N) inmat P (R) as follows. { 1, if x Pi 1,y P i, x y, (L i ) xy = 0, otherwise, 1 i N, { 1, if x, y Pi,x= y, (F i ) xy = 0 i N. 0, otherwise, Write R i := L t i+1 and R N := 0, L 0 := 0, where Mat P (R) is the set consisting of all P P matrices over the real number field R and whose rows and columns are indexed by P. Definition 1.2 [4] Let P be a finite poset with N 2. The incidence algebra T of P is the real matrix algebra generated by L i,r i,f i (0 i N). Let T be the incidence algebra of the poset P with rank N. Let V be the Euclidean vector space R P over the real number field R with the usual inner product,. We call V the standard module of P. A subspace W of V is called a module of T if it is invariant under T, i.e., tw W for all t T and all w W. A module W of T is said to be irreducible if it is non-zero, and the only non-zero module it contains is W itself. [4, Definition 2.1] Definition 1.3 Let N 2. A parameter matrix of order N is a tridiagonal real matrix E =(e ij ) 1 i,j N satisfying (i) e ii =1(1 i N); (ii) e i,i 1 0(2 i N) ore i,i+1 0(1 i N 1); (iii) the principal submatrix E(r, p) =(e ij ) r+1 i,j p is nonsingular for all integers r, p (0 r p N). We abbreviate e i := e i,i 1 for 2 i N and e + i := e i,i+1 for 1 i N 1. For notational convenience define e 1 := 0 and e+ N := 0. Definition 1.4 Let P be a finite poset of rank N 2 with lowering and raising matrices L i,r i (0 i N). We call P uasi-uniform if there exists a parameter matrix E of order N and three vectors F = {f i } N i=1,h={h i} N i=1,u={u i} N i=1 in RN such that e i R i 2L i 1 L i + L i R i 1 L i + e + i L il i+1 R i = f i L i + h i A + u i B (1 i N), (1.1) where A, B are (0, 1)-matrices in Mat P (R), R 1 = L N+1 =0ande + i,e i are entries in E as indicated in Definition 1.3. Remark 1.1 When H and U are zero vectors, the uasi-uniform poset P is a uniform poset. [4, Theorem 2.5] Lemma 1.2 Let P be a uniform poset of rank N at least 2, with lowering, raising and projection matrices L i,r i,f i for 0 i N. Let T be the incident algebra of P acting on its standard module V.Then (i) V decomposes into an orthogonal direct sum of irreducible T -modules.
4 No. 1 Li Z. T. and Zhang B. H.: Quasi-uniform Posets and Leonard Pairs 37 (ii) Each irreducible T -module W has a basis of the form w r,w r+1,,w p (0 r p N) such that (a) w i F i V (r i p), (b) L i w i = w i 1 (r +1 i p) andl r w r =0, (c) R i w i = x i+1 (r, p)w i+1 (r i p 1) and L p w p =0, where x i (r, p) (r +1 i p) are the solution to the system of linear euation x r+1 (r, p) f r+1 x r+2 (r, p) E(r, p).. = f r+2... x p (r, p) f p We refer to the integers r, p in Lemma 1.2 as the endpoints of W. 1.3 Leonard Pairs In this subsection, we recall the Leonard pairs. Throughout this subsection, F denotes an algebraically closed field with characteristic zero. Let X be a suare matrix. Then X is called upper (resp. lower) bidiagonal whenever each nonzero entry lies on either the diagonal or the superdiagonal (resp. subdiagonal). X is called tridiagonal whenever each nonzero entry lies on either the diagonal, subdiagonal, or the superdiagonal. Assume that X is tridiagonal, then X is called irreducible whenever each entry on the subdiagonal is nonzero and each entry on the superdiagonal is nonzero. Let d denote a nonnegative integer and let Mat d+1 (F) denotethef-algebra consisting of all (d +1) (d + 1) matrices over F. We index the rows and the columns by 0, 1,,d. Let F d+1 denote the F-vector space consisting of all (d +1) 1 matrices over F. Its rows are indexed by 0, 1,,d. We view F d+1 as a left module for Mat d+1 (F). For the rest of the subsection, let V denote a vector space over F that has dimension d +1. LetEnd(V )denotethef-algebra consisting of all linear transformations from V to V. Let {v i } d i=0 denote a basis for V. For X End(V )andy Mat d+1 (F), we say that Y represents X with respect to {v i } d i=0 whenever Xv j = d i=0 Y ijv i for 0 j d. [6, Definition 1.1] Definition 1.5 By a Leonard pair on V, we mean an ordered pair of linear transformations A : V V and A : V V that satisfies the conditions (i) and (ii) below. (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. [7, Definition 22.1] Definition 1.6 By a parameter array over F of diameter d we mean a seuence of scalars ({θ i } d i=0, {θi } d i=0, {ϕ i } d i=1, {φ i } d i=1) taken from F that satisfies the following conditions: (PA1) θ i θ j, θi θ j if i j (0 i, j d).
5 38 ADVANCES IN MATHEMATICS (CHINA) Vol. 46 (PA2) ϕ i 0,φ i 0(1 i d). i 1 θ (PA3) ϕ i = φ h θ d h 1 h=0 (PA4) φ i = ϕ 1 i 1 h=0 θ 0 θ d θ h θ d h θ 0 θ d +(θ i θ 0)(θ i 1 θ d ) (1 i d). +(θi θ 0 )(θ d i+1 θ 0 ) (1 i d). (PA5) The expressions θi 2 θi+1 θ i 1 θ i and θ i 2 θ i+1 θi 1 θ i d 1. [6, Corollary 14.2] Lemma 1.3 Let A = are eual and independent of i for 2 i A and A denote any matrices in Mat d+1 (F) oftheform θ 0 0 θ 0 ϕ θ 1 θ1 ϕ 2 1 θ 2, A = θ ϕd 0 1 θ d 0 θd Then the following are euivalent: (i) (A, A ) is a Leonard pair. (ii) There exist scalars φ 1,φ 2,, φ d in F such that the seuence ({θ i } d i=0, {θ i }d i=0, {ϕ i} d i=1, {φ i } d i=1 ) is a parameter array. 2 The Quasi-uniform Poset L(m, k; n + l, n) In this section, we consider the poset L(m, k; n + l, n) which has the uasi-uniform structure. Let N denote the set of all nonnegative integers. For any x L(m, k; n + l, n), define r(x) =dim(x). Then r: L(m, k; n + l, n) N is the rank function of the poset L(m, k; n + l, n). We remark that the rank of the poset L(m, k; n + l, n) ism. Definition 2.1 Let 2 k<l,0 m k n. Wewrite and L i (m, k; n + l, n) ={x L(m, k; n + l, n) r(x) =i} L(m, k; n + l, n) = m L i (m, k; n + l, n). i=0 For 0 i m, 0 j k, denotebyl j i (m, k; n + l, n) the set of all subspaces of Type (i, j) in L(m, k; n + l, n). Theorem 2.1 The finite poset L(m, k; n + l, n) ofrankm is a uasi-uniform poset. To prove Theorem 2.1, we first give some lemmas. Lemma 2.1 For all x, y L(m, k; n + l, n) with1 m n + l 1, let x and y be the subspaces of type (m 1,k 1 )and(m 2,k 2 ), respectively. If y covers x, i.e., x y, thenm 2 =1+m 1 and k 2 k 1 =0or1. Proof Routine. Lemma 2.2 With reference to Definitions 1.2 and 2.1, let x L i 1 (m, k; n + l, n) and y L i (m, k; n + l, n). Then the following (i) and (ii) hold.
6 No. 1 Li Z. T. and Zhang B. H.: Quasi-uniform Posets and Leonard Pairs 39 (i) If x y, then (ii) If x y, then (R i 2 L i 1 L i ) xy = (i 1 1)( +1), 1 i m. { +1, if x y x, (R i 2 L i 1 L i ) xy = 0, otherwise, 2 i m. Proof For a fixed x L i 1 (m, k; n + l, n) andafixedy L i (m, k; n + l, n), we first have (R i 2 L i 1 L i ) xy = (R i 2 ) xz (L i 1 ) zw (L i ) wy z,w L(m,k;n+l,n) = {(z,w) z x, z w, w y}. Next we count the number of the pairs (z,w) such that z x, z w, w y. By Lemma 2.1, we find that z L i 2 (m, k; n + l, n) andw L i 1 (m, k; n + l, n). (i) The case x y. By Definition 2.1 and [8, Corollary 1.8], the number of subspaces z such that z x is i 1 1, and by [8, Corollary 1.9], for each of z there exist + 1 subspaces w such that z w y. Hence, the number of the pairs (z,w) such that z x, z w, w y is ( i 1 1)(). (ii) The case x y. Whenx y x, it follows from z x, z w, w y that x y = z. The number of the pairs (z,w) such that z x, z w, w y is eual to the number of subspaces w such that z w y, whichis +1. Whenx y x, there does not exist z and w such that z x, z w, w y. Lemma 2.3 With reference to Definitions 1.1 and 2.1, let x L i 1 (m, k; n + l, n) and y L i (m, k; n + l, n). Then the following (i) and (ii) hold. (i) If x y, then (L i R i 1 L i ) xy = (ii) If x y, then n+l i+1 + i, if x/ L k i 1 (m, k; n + l, n), 1 i m. n+l i+1 + i l k, if x L k i 1 (m, k; n + l, n), { +1, if y x + y, (L i R i 1 L i ) xy = 0, otherwise, 2 i m k. Proof For a fixed x L i 1 (m, k; n + l, n) andafixedy L i (m, k; n + l, n), we first have (L i R i 1 L i ) xy = (L i ) xz (R i 1 ) zw (L i ) wy z,w L(m,k;n+l,n) = {(z,w) x z,w z,w y}.
7 40 ADVANCES IN MATHEMATICS (CHINA) Vol. 46 Next we count the number of the pairs (z,w) such that x z, w z, w y. By Lemma 2.1, we find that z L i (m, k; n + l, n) andw L i 1 (m, k; n + l, n). (i) The case x y. When x / L k i 1 (m, k; n + l, n), if x = w, by Definition 2.1 and [8, Corollary 1.9], the number of subspaces z such that x z is n+l i+1 1. If x w, it implies z = y. By Definition 2.1 and [8, Corollary 1.8], the number of subspaces w such that x w y is i 1 1. Hence, the number of the pairs (z,w) such that x z,w z,w y is n+l i i 1 1=n+l i+1 + i. When x L k i 1 (m, k; n + l, n), if x = w, by Definition 2.1 and Lemma 1.1, the number of subspaces z such that x z is n+l i+1 l k. If x w, it implies z = y. By Definition 2.1 and [8, Corollary 1.8], the number of subspaces w such that x w y is i 1 1. Hence, the number of the pairs (z,w) such that x z,w z,w y is n+l i+1 l k + i 1 1=n+l i+1 + i l k. (ii) The case x y. When y x + y, it follows from x z,w z,w y that y z = w. Thus dim(z + y) =dim(z)+dim(y) dim(w) =i + 1. It implies that z z + y and dim(x + y) = dim(z + y). It follows from x z that x + y = z + y and z x + y. Sincew = y z, wehavethe number of the pairs (z,w) such that x z,w z,w y is eual to the number of subspaces z such that x z x + y, whichis +1. When y x + y, there does not exist z and w such that x z,w z,w y. Lemma 2.4 With reference to Definitions 1.1 and 2.1, let x L i 1 (m, k; n + l, n) and y L i (m, k; n + l, n). Then the following (i) (iii) hold. (i) If x y, then ( n+l i 1)( +1), if y/ L k i (m, k; n + l, n), (L i L i+1 R i ) xy = 1 i m 1. ( n+l i l )( +1), if y L k i (m, k; n + l, n), (ii) If x y, then { +1, if y x + y, (L i L i+1 R i ) xy = 0, if y x + y, 1 i m k 1. (iii) If i = m k, then(l i L i+1 R i ) xy =0. Proof For a fixed x L i 1 (m, k; n + l, n) andafixedy L i (m, k; n + l, n), we first have (L i L i+1 R i ) xy = (L i ) xz (L i+1 ) zw (R i ) wy z,w L(m,k;n+l,n) = {(z,w) x z,z w, y w}.
8 No. 1 Li Z. T. and Zhang B. H.: Quasi-uniform Posets and Leonard Pairs 41 Next we count the number of the pairs (z,w) such that x z, z w, y w. By Lemma 2.1, we find that z L i (m, k; n + l, n) andw L i+1 (m, k; n + l, n). (i) The case x y. When y / L k i (m, k; n + l, n), by Definition 2.1 and [8, Corollary 1.9], the number of subspaces w such that y w is n+l i 1. By [8, Corollary 1.8], for each of w there exist + 1 subspaces z such that x z w. Hence, the number of the pairs (z,w) such that x z,z w, y w is (n+l i 1)(). When y L k i (m, k; n + l, n), by Lemma 1.1, the number of subspaces w such that y w is n+l i l k. By [8, Corollary 1.8], for each of w there exist + 1 subspaces z such that x z w. Hence, the number of the pairs (z,w) such that x z,z w, y w is (n+l i l k )(). (ii) The case x y. When y x + y, for1 i m 1, clearly y z. It follows from x z,z w, y w that y + z w. Since i = dim(y) < dim(y + z) dim(w) =i +1, we have dim(y + z) =i +1. So y + z = w, and hence z y + z. Since y x + y, we have dim(x + y) =i +1. It follows from x z that x + y = z + y = w. So the number of the pairs (z,w) such that x z,z w, y w is eual to the number of subspaces z such that x z x + y, whichis +1. Wheny x + y, there does not exist z and w such that x z,z w, y w. (iii) The case i = m. WehaveL i+1 =0,andso(L i L i+1 R i ) xy =0. Lemma 2.5 With reference to Definition 2.1, if x L i 1 (m, k; n + l, n), y L i (m, k; n+l, n) for2 i m, andx y, then x y x if and only if y x + y. Proof Routine. Proof of Theorem 2.1 Define the matrices A and B by means of Definition 1.4 as follows: { 1, if x y, x L k A xy = i 1 (m, k; n + l, n) andy L k i (m, k; n + l, n), 0, otherwise and { 1, if x y, x L k 1 i 1 B xy = (m, k; n + l, n) andy Lk i (m, k; n + l, n), 0, otherwise. To prove the result, we divide the integer i into three cases according to the value of i. Case (I): i =1. By Lemmas , we have the following Table 1: Table 1 Comments x y (R 1L 0L 1) xy 0 (L 1R 0L 1) n+l 1 xy ( (L 1L 2R 1) n+l 1 1)() xy (L 1) xy 1
9 42 ADVANCES IN MATHEMATICS (CHINA) Vol. 46 By Table 1, we obtain the following euation: n+l 1 + (n+l 1 1)( +1) e + 1 = f 1 + h 1 + u 1. Set h 1 = u 1 =0,e 1 = ( +1) 1 and e + 1 = ( +1) 1. Then f 1 = n+l 1. Case (II): 2 i m 1. Note that x y, x y x if and only if y x + y by Lemma 2.5. By Lemmas , we have the following Table 2: Comments x y, x/ L k i 1 (m,k;n+l,n), y/ L k i (m,k;n+l,n) ( (R i 2L i 1L i) i 1 1)() xy (L ir i 1L i) n+l i+1 + i xy ( (L il i+1r i) n+l i 1)() xy Table 2 x y, x L k i 1 (m,k;n+l,n), y L k i (m,k;n+l,n) ( i 1 1)() n+l i+1 + i l k ( n+l i l )() x y, x L k 1 i 1 (m,k;n+l,n), y L k i (m,k;n+l,n) ( i 1 1)() x y, x y x +1 n+l i+1 + i +1 ( n+l i l )() +1 (L i) xy By Table 2, we obtain the following system of linear euations. ( i 1 1)( +1) e i + n+l i+1 + i + (n+l i 1)( +1) e + i = f i, ( i 1 1)( +1) e i + n+l i+1 + i l k + (n+l i l )( +1) e + i = f i + h i, ( i 1 1)( +1) e i + n+l i+1 + i + (n+l i l )( +1) e + i = f i + u i, ( +1)e i +( +1)+( +1)e + i =0. Clearly, (h i,u i,e i,e+ i,f i)=( l l k, l 1, ( +1) 1, ( +1) 1, n+l i ) is the solution of the above system of linear euations, where 2 i m 1. Case (III): i = m. Note that x y, x y x if and only if y x + y by Lemma 2.5. By Lemmas , we have the following Table 3: Comments x y, x/ L k m 1 (m,k;n+l,n) (R m 2L m 1L m) xy ( m 1 1)() (L mr m 1L m) xy n+l m+1 + m Table 3 x y, x L k m 1 (m,k;n+l,n),y Lk m (m,k;n+l,n) ( m 1 1)() x y, x y x +1 n+l m+1 + m l k +1 (L ml m+1r m) xy (L m) xy By Table 3, we obtain the following system of linear euations: ( m 1 1)( +1) e k + n+l m+1 + m = f m + u m, ( m 1 1)( +1) e k + n+l m+1 + m l k = f m + h m, ( +1)e m +( +1)=0.
10 No. 1 Li Z. T. and Zhang B. H.: Quasi-uniform Posets and Leonard Pairs 43 Clearly, (h m,u m,e m,e + m,f m )= ( l k 1, 0, ( +1) 1, ( +1) 1, n+l m+1 n+l m + l ) 1 is the solution of the above system of linear euations. Therefore, for 1 i m, wehave e i R i 2L i 1 L i + L i R i 1 L i + e + i L il i+1 R i = f i L i + h i A + u i B. Let E := (e ij ) 1 i,j m = (2.1) and F := (f i ) 1 i m. (2.2) Then by the above arguments, (1.1) holds. To complete the proof, we show that the above matrix E is a parameter matrix. The conditions (i) and (ii) of Definition 1.3 hold obviously. To verify the condition (iii) of Definition 1.3, we calculate the principal minor determinant det E(r, p) := (e ij ) r+1 i,j p, where 0 r<p m. If p m 1, we have ( p r+1 ) 1 det E(r, p) = ( +1) r p 0. (2.3) If p = m, we have det E(r, p) = p r 1 ( +1) r p+1 0. (2.4) So the condition (iii) of Definition 1.3 holds. Therefore, Theorem 2.1 holds. By Remark 1.1 and the proof of Theorem 2.1, we obtain the following remark. Remark 2.1 The poset L(m, m; n + l, n) is a uniform poset. 3 Leonard Pairs From the Uniform Poset L(m, m; n + l, n) In this section, we construct a Leonard pair from the uniform poset L(m, m; n + l, n). Throughout this section, C denotes the field of complex numbers. Lemma 3.1 Let E and F be the matrices in (2.1) and (2.2), respectively. Let E(r, p) :=(e ij ) r+1 i,j p and F (r, p) :=(f r+1,f r+2,,f p ) T.
11 44 ADVANCES IN MATHEMATICS (CHINA) Vol. 46 Then the solution to the system of linear euations x r+1 (r, p) x r+2 (r, p) E(r, p) = F (r, p) (3.1). x p (r, p) is x i (r, p) = n+l p r i+1 ( i r )( p i 1 ) () 2, if p m 1, ( i r )( n+l r i 1 ) () 2 i 1, if p = m, where r +1 i p. Proof Obviously, det E(r, p) 0 by (2.3) and (2.4). By calculation, the result holds. For the rest of this section, let V = CL(m, m; n + l, n) be the standard module of L(m, m; n + l, n), and let L i,r i and F i (0 i m) be the lowering, raising and projection matrices, respectively. For convenience, we set Obviously, we have L = m L i and R = i=0 m R i. i=0 F i F j = δ ij F i, 0 i, j m, F 0 + F F m = I. Moreover, F i V = Span{x L(m, m; n + l, n) r(x) =i}, 0 i m. By (1.1), (2.1), (2.2) and Remark 1.1, we get that +1 RL2 LRL L2 R + n+l i L (3.2) vanishes on F i V for 1 i m 1, and vanishes on F m V. We put RL 2 LRL L2 R + n+l m+1 m 1 L (3.3) A = R + m i=0 A = α L + i F i, (3.4) m i=0 i F i, (3.5) where α is any scalar C that is not one of (n+l), (n+l)+1,, (n+l)+m 2. Let T denote the subalgebra of Mat L(m,m;n+l,n) (C) generated by R, L, F 0,F 1,,F m.obviously, R T = L, andeachoff 0,F 1,,F m is symmetric. It follows that T is closed under
12 No. 1 Li Z. T. and Zhang B. H.: Quasi-uniform Posets and Leonard Pairs 45 the conjugate-transpose map. Thus, T is semi-simple, and V is a direct sum of irreducible T -submodules. Theorem 3.1 Let V = CL(m, m; n + l, n) be the standard module of L(m, m; n + l, n) and let W be an irreducible T -submodule of V with endpoints r, p, where0 r<p m 1. Then (A W,A W ) is a Leonard pair on W. Proof We first have AW W, A W W, since the matrices A and A are contained in T by (3.4) and (3.5). Next we show that (A W,A W ) is a Leonard pair on W. Similar to the proof of Lemma 1.2 (ii), by using (3.2) and (3.3) we can show that there exists abasisw r,w r+1,, w p for W such that (i) w i F i V (r i p), (ii) R i w i = w i+1 (r i p 1) and R p w p =0, (iii) L i w i = x i (r, p)w i 1 (r +1 i p) andl r w r =0, where x i (r, p) (r +1 i p) are the solution of the system of linear euations (3.1). Let B (resp. B ) denote the matrix representing A (resp. A ) with respect to the basis w r,w r+1,, w p. Then by the above arguments, we have θ 0 0 θ 0 ϕ θ 1 θ1 ϕ 2 B = 1 θ 2, B = θ... 2,... ϕd 0 1 θ d 0 θd respectively, where d = p r, θ i = r+i, θ i = r i, 0 i d, (3.6) ϕ i = α x r+i (r, p), 1 i d. (3.7) Here α is the scalar from (3.5) and x r+i (r, p) (1 i d) are from Lemma 3.1. Set i 1 θ h θ d h φ i = ϕ 1 +(θi θ 0 θ θ 0 )(θ d i+1 θ 0 ), 1 i d. d h=0 By (3.6) and (3.7), we obtain φ i = (1 i )(1 d i+1 )(1 α n+l+i r d ) () 2 i, 1 i d. (3.8) One readily checks that the above scalars θ i,θi,ϕ i,φ i satisfy the conditions (PA1), (PA2), (PA4) and (PA5) of Definition 1.6. To verify the euation (PA3) of Definition 1.6, we calculate
13 46 ADVANCES IN MATHEMATICS (CHINA) Vol. 46 the right hand of the euation (PA3) of Definition 1.6. Using (3.6), (3.8) and Lemma 3.1, we have i 1 θ h θ d h φ 1 +(θi θ θ 0 θ 0)(θ i 1 θ d ) d h=0 = α n+l d r (1 i )(1 d i+1 ) () 2 = α x r+i (r, p), 1 i d. By (3.7), the (PA3) of Definition 1.6 holds. From the above arguments and by Lemma 1.3, (B,B ) is a Leonard pair in Mat d+1 (C). It follows that (A W,A W ) is also a Leonard pair on W. Acknowledgements The authors thank the referees for their many valuable comments and suggestions. References [1] Aigner, M., Combinatorial Theory, Berlin: Springer-Verlag, [2] Birkhoff, G., Lattice Theory, Providence, RI: AMS, [3] Miklavi c, S. and Terwilliger, P., Bipartite Q-polynomial distance-regular graphs and uniform posets, J. Algebraic Combin., 2013, 38(2): [4] Terwilliger, P., The incidence algebra of a uniform poset, In: Coding Theory and Design Theory, The IMA Volumes in Mathematics and Its Applications, Vol. 20, New York: Springer-Verlag, 1990, [5] Terwilliger, P., An introduction to Leonard pairs and Leonard systems, In: Algebraic Combinatorics (Suzuki, H. ed.), RIMS Kôkyûroku, No. 1109, Kyoto: Kyoto Univ., 1999, [6] Terwilliger, P., Two linear transformations each tridiagonal with respect to an eigenbasis of the other, Linear Algebra Appl., 2001, 330(1/2/3): [7] Terwilliger, P., An algebraic approach to the Askey scheme of orthogonal polynomials, In: Orthogonal Polynomials and Special Functions: Computation and Applications, Lecture Notes in Math., Vol. 1883, Berlin: Springer-Verlag, 2006, [8] Wan, Z.X., Geometry of Classical Groups over Finite Fields, Beijing: Science Press, [9] Wang, K.S., Guo, J.G. and Li, F., Singular linear space and its applications, Finite Fields Appl., 2011, 17(5): [10] Worawannotai, C., Dual polar graphs, the uantum algebra U (sl 2 ), and Leonard systems of dual -Krawtchouk type, Linear Algebra Appl., 2013, 438(1): &/%$-')ψffi(ff!ο",1#*flfi Leonard ß 465, 723 (ΨΞfiΛ»fl fflφ», ΨΞ, Π, ) 0+ X F n+l Zh`i F W= (n + l)- TfacIH. L L(m, k; n + l, n) ;Y9 E F n+l m=[hmo 0 k 1 k, 0 m 1 m = (m 1,k 1 ) bnih=gf. VD^O89 EB_C> L(m, k; n + l, n) W=SdB_, QN L(m, k; n + l, n) Ze@SdG. :]kpk L(m, k; n + l, n) Ze@RelSdG<UJg L(m, m; n + l, n) AjKe@ Leonard?. ρχν h`i; TfacIH; elsdg; Leonard?
A classification of sharp tridiagonal pairs. Tatsuro Ito, Kazumasa Nomura, Paul Terwilliger
Tatsuro Ito Kazumasa Nomura Paul Terwilliger Overview This talk concerns a linear algebraic object called a tridiagonal pair. We will describe its features such as the eigenvalues, dual eigenvalues, shape,
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 431 (29) 188 195 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Lattices associated with
More informationLeonard pairs and the q-tetrahedron algebra. Tatsuro Ito, Hjalmar Rosengren, Paul Terwilliger
Tatsuro Ito Hjalmar Rosengren Paul Terwilliger Overview Leonard pairs and the Askey-scheme of orthogonal polynomials Leonard pairs of q-racah type The LB-UB form and the compact form The q-tetrahedron
More informationTridiagonal pairs in algebraic graph theory
University of Wisconsin-Madison Contents Part I: The subconstituent algebra of a graph The adjacency algebra The dual adjacency algebra The subconstituent algebra The notion of a dual adjacency matrix
More informationThe Multiplicities of a Dual-thin Q-polynomial Association Scheme
The Multiplicities of a Dual-thin Q-polynomial Association Scheme Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI 44824-1027 sagan@math.msu.edu and John S. Caughman,
More informationHessenberg Pairs of Linear Transformations
Hessenberg Pairs of Linear Transformations Ali Godjali November 21, 2008 arxiv:0812.0019v1 [math.ra] 28 Nov 2008 Abstract Let K denote a field and V denote a nonzero finite-dimensional vector space over
More informationHow to sharpen a tridiagonal pair
How to sharpen a tridiagonal pair Tatsuro Ito and Paul Terwilliger arxiv:0807.3990v1 [math.ra] 25 Jul 2008 Abstract Let F denote a field and let V denote a vector space over F with finite positive dimension.
More informationLeonard triples of q-racah type
University of Wisconsin-Madison Overview This talk concerns a Leonard triple A, B, C of q-racah type. We will describe this triple, using three invertible linear maps called W, W, W. As we will see, A
More informationTotally Bipartite Tridiagonal Pairs. Kazumasa Nomura and Paul Terwilliger
Contents Tridiagonal pair background TB tridiagonal pairs and systems The standard basis and matrix representations The classification of TB tridiagonal systems The Askey-Wilson relations Some automorphisms
More informationThe universal Askey-Wilson algebra
University of Wisconsin-Madison Overview This talk concerns an algebra called the Universal Askey-Wilson algebra. As we will see, is related to: Leonard pairs and Leonard triples of QRacah type Q-polynomial
More informationTotally Bipartite Tridiagonal Pairs. Kazumasa Nomura and Paul Terwilliger
Contents Tridiagonal pair background TB tridiagonal pairs and systems The standard basis and matrix representations The classification of TB tridiagonal systems The Askey-Wilson relations Some automorphisms
More informationTridiagonal pairs of q-racah type and the quantum enveloping algebra U q (sl 2 )
Tridiagonal pairs of q-racah type and the quantum enveloping algebra U q (sl 2 ) Sarah Bockting-Conrad University of Wisconsin-Madison June 5, 2014 Introduction This talk is about tridiagonal pairs and
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
More informationLeonard Systems and their Friends
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School March 016 Leonard Systems and their Friends Jonathan Spiewak Follow this and additional works at: http://scholarcommons.usf.edu/etd
More informationBidiagonal pairs, Tridiagonal pairs, Lie algebras, and Quantum Groups
Bidiagonal pairs, Tridiagonal pairs, Lie algebras, and Quantum Groups Darren Funk-Neubauer Department of Mathematics and Physics Colorado State University - Pueblo Pueblo, Colorado, USA darren.funkneubauer@colostate-pueblo.edu
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/32076 holds various files of this Leiden University dissertation Author: Junjiang Liu Title: On p-adic decomposable form inequalities Issue Date: 2015-03-05
More informationA family of tridiagonal pairs related to the quantum affine algebra U_q(sl_2)
Electronic Journal of Linear Algebra Volume 13 Volume 13 (2005) Article 1 2005 A family of tridiagonal pairs related to the quantum affine algebra U_q(sl_2) Hasan Alnajjar hhh2001jo@yahoo.com Brian Curtin
More informationarxiv: v1 [math.gr] 8 Nov 2008
SUBSPACES OF 7 7 SKEW-SYMMETRIC MATRICES RELATED TO THE GROUP G 2 arxiv:0811.1298v1 [math.gr] 8 Nov 2008 ROD GOW Abstract. Let K be a field of characteristic different from 2 and let C be an octonion algebra
More informationD-bounded Distance-Regular Graphs
D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationA Simple Proof of Fiedler's Conjecture Concerning Orthogonal Matrices
University of Wyoming Wyoming Scholars Repository Mathematics Faculty Publications Mathematics 9-1-1997 A Simple Proof of Fiedler's Conjecture Concerning Orthogonal Matrices Bryan L. Shader University
More informationMATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian.
MATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian. Spanning set Let S be a subset of a vector space V. Definition. The span of the set S is the smallest subspace W V that contains S. If
More informationON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH
ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH V. FABER, J. LIESEN, AND P. TICHÝ Abstract. Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix
More informationUpper triangular matrices and Billiard Arrays
Linear Algebra and its Applications 493 (2016) 508 536 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Upper triangular matrices and Billiard Arrays
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationINTRODUCTION TO LIE ALGEBRAS. LECTURE 7.
INTRODUCTION TO LIE ALGEBRAS. LECTURE 7. 7. Killing form. Nilpotent Lie algebras 7.1. Killing form. 7.1.1. Let L be a Lie algebra over a field k and let ρ : L gl(v ) be a finite dimensional L-module. Define
More informationLeonard pairs from the equitable basis of sl2
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 36 2010 Leonard pairs from the equitable basis of sl2 Hasan Alnajjar Brian Curtin bcurtin@math.usf.edu Follow this and additional
More informationA NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES
Journal of Mathematical Sciences: Advances and Applications Volume, Number 2, 2008, Pages 3-322 A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Department of Mathematics Taiyuan Normal University
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationTwo constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2
DOI 10.1007/s10878-009-9210-4 Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2 Zengti Li Suogang Gao Hongjie Du Feng Zou Weili Wu
More informationLIFTED CODES OVER FINITE CHAIN RINGS
Math. J. Okayama Univ. 53 (2011), 39 53 LIFTED CODES OVER FINITE CHAIN RINGS Steven T. Dougherty, Hongwei Liu and Young Ho Park Abstract. In this paper, we study lifted codes over finite chain rings. We
More informationConstruction of quasi-cyclic self-dual codes
Construction of quasi-cyclic self-dual codes Sunghyu Han, Jon-Lark Kim, Heisook Lee, and Yoonjin Lee December 17, 2011 Abstract There is a one-to-one correspondence between l-quasi-cyclic codes over a
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationRadon Transforms and the Finite General Linear Groups
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 1-1-2004 Radon Transforms and the Finite General Linear Groups Michael E. Orrison Harvey Mudd
More informationUniqueness of the Solutions of Some Completion Problems
Uniqueness of the Solutions of Some Completion Problems Chi-Kwong Li and Tom Milligan Abstract We determine the conditions for uniqueness of the solutions of several completion problems including the positive
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationSCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE
SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE BABHRU JOSHI AND M. SEETHARAMA GOWDA Abstract. We consider the semidefinite cone K n consisting of all n n real symmetric positive semidefinite matrices.
More informationOn the Rothenberg Steenrod spectral sequence for the mod 3 cohomology of the classifying space of the exceptional Lie group E 8
213 226 213 arxiv version: fonts, pagination and layout may vary from GTM published version On the Rothenberg Steenrod spectral sequence for the mod 3 cohomology of the classifying space of the exceptional
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 22. Smith normal form of an integer matrix (linear algebra over Z).
18.312: Algebraic Combinatorics Lionel Levine Lecture date: May 3, 2011 Lecture 22 Notes by: Lou Odette This lecture: Smith normal form of an integer matrix (linear algebra over Z). 1 Review of Abelian
More informationAlgebra Exam Syllabus
Algebra Exam Syllabus The Algebra comprehensive exam covers four broad areas of algebra: (1) Groups; (2) Rings; (3) Modules; and (4) Linear Algebra. These topics are all covered in the first semester graduate
More informationThe symmetric minimal rank solution of the matrix equation AX=B and the optimal approximation
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009 Article 23 2009 The symmetric minimal rank solution of the matrix equation AX=B and the optimal approximation Qing-feng Xiao qfxiao@hnu.cn
More informationQ N id β. 2. Let I and J be ideals in a commutative ring A. Give a simple description of
Additional Problems 1. Let A be a commutative ring and let 0 M α N β P 0 be a short exact sequence of A-modules. Let Q be an A-module. i) Show that the naturally induced sequence is exact, but that 0 Hom(P,
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS
ELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS J. WARNER SUMMARY OF A PAPER BY J. CARLSON, E. FRIEDLANDER, AND J. PEVTSOVA, AND FURTHER OBSERVATIONS 1. The Nullcone and Restricted Nullcone We will need
More informationMatrix Inequalities by Means of Block Matrices 1
Mathematical Inequalities & Applications, Vol. 4, No. 4, 200, pp. 48-490. Matrix Inequalities by Means of Block Matrices Fuzhen Zhang 2 Department of Math, Science and Technology Nova Southeastern University,
More informationELA ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES
ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES ZHONGPENG YANG AND XIAOXIA FENG Abstract. Under the entrywise dominance partial ordering, T.L. Markham
More information16.2. Definition. Let N be the set of all nilpotent elements in g. Define N
74 16. Lecture 16: Springer Representations 16.1. The flag manifold. Let G = SL n (C). It acts transitively on the set F of complete flags 0 F 1 F n 1 C n and the stabilizer of the standard flag is the
More informationThe Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices
The Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices Hajime Tanaka (joint work with Rie Tanaka and Yuta Watanabe) Research Center for Pure and Applied Mathematics
More informationSparse spectrally arbitrary patterns
Electronic Journal of Linear Algebra Volume 28 Volume 28: Special volume for Proceedings of Graph Theory, Matrix Theory and Interactions Conference Article 8 2015 Sparse spectrally arbitrary patterns Brydon
More informationComputational Approaches to Finding Irreducible Representations
Computational Approaches to Finding Irreducible Representations Joseph Thomas Research Advisor: Klaus Lux May 16, 2008 Introduction Among the various branches of algebra, linear algebra has the distinctions
More informationNur Hamid and Manabu Oura
Math. J. Okayama Univ. 61 (2019), 199 204 TERWILLIGER ALGEBRAS OF SOME GROUP ASSOCIATION SCHEMES Nur Hamid and Manabu Oura Abstract. The Terwilliger algebra plays an important role in the theory of association
More informationq-inverting pairs of linear transformations and the q-tetrahedron algebra
q-inverting pairs of linear transformations and the q-tetrahedron algebra arxiv:math/0606237v1 [math.rt] 10 Jun 2006 Tatsuro Ito and Paul Terwilliger Abstract As part of our study of the q-tetrahedron
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationSpectral inequalities and equalities involving products of matrices
Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Updated: April 14, 017 Total Positivity The final and historically the original motivation is from the study of total positive matrices, which
More informationProblems in Linear Algebra and Representation Theory
Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific
More informationarxiv: v3 [math.ra] 10 Jun 2016
To appear in Linear and Multilinear Algebra Vol. 00, No. 00, Month 0XX, 1 10 The critical exponent for generalized doubly nonnegative matrices arxiv:1407.7059v3 [math.ra] 10 Jun 016 Xuchen Han a, Charles
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 4 (2010) 118 1147 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Two error-correcting pooling
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko
More informationA note on Samelson products in the exceptional Lie groups
A note on Samelson products in the exceptional Lie groups Hiroaki Hamanaka and Akira Kono October 23, 2008 1 Introduction Samelson products have been studied extensively for the classical groups ([5],
More informationThe following two problems were posed by de Caen [4] (see also [6]):
BINARY RANKS AND BINARY FACTORIZATIONS OF NONNEGATIVE INTEGER MATRICES JIN ZHONG Abstract A matrix is binary if each of its entries is either or The binary rank of a nonnegative integer matrix A is the
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
More informationImproved Upper Bounds for the Laplacian Spectral Radius of a Graph
Improved Upper Bounds for the Laplacian Spectral Radius of a Graph Tianfei Wang 1 1 School of Mathematics and Information Science Leshan Normal University, Leshan 614004, P.R. China 1 wangtf818@sina.com
More informationFinal Project # 5 The Cartan matrix of a Root System
8.099 Final Project # 5 The Cartan matrix of a Root System Thomas R. Covert July 30, 00 A root system in a Euclidean space V with a symmetric positive definite inner product, is a finite set of elements
More informationRIGHT-LEFT SYMMETRY OF RIGHT NONSINGULAR RIGHT MAX-MIN CS PRIME RINGS
Communications in Algebra, 34: 3883 3889, 2006 Copyright Taylor & Francis Group, LLC ISSN: 0092-7872 print/1532-4125 online DOI: 10.1080/00927870600862714 RIGHT-LEFT SYMMETRY OF RIGHT NONSINGULAR RIGHT
More informationA Generalization of VNL-Rings and P P -Rings
Journal of Mathematical Research with Applications Mar, 2017, Vol 37, No 2, pp 199 208 DOI:103770/jissn:2095-2651201702008 Http://jmredluteducn A Generalization of VNL-Rings and P P -Rings Yueming XIANG
More informationTRIVIAL MAXIMAL 1-ORTHOGONAL SUBCATEGORIES FOR AUSLANDER 1-GORENSTEIN ALGEBRAS
J. Aust. Math. Soc. 94 (2013), 133 144 doi:10.1017/s1446788712000420 TRIVIAL MAXIMAL 1-ORTHOGONAL SUBCATEGORIES FOR AUSLANDER 1-GORENSTEIN ALGEBRAS ZHAOYONG HUANG and XIAOJIN ZHANG (Received 25 February
More informationQUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY
QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY D.D. Olesky 1 Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6 Michael Tsatsomeros Department of Mathematics
More informationThe minimum rank of matrices and the equivalence class graph
Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationResearch Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field
Complexity, Article ID 6235649, 9 pages https://doi.org/10.1155/2018/6235649 Research Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field Jinwang Liu, Dongmei
More informationChapter 1 Vector Spaces
Chapter 1 Vector Spaces Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 110 Linear Algebra Vector Spaces Definition A vector space V over a field
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationA CHARACTERIZATION OF GORENSTEIN DEDEKIND DOMAINS. Tao Xiong
International Electronic Journal of Algebra Volume 22 (2017) 97-102 DOI: 10.24330/ieja.325929 A CHARACTERIZATION OF GORENSTEIN DEDEKIND DOMAINS Tao Xiong Received: 23 November 2016; Revised: 28 December
More informationLecture 7. Econ August 18
Lecture 7 Econ 2001 2015 August 18 Lecture 7 Outline First, the theorem of the maximum, an amazing result about continuity in optimization problems. Then, we start linear algebra, mostly looking at familiar
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationThe endomorphisms of Grassmann graphs
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn. ISSN 1855-3974 (electronic edn. ARS MATHEMATICA CONTEMPORANEA 10 (2016 383 392 The endomorphisms of Grassmann graphs Li-Ping Huang School
More informationarxiv: v2 [math.co] 17 Mar 2016
COUNTING ZERO KERNEL PAIRS OVER A FINITE FIELD SAMRITH RAM arxiv:1509.08053v2 [math.co] 17 Mar 2016 Abstract. Helmke et al. have recently given a formula for the number of reachable pairs of matrices over
More informationMath 321: Linear Algebra
Math 32: Linear Algebra T. Kapitula Department of Mathematics and Statistics University of New Mexico September 8, 24 Textbook: Linear Algebra,by J. Hefferon E-mail: kapitula@math.unm.edu Prof. Kapitula,
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationLECTURE 3: REPRESENTATION THEORY OF SL 2 (C) AND sl 2 (C)
LECTURE 3: REPRESENTATION THEORY OF SL 2 (C) AND sl 2 (C) IVAN LOSEV Introduction We proceed to studying the representation theory of algebraic groups and Lie algebras. Algebraic groups are the groups
More informationA 2 G 2 A 1 A 1. (3) A double edge pointing from α i to α j if α i, α j are not perpendicular and α i 2 = 2 α j 2
46 MATH 223A NOTES 2011 LIE ALGEBRAS 11. Classification of semisimple Lie algebras I will explain how the Cartan matrix and Dynkin diagrams describe root systems. Then I will go through the classification
More informationOn the Grassmann modules for the symplectic groups
On the Grassmann modules for the symplectic groups Bart De Bruyn Ghent University, Department of Pure Mathematics and Computer Algebra, Krijgslaan 81 (S), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be
More informationMATHEMATICS 217 NOTES
MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable
More informationALGEBRAIC GEOMETRY I - FINAL PROJECT
ALGEBRAIC GEOMETRY I - FINAL PROJECT ADAM KAYE Abstract This paper begins with a description of the Schubert varieties of a Grassmannian variety Gr(k, n) over C Following the technique of Ryan [3] for
More informationIntroduction to Association Schemes
Introduction to Association Schemes Akihiro Munemasa Tohoku University June 5 6, 24 Algebraic Combinatorics Summer School, Sendai Assumed results (i) Vandermonde determinant: a a m =. a m a m m i
More informationarxiv: v1 [math.co] 10 Aug 2016
POLYTOPES OF STOCHASTIC TENSORS HAIXIA CHANG 1, VEHBI E. PAKSOY 2 AND FUZHEN ZHANG 2 arxiv:1608.03203v1 [math.co] 10 Aug 2016 Abstract. Considering n n n stochastic tensors (a ijk ) (i.e., nonnegative
More informationChapter 7. Tridiagonal linear systems. Solving tridiagonal systems of equations. and subdiagonal. E.g. a 21 a 22 a A =
Chapter 7 Tridiagonal linear systems The solution of linear systems of equations is one of the most important areas of computational mathematics. A complete treatment is impossible here but we will discuss
More informationRANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA
Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,
More informationON REGULARITY OF RINGS 1
ON REGULARITY OF RINGS 1 Jianlong Chen Department of Mathematics, Harbin Institute of Technology Harbin 150001, P. R. China and Department of Applied Mathematics, Southeast University Nanjing 210096, P.
More informationTotal 100
Math 542 Midterm Exam, Spring 2016 Prof: Paul Terwilliger Your Name (please print) SOLUTIONS NO CALCULATORS/ELECTRONIC DEVICES ALLOWED. MAKE SURE YOUR CELL PHONE IS OFF. Problem Value 1 10 2 10 3 10 4
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationPolynomials with palindromic and unimodal coefficients
Polynomials with palindromic and unimodal coefficients arxiv:60.05629v [math.co] 2 Jan 206 Hua Sun, Yi Wang, Hai-Xia Zhang School of Mathematical Sciences, Dalian University of Technology, Dalian 6024,
More informationPossible numbers of ones in 0 1 matrices with a given rank
Linear and Multilinear Algebra, Vol, No, 00, Possible numbers of ones in 0 1 matrices with a given rank QI HU, YAQIN LI and XINGZHI ZHAN* Department of Mathematics, East China Normal University, Shanghai
More information