Hindawi Publishing Corporation Journal of Applied Mathematics Volume 2013, Article ID 732808, 7 pages http://dx.doi.org/10.1155/2013/732808 Research Article Lattices Generated by Two Orbits of Subspaces under Finite Singular Symplectic Groups Xuemei Liu College of Science, Civil Aviation University of China, Tianjin 300300, China Correspondence should be addressed to Xuemei Liu; xm-liu771216@163.com Received 29 September 2012; Revised 18 November 2012; Accepted 21 November 2012 Academic Editor: P. G. L. Leach Copyright © 2013 Xuemei Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. In the paper titled “Lattices generated by two orbits of subspaces under finite classical group” by Wang and Guo. The subspaces in the lattices are characterized and the geometricity is classified. In this paper, the result above is generalized to singular symplectic space. This paper characterizes the subspaces in these lattices, classifies their geometricity, and computes their characteristic polynomials. 1. Introduction In the following we recall some definitions and facts on ordered sets and lattices (see [1]). Let π denote a finite set. A partial order on π is a binary relation ≤ on π such that (1) π(0) = 0, (2) π(π) = π(π) + 1, whenever π < ⋅π. Let π be a finite poset with 0 and 1. The polynomial (1) π ≤ π for any π ∈ π. (2) π ≤ π and π ≤ π implies π = π. π (π, π₯) = ∑ π (0, π) π₯π(1)−π(π) , (3) π ≤ π and π ≤ π implies π ≤ π. π∈π By a partial ordered set (or poset for short), we mean a pair (π, ≤), where π is a finite set and ≤ is a partial order on π. As usual, we write π < π whenever π ≤ π and π =ΜΈ π. By abusing notation, we will suppress reference to ≤, and just write π instead of (π, ≤). Let π be a poset and let π be a commutative ring with the identical element. A binary function π(π, π) on π with values in π is said to be the MoΜbius function of π if 1, ∑ π (π, π) = { 0, π≤π≤π with 0, (resp., 1). Let π be a finite poset with 0. By a rank function on π, we mean a function π from π to the set of all the nonnegative integers such that if π = π, otherwise. (1) For any two elements π, π ∈ π, we say π covers π, denoted by π < ⋅π, if π < π and there exists no π ∈ π such that π < π < π. An element π of π is said to be minimal, (resp., maximal) whenever there is no element π ∈ π such that π < π, (resp., π > π). If π has a unique minimal, (resp., maximal) element, then we denote it by 0, (resp., 1) and say that π is a poset (2) is called the characteristic polynomial of π, where π is the rank function of π. A poset π is said to be a lattice if both π ∨ π := sup{π, π} and π∧π := inf{π, π} exist for any two elements π, π ∈ π. Let π be a finite lattice with 0. By an atom in π, we mean an element in π covering 0. We say π is atomic lattice if any element in π \ {0} is a union of atoms. A finite atomic lattice π is said to be a geometric lattice if π admits a rank function π satisfying π (π ∧ π) + π (π ∨ π) ≤ π (π) + π (π) , ∀π, π ∈ π. (3) In this section we will introduce the concepts of subspaces of type (π, π , π) in singular symplectic spaces. Notation and terminologies will be adopted from Wan’s book [2]. We always assume that πΎπ,π 0 πΌ(π) = (−πΌ(π) 0 0(π) ). (4) 2 Journal of Applied Mathematics Let πΉπ be a finite field with π elements, where π is a prime power, and let πΈ denote the subspace of πΉπ(2π+π) generated by π2π+1 , π2π+2 , . . . , π2π+π , where ππ is the row vector in πΉπ(2π+π) whose πth coordinate is 1 and all other coordinates are 0. The singular symplectic group of degree 2π + π over πΉπ , denoted by ππ2π+π,2π (πΉπ ), consists of all (2π + π) × (2π + π) nonsingular matrices π over πΉπ satisfying ππΎπ ππ‘ = πΎπ . The row vector space πΉπ(2π+π) together with the right multiplication action of ππ2π+π,2π (πΉπ ) is called the (2π + π)-dimensional singular symplectic space over πΉπ . An π-dimensional subspace π in the (2π+π)-dimensional singular symplectic space is said to be of type (π, π , π), if ππΎπ ππ‘ is of rank 2π and dim(π ∩ πΈ) = π. In particular, subspaces of type (π, 0, 0) are called π-dimensional totally isotropic subspaces. Clearly, singular symplectic group ππ2π+π,2π (πΉπ ) is transitive on the set of all subspaces of the same type in πΉπ(2π+π) , see [2, Theorems 3.22]. The results on the lattices generated by one orbit of subspaces under finite classical groups may be found in Gao and You [3], Huo et al. [4–6], Huo and Wan [7], Orlik and Solomon [8], Wang and Feng [9], Wang and Guo [10], and Wang and Li [11]. For 1 ≤ π1 ≤ π2 ≤ 2π − 1, 0 ≤ π1 ≤ π2 ≤ π, let πΏ 1 (π1 , π 1 , π1 ; 2π + π, π), (resp., πΏ 2 (π2 , π 2 , π2 ; 2π + π, π)) denote the set of all subspaces which are sums (resp. intersections) of subspaces in π(π1 , π 1 , π1 ; 2π + π, π), (resp., π(π2 , π 2 , π2 ; 2π + π, π)) such that π(π2 , π 2 , π2 ; 2π + π, π) ⊆ πΏ 1 (π1 , π 1 , π1 ; 2π + π, π), (resp., π(π1 , π 1 , π1 ; 2π + π, π) ⊆ πΏ 2 (π2 , π 2 , π2 ; 2π + π, π)). Suppose πΏ(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π+π, π) denotes the intersection of πΏ 1 (π1 , π 1 , π1 ; 2π+π, π) and πΏ 2 (π2 , π 2 , π2 ; 2π+π, π) containing 0 and πΉπ(2π+π) . By ordering πΏ(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π) by ordinary or reverse inclusion, two families of atomic lattices are obtained, denoted by πΏ π(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π+ π, π) or πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π), respectively. Wang and Guo [12] discussed the geometricity of the two lattices when π = 0. In this paper, we generalized their result to general case, characterizes the subspaces in these lattices in Section 2, classify their geometricity in Section 3, and computes their characteristic polynomials in Section 4. 2. Characterization of Subspaces Contained in πΏ(π1 ,π 1 ,π1 ;π2 ,π 2 ,π2 ;2π+π,π) Lemma 1. Let 2π + π > 0, 0 ≤ π ≤ π, 2π ≤ π − π ≤ π + π and π − π ≥ 1. For any subspace π of type (π + 1, π , π + 1), there are two subspaces π1 and π2 of type (π, π , π) such that π = π1 + π2 . Proof. Assume that ππΎπ ππ = ( Write π = ( π011 π1 = ( π11 π12 σΈ 0 π22 0 π§1 π12 π22 2π π ππ 0 2π ) π + 1 − (π + 1) − 2π . 0 π+1 ) π+1−(π+1) , where π22 = ( π+1 ) and π2 = ( π11 π12 σΈ 0 π22 0 π§2 ) π+1−(π+1) π−1 1 type (π, π , π), such that π = π1 + π2 . σΈ π22 π§1 π§2 ) π−1 1 . 1 (5) Then are subspace of Lemma 2. Let 2π + π > 0, 0 ≤ π ≤ π, 2π ≤ π − π ≤ π + π and π =ΜΈ 2π + π. For any subspace π of type (π + 1, π + 1, π), there are two subspaces π1 and π2 of type (π, π , π) such that π = π1 + π2 . Proof. Assume that ππΎπ ππ ππ 2π π+1−2π −π−2 , 2 π 0 π0 π+1−π−2 π11 =( π₯1 ) 1 , π₯1 and π¦1 1 ( 0 π1 ) write = π =( π0 π0 π¦1 π¦1 π ( π₯1 ) πΎπ ( π₯1 ) π11 π12 π+1−π σΈ ) , π 0 π22 2π = where π π¦1 are the (π + 1 − (π + 1))-th and (π − π + 1)-th row vectors of π11 , respectively. π0σΈ π12 =( π₯1σΈ ) π¦1σΈ π+1−π−2 σΈ ,π₯ 1 1 1 and π¦1σΈ are the (π + 1 − (π + 1))-th and (π − π + 1)-th row vectors of π12 , respectively. Then π0 π0σΈ π+1−π−2 1 π1 = (π₯1 π₯1σΈ ) π, 0 π22 π0 π0σΈ π+1−π−2 1 π2 = (π¦1 π¦1σΈ ) π 0 π22 (6) are subspace of type (π, π , π), such that π = π1 + π2 . Theorem 3. Let 2π + π > 0, assume that (π, π , π), (π1 , π 1 , π1 ) satisfy 0 ≤ π ≤ π, 2π ≤ π − π ≤ π + π , 0 ≤ π1 ≤ π, 2π ≤ π1 − π1 ≤ π + π . For any subspace π of type (π, π , π), there are subspace π1 , π2 , . . . , ππ of type (π1 , π 1 , π1 ) such that π = π1 + π2 + ⋅ ⋅ ⋅ + ππ if and only if (i) π = π 1 = π, (ii) π < π, 0 ≤ π1 ≤ π ≤ π, π1 = π = π, π − π1 ≥ π − π 1 ≥ 0, (iii) π < π, 0 ≤ π1 ≤ π ≤ π, (π − π) − (π1 − π1 ) ≥ π − π 1 ≥ 0. (7) (8) (9) Proof. Suppose that (π, π , π) and (π1 , π 1 , π1 ) satisfy condition (7). Let π − π1 = β(β ≥ 0), since π = π 1 = π, π = 2π + π, π1 = 2π + π1 , π − π1 = π − π1 = β, By Lemma 1 the desired result follows. Suppose (π, π , π) and (π1 , π 1 , π1 ) satisfy condition (8). Let π − π 1 = π‘, π − π1 = π‘ + π‘σΈ (π‘, π‘σΈ ≥ 0). By Lemma 1, any subspace of type (π, π , π) is the sum some subspaces of type (π − π‘, π , π). By Lemma 2, any subspace of type (π − π‘, π , π) is the sum some subspaces of type (π1 , π 1 , π). Hence the desired result follows. Suppose (π, π , π) and (π1 , π 1 , π1 ) satisfy condition (9). Let π − π 1 = π‘, π − π1 = β, π − π1 = π‘ + β + π‘σΈ (π‘, π‘σΈ , β ≥ 0), By Lemma 1, we have any subspace of type (π, π , π) is the sum some subspace of type (π − π‘σΈ , π , π). By Lemma 2, we have any subspace of type (π − π‘σΈ , π , π) is the sum some subspace of type (π − π‘σΈ − π‘, π 1 , π). By Lemma 1, we have any subspace of type (π − π‘σΈ − π‘, π 1 , π) is the sum some subspace of type (π1 , π 1 , π1 ). Hence the desired result follows. Conversely, If π 1 = π, then π = π, π1 ≤ π. Let π ∈ π(π, π, π; 2π + π, π), there exists π ∈ π(π1 , π, π1 ; 2π + π, π), Journal of Applied Mathematics such that π ⊂ π, hence π ∩ πΈ ⊂ π ∩ πΈ, π1 = dim(π ∩ πΈ) ≤ dim(π ∩ πΈ) = π. Therefore, π = π 1 = π, 0 ≤ π1 ≤ π ≤ π, condition (7) hold. If π 1 < π, let π ∈ π(π1 , π, π1 ; 2π + π, π), π ∈ π(π, π, π : 2π + π, π), such that π ⊂ π, then π ∩ πΈ ⊂ π ∩ πΈ, and π1 = dim(π ∩ πΈ) ≤ dim(π ∩ πΈ) = π. If π1 = π, then π = π and π1 ≥ π, π12 π−1 ) π where rank π11 = π − π, rank Assume π = ( π011 π 22 2π π π22 = π and π11 πΎππ‘ = π(π − π, π ). Since π ∩ πΈ ⊂ π ∩ πΈ, there exists a π × π matrix π22 with rank π22 = π, such that π22 π22 is a matrix representation of subspace π ∩ πΈ. Thus we can assume π = ( π011 ππ1222 ) π1π−1 , where π11 is a matrix with rank π1 − π. 2π π Because π is a subspaces of type (π1 , π 1 , π), we can assume π‘ = π(π1 − π, π ). Then π11 can be considered π11 π(π − π, π )π11 as a subspace of type (π1 − π, π 1 ) in singular symplectic space πΉπ(2π +(π−2π −π)) . Hence π1 − π − π − π 1 ≤ π − 2π − π, condition (8) hold. Similarly we also can prove condition (9) hold. Theorem 4. Let 2π + π > 0, assume that (π, π , π) and (π2 , π 2 , π2 ) satisfy 0 ≤ π ≤ π, 2π ≤ π − π ≤ π + π , 0 ≤ π2 ≤ π, 2π 2 ≤ π2 − π2 ≤ π + π . For any subspace π of type (π, π , π), there are subspace π1 , π2 , . . . , ππ of type (π2 , π 2 , π2 ) such that π = π1 ∩ π2 ∩ ⋅ ⋅ ⋅ ∩ ππ if and only if (i) π = π 2 = π, 0 ≤ π2 ≤ π ≤ π, (ii) π < π, π2 = π = π and π2 − π ≥ π 2 − π ≥ 0, (iii) π < π, π ≤ π2 ≤ π and (π2 − π2 ) − (π − π) ≥ π 2 − π ≥ 0. Proof. By [3], it is directed. Theorem 5. For 1 ≤ π1 ≤ π2 ≤ 2π + π, πΏ(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π) consist of {0}, πΉπ(2π+π) and all subspaces of type (π, π , π) in πΉπ(2π+π) such that (i) π = π 1 = π 2 = π, 0 ≤ π1 ≤ π2 ≤ π ≤ π, (ii) π < π, π1 = π = π2 = π and π − π1 ≥ π − π 1 ≥ 0, π2 − π ≥ π 2 − π ≥ 0, (iii) π < π, π1 ≤ π ≤ π2 ≤ π and (π2 − π2 ) − (π − π) ≥ π 2 − π ≥ 0, (π − π) − (π1 − π1 ) ≥ π − π 1 ≥ 0. Proof. By Theorems 3 and 4, it is directed. 3. The Geometricity of Lattices πΏ π(π1 ,π 1 ,π1 ;π2 ,π 2 ,π2 ;2π + π,π) and πΏ π (π1 ,π 1 ,π1 ;π2 ,π 2 ,π2 ;2π + π,π) Lemma 6 (see [3]). If 0 < π < π, then (i) πΏ π (2π+π, π, π; 2π+π, π) β πΏ π (π, π), πΏ π(2π+π, π, π; 2π+ π, π) β πΏ π(π, π), 3 (ii) πΏ π (π, π , 0; 2π + π, π) β πΏ π (π, π ; 2π), πΏ π(π, π , 0; 2π + π, π) β πΏ π(π, π ; 2π). Theorem 8. Let 2π + π > 0. Assume that (π1 , π 1 , π1 ), (π2 , π 2 , π2 ) satisfies 0 ≤ π1 ≤ π, 2π 1 ≤ π1 − π1 ≤ π + π 1 , 0 ≤ π2 ≤ π, 2π 2 ≤ π2 − π2 ≤ π + π 2 and 1 ≤ π1 ≤ π2 < 2π + π. Then (i) πΏ π(π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π) is a finite geometric lattice if and only if π = 0, π, (ii) πΏ π(π, 0, π; 2π + π, π, π; 2π + π, π) is a finite geometric lattice if and only if π = 1, π − 1, (iii) πΏ π(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π) is not a geometric lattice when 2 ≤ π1 − π1 ≤ π2 − π2 ≤ 2π − 2. Proof. For any π ∈ πΏ π(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π), define 0, if π = 0, { { if π = πΉπ(2π+π) , ππ (π) = {π2 − π1 + 2, { {dim π − π1 + 1, otherwise. (10) Then ππ is the rank function of πΏ π(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π). (i) For lattice πΏ π(π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π). If π = 0, by Lemma 7, πΏ π(1, 0, 0; 2π − π, π − 1, 0; 2π + π, π) β πΏ π(1, 0, 2π − 1, π − 1; 2π), by [12], πΏ π(π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π) is a finite geometric lattice. If π = π, by Lemma 7, πΏ π(π + 1, 0, π; 2π − π + π, π − 1, π; 2π + π, π) β πΏ π(1, 0, 2π − 1, π − 1; 2π), by [12], πΏ π(π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π) is a finite geometric lattice. If 0 < π < π. Let π = β¨π1 , π2π+1 , . . . , π2π+π β© and π = β¨ππ+1 , π2π+2 , . . . , π2π+π+1 β©, then π and π both are of type (π + 1, 0, π), β¨π, πβ© is of type (π + 3, 1, π + 1), β¨π, πβ© ∈ πΏ π(π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π), π ∩ π is of type (π − 1, 0, π − 1), hence ππ(π ∧ π) = 0, ππ(π ∨ π) = 3, ππ(π) = ππ(π) = 1. We have ππ (π ∧ π) + ππ (π ∨ π) = 3 > ππ (π) + ππ (π) = 2. (11) That is πΏ π(π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π) is not a geometric lattice when 0 < π < π. (ii) For lattice πΏ π(π, 0, π; 2π + π, π, π; 2π + π, π), by Lemma 6 πΏ π(π, 0, π; 2π + π, π, π; 2π + π, π) β πΏ π(π, π). If π = 1, π−1, πΏ π(1, π) and πΏ π(π−1, π) is a geometric lattice. If 2 ≤ π ≤ π − 2, let π£1 , π£2 , . . . , π£π be a basis of πΉπ(π) . Since 2 ≤ π ≤ π − 2, we can take π = β¨π£1 , π£2 , . . . , π£π β©, π = β¨π£3 , π£4 , . . . , π£π+2 β© ∈ πΏ π(π, π). Hence π ∧ π = {0}, π ∨ π = β¨π, πβ©, ππ(π ∧ π) = 0, ππ(π ∨ π) = 3, ππ(π) = ππ(π) = 1. We have (ii) πΏ π (π, 0, π; 2π + π, π) β πΏ π (π, π), πΏ π(π, 0, π; 2π + π, π) β πΏ π(π, π). ππ (π ∧ π) + ππ (π ∨ π) = 3 > ππ (π) + ππ (π) = 2. (12) Lemma 7 (see [3]). If 0 ≤ π < π and 2π ≤ π − π ≤ π + π , then That is πΏ π(π, 0, π; 2π+π, π, π; 2π+π, π) is not a geometric lattice when 2 ≤ π ≤ π − 2. (iii) For lattice πΏ π(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π+π, π), when 2 ≤ π1 − π1 ≤ π2 − π2 ≤ 2π − 2. (i) πΏ π (π, π , π; 2π + π, π) β πΏ π (π − π, π ; 2π), πΏ π(π, π , π; 2π + π, π) β πΏ π(π − π, π ; 2π), 4 Journal of Applied Mathematics Case (a). π1 ≤ π2 ≤ π. (a1 ) π 2 > 0, Let πΌ(π 2 −1) 0 ( π= 0 0 π 2 −1 π= 0 0 0 0 0 0 0 0 0 0 0 0 0 0 πΌ(π 2 ) 0 ) 0 , 0 0 0 0 0 0 πΌ(π2 −π2 −2π 2 ) 0 0 0 0 0 0 πΌ(π2 ) 0 1 π2 −π2 −2π 2 π+π 2 −π2 +π2 π 2 π2 −π2 −2π 2 π+π 2 −π2 +π2 π2 π−π2 (13) 0 1 0 0 0 0 0 0 0 0 ) 0 0 0 0 0 0 0 0 πΌ(π2 ) 0 . π 2 −1 1 π2 −π2 −2π 2 1 π+π 2 −π2 +π2 π 2 π2 −π2 −2π 2 π+π 2 −π2 +π2 π2 π−π2 ( Then π is a of type (π2 − 1, π 2 − 1, π2 ), π is a of type (π2 + 1, 0, π2 ), β¨π, πβ© is a of type (π2 , π 2 − 1, π2 ), ππ(π ∨ π) = ππ(πΉπ(2π+π) ) = π2 − π1 + 2, ππ(π ∧ π) = π2 − π1 + 1, ππ(π) = π2 − 1 − π1 + 1 = π2 − π1 , ππ(π) = π2 + 1 − π1 + 1 = π2 − π1 + 2, ππ(π ∨ π) + ππ(π ∧ π) = π2 − 2π1 + π2 + 3, ππ(π) + ππ(π) = π2 − 2π1 + π2 + 2. We have πΌ(π 2) 0 ( π= 0 0 π 2 ππ (π ∨ π) + ππ (π ∧ π) > ππ (π) + ππ (π) . Hence, πΏ π(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π) is not a geometric lattice when (a1 ). (a2 ) π 2 > 0, π2 − π2 = π + π 2 or π 2 = 0. When π 2 = 0, we have π2 −π2 −2π 2 ≥ 1, when π 2 > 0, π2 −π2 = π + π 2 , we have π − 2 ≥ π 2 , π2 − π2 − 2π 2 − 1 = π − π 2 − 1 ≥ 1. Let 0 0 0 0 0 0 0 0 0 πΌ(π 2) 0 0 0 0 πΌ(π2−π2−2π 2) 0 0 0 0 0 π2 −π2 −2π 2 −1 1 π+π 2 −π2 +π2 π 2 π2 −π2 −2π 2 −1 π= ( (14) 0 0 0 0 0 0 0 0 ) , 0 0 0 0 (π2) 0 0 0 πΌ 1 π+π 2 −π2 +π2 π2 π−π2 (15) 0 1 0 0 0 0 0 0 ) (π2 ) 0 . 0 0 0 0 0 0 πΌ π 2 1 π − π 2 − 1 π 2 1 π − π 2 − 1 π2 π − π2 Then π is a of type (π2 − 1, π 2 , π2 ), π is a of type (π2 + 1, 0, π2 ), β¨π, πβ© is a of type (π2 , π 2 + 1, π2 ), clearly, we have ππ (π ∨ π) + ππ (π ∧ π) > ππ (π) + ππ (π) . (16) Hence, πΏ π(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π) is not a geometric lattice when (a2 ). Case (b). π1 = π2 = π. In this case πΏ π(π1 , π 1 , π; π2 , π 2 , π; 2π + π, π) β πΏ π(π1 − π, π 1 ; π2 − π, π 2 ; 2π), πΏ π(π1 , π 1 , π; π2 , π 2 , π; 2π + π, π) is not a geometric lattice. Hence πΏ π(π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π+π, π) is not a geometric lattice when 2 ≤ π1 − π1 ≤ π2 − π2 ≤ 2π − 2. Theorem 9. Let 2π + π > 0. Assume that (π1 , π 1 , π1 ), (π2 , π 2 , π2 ) satisfies 0 ≤ π1 ≤ π, 2π 1 ≤ π1 − π1 ≤ π + π 1 , 0 ≤ π2 ≤ π, 2π 2 ≤ π2 − π2 ≤ π + π 2 and 1 ≤ π1 ≤ π2 < 2π + π. Then (i) πΏ π (π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π) is a finite geometric lattice if and only if π = 0, π, (ii) πΏ π (π, 0, π; 2π + π, π, π; 2π + π, π) is a finite geometric lattice if and only if π = 1, π − 1, (iii) πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π) is not a geometric lattice when 2 ≤ π1 − π1 ≤ π2 − π2 ≤ 2π − 2. Proof. (i) For π ∈ πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π), define ππ (π) 0, { { = {π2 − π1 + 2, { {π2 + 1 − dim π, if π = πΉπ((2π+π)) , if π = 0, otherwise. (17) For lattice πΏ π (π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π). If π = 0, by Lemma 7, πΏ π (1, 0, 0; 2π − π, π − 1, 0; 2π + π, π) β πΏ π (1, 0, 2π − 1, π − 1; 2π), by [12], πΏ π (π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π) is a finite geometric lattice. If π = π, by Lemma 7, πΏ π (π + 1, 0, π; 2π − π + π, π − 1, π; 2π + π, π) β πΏ π (1, 0, 2π − 1, π − 1; 2π), by [12], πΏ π (π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π) is a finite geometric lattice. If 0 < π < π, let π = β¨π1 , . . . , ππ−1 , ππ+1 , . . . , π2π , π2π+1 , . . . , π2π+π β©, π = β¨π2 , . . . , ππ , ππ+2 , . . . , π2π+1 , π2π+2 , . . . , π2π+π β©. Then π, π both are of type (2π − 1 + π, π − 1, π), π∧π = β¨π, πβ© is of type (2π+1+π, π, π+1), π∨π = π∩π is of type (2π − 3 + π, π, π). We have π (π ∧ π) + π (π ∨ π) = 3 > π (π) + π (π) = 2. (18) Journal of Applied Mathematics 5 Hence, πΏ π (π + 1, 0, π; 2π − 1 + π, π − 1, π; 2π + π, π) is not a geometric lattice when 0 < π < π. πΌ(π 1) 0 ( 0 π= 0 0 π 1 0 0 0 0 0 0 0 πΌ(π 1 ) 1 0 0 0 0 0 0 πΌ(π1 −π1 −2π 1 ) 0 0 0 0 1 π1 −π1 −2π 1 π+π 1 −π1 +π1 −1 π 1 0 0 πΌ(π 1) 0 0 0 0 0 0 0 0 πΌ(π1 −π1 −2π 1 ) 0 0 0 π 1 π1 −π1 −2π 1 π+π 1 −π1 +π1 −1 0 0 (0 π= 0 0 1 (ii) if π = 0, π − 1, by Lemma 7 πΏ π (π, 0, π; 2π + π, π, π; 2π + π, π) β πΏ π (π, π) when π = 1, π−1, πΏ π (π, 0, π; 2π+π, π, π; 2π+π, π) is a geometric lattice. If 2 ≤ π ≤ π − 2, by [7], πΏ π (π, π) is not a geometric lattice. (iii) Case (a). if π1 −π1 < π+π 1 , then π+π 1 −π1 +π1 −1 ≥ 0. Let 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 πΌ(π1) 1 π1 −π1 −2π 1 π+π 1 −π1 +π1 π1 0 0 0 0 0 0 0 0 0 πΌ(π 1 ) 1 0 0 0 0 0 0 0 0 0 0 0 0 0 πΌ(π1) 1 π 1 π1 −π1 −2π 1 π+π 1 −π1 +π1 −1 π1 Then π, π are of type (π1 + 1, π 1 , π1 ), π ∩ π is of type (π1 , π 1 − 1, π1 ), β¨π, πβ© is of type (π1 + 1, π 1 , π1 ), β¨π, πβ© ∈ πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π), π ∩ π ∉ πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π). So ππ (π ∨ π) = π2 − π1 + 2, ππ (π ∧ π) = π2 − π1 − 1, ππ (π) = π2 + 1 − (π1 + 1) = π2 − π1 = ππ (π). We have ππ (π ∧ π) + ππ (π ∨ π) = 2π2 − 2π1 + 1 0 0 0) , 0 0 π−π1 0 0 0) . 0 0 π−π1 > ππ (π) + ππ (π) = 2π2 − 2π1 . (20) Hence πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π) is not a geometric lattice when (a). Case (b). π1 − π1 = π + π 1 , from π1 − π1 = π + π 1 , and 2 ≤ π1 − π1 ≤ 2π − 2, we have π − 2 ≥ π 1 , π1 − π1 − 2π 1 − 2 = π − π 1 − 2 ≥ 0. Let πΌ(π 1) 0 ( 0 ( 0 π= ( 0 0 ( 0 π 1 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 πΌ(π 1) 0 0 0 0 1 0 0 0 0 0 0 πΌ(π1−π1−2π 1) 0 0 0 0 0 0 0 0 1 π1 −π1 −2π 1 π+π 1 −π1 +π1 π 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 πΌ(π1) 1 π1 −π1 −2π 1 π+π 1 −π1 +π1 π1 0 0 0) 0) ), 0 0 0) π−π1 πΌ(π 1) 0 ( 0 ( 0 π= ( 0 0 ( 0 π 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 πΌ(π 1) 0 0 0 0 1 0 0 0 0 0 0 πΌ(π1−π1−2π 1) 0 0 0 0 0 0 0 0 1 π1 −π1 −2π 1 π+π 1 −π1 +π1 π 1 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 πΌ(π1) 1 π1 −π1 −2π 1 π+π 1 −π1 +π1 π1 0 0 0) 0) ). 0 0 0) π−π1 Then π, π are of type (π1 + 1, π 1 + 1, π1 ), π ∩ π is of type (π1 , π 1 + 1, π1 ), and β¨π, πβ© is of type (π1 + 2, π 1 + 2, π1 ). (19) (21) So ππ (π ∨ π) = π2 − π1 , ππ (π ∧ π) = π2 + 1 − (π1 + 2) = π2 − π1 − 1, ππ (π ∧ π) + ππ (π ∨ π) = 2π2 − 2π1 + 1 > ππ (π) + ππ (π) = 2π2 − 2π1 . 6 Journal of Applied Mathematics Hence πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π+π, π) is not a geometric lattice when (b). Hence πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π+π, π) is not a geometric lattice when 2 ≤ π1 − π1 ≤ π2 − π2 ≤ 2π − 2. 4. Characteristic Polynomial of Lattice πΏ π (π1 ,π 1 ,π1 ;π2 ,π 2 ,π2 ;2π+π,π) = π‘π2 −π1 +2 π2 Theorem 10. Let 2π + π > 0, Assume that (π, π , π) satisfies 0 ≤ π ≤ π, 2π ≤ π − π ≤ π + π and 0 < π < 2π + π. Then π (πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π) , π‘) π 2 π1 −(π−π1 )+(π −π 1 ) ∑ π=π1 π =π 1 π=π2 −(π2 −π)+(π 2 −π )+1 π (π, π , π; 2π + π, π) ππ (π‘) π1 π 1 −1 π+π +π +∑ ∑ ∑ π (π, π , π; 2π + π, π) ππ (π‘) π=0 π =0 π=2π +π π π + ∑ ∑ π+π +π ∑ π (π, π , π; 2π + π, π) ππ (π‘) . π=π2 π =π 2 +1 π=2π +π π2 −π1 +2 =π‘ (28) π 2 − ∑ ∑ π1 −(π−π1 )+(π −π 1 ) π (π, π , π; 2π + π, π) ππ (π‘) ∑ π=π1 π =π 1 π=π2 −(π2 −π)+(π 2 −π )+1 Acknowledgments π1 π 1 −1 π+π +π +∑ ∑ ∑ π (π, π , π; 2π + π, π) ππ (π‘) This work is supported by the National Natural Science Foundation of China under Grant no. 61179026 and Supported by the Fundamental Research Funds for the Central Universities (ZXH2012 K003). π=0 π =0 π=2π +π π π (πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π) , π‘) − ∑ ∑ In this section we compute the characteristic polynomial of the lattice πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π). π by Theorem 5 we have π + ∑ ∑ π+π +π ∑ π (π, π , π; 2π + π, π) ππ (π‘) , π=π2 π =π 2 +1 π=2π +π (22) π where ππ (π‘) = ∏π−1 π=0 (π‘ − π ). Proof. Define 0, if π = πΉπ(2π+π) , { { { { ππ (π) = {π2 − π1 + 2, if π = {0} , { { { {π2 + 1 − dim (π) , otherwise. (23) Then ππ is the rank function on πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π). Let π = πΉπ(2π+π) , πΏ π = πΏ π (2π + π, π), πΏ = πΏ π (π1 , π 1 , π1 ; π2 , π 2 , π2 ; 2π + π, π) we have 2π+π−1 π (πΏ π, π‘) = ∏ (π‘ − ππ ) . (24) π=0 For any π ∈ πΏ, define πΏπ = {π ∈ πΏ | π ⊂ π} = {π ∈ πΏ | π ≥ π} , πΏππ = {π ∈ πΏ π | π ⊂ π} = {π ∈ πΏ π | π ≥ π} . (25) Clearly, πΏπ = πΏ, πΏπ = πΏππ, when π =ΜΈ {0}, π =ΜΈ π π (πΏπ, π‘) = π (πΏ, π‘) = ∑ π (0, π) π‘π(1)−π(π) π∈πΏ = ∑ π (0, π) π‘π(0)−π(π) . (26) π∈πΏ By inversion to MoΜbius we have π (πΏ, π‘) = π (πΏπ, π‘) = π‘π2 −π1 +2 − ∑ π (πΏπ , π‘) , π∈πΏ\{π} (27) References [1] M. Aigner, Combinatorial Theory, vol. 234, Springer, Berlin, Germany, 1979. [2] Z. X. Wan, Geometry of Classical Groups Over Finite Fields, Studentlitteratur, Lund, Sweden, 1993. [3] Y. Gao and H. You, “Lattices generated by orbits of subspaces under finite singular classical groups and its characteristic polynomials,” Communications in Algebra, vol. 31, no. 6, pp. 2927–2950, 2003. [4] Y. J. Huo, Y. Liu, and Z. X. Wan, “Lattices generated by transitive sets of subspaces under finite classical groups. I,” Communications in Algebra, vol. 20, no. 4, pp. 1123–1144, 1992. [5] Y. J. Huo, Y. Liu, and Z. X. Wan, “Lattices generated by transitive sets of subspaces under finite classical groups. II. The orthogonal case of odd characteristic,” Communications in Algebra, vol. 20, no. 9, pp. 2685–2727, 1992. [6] Y. J. Huo, Y. Liu, and Z. X. Wan, “Lattices generated by transitive sets of subspaces under finite classical groups. III. The orthogonal case of even characteristic,” Communications in Algebra, vol. 21, no. 7, pp. 2351–2393, 1993. [7] Y. J. Huo and Z. X. Wan, “On the geometricity of lattices generated by orbits of subspaces under finite classical groups,” Journal of Algebra, vol. 243, no. 1, pp. 339–359, 2001. [8] P. Orlik and L. Solomon, “Arrangements in unitary and orthogonal geometry over finite fields,” Journal of Combinatorial Theory, Series A, vol. 38, no. 2, pp. 217–229, 1985. [9] K. Wang and Y.-q. Feng, “Lattices generated by orbits of flats under finite affine groups,” Communications in Algebra, vol. 34, no. 5, pp. 1691–1697, 2006. [10] K. Wang and J. Guo, “Lattices generated by orbits of totally isotropic flats under finite affine-classical groups,” Finite Fields and Their Applications, vol. 14, no. 3, pp. 571–578, 2008. Journal of Applied Mathematics [11] K. Wang and Z. Li, “Lattices associated with vector spaces over a finite field,” Linear Algebra and Its Applications, vol. 429, no. 2-3, pp. 439–446, 2008. [12] K. Wang and J. Guo, “Lattices generated by two orbits of subspaces under finite classical groups,” Finite Fields and Their Applications, vol. 15, no. 2, pp. 236–245, 2009. 7 Advances in Operations Research Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Advances in Decision Sciences Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Mathematical Problems in Engineering Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Journal of Algebra Hindawi Publishing Corporation http://www.hindawi.com Probability and Statistics Volume 2014 The Scientific World Journal Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Differential Equations Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Volume 2014 Submit your manuscripts at http://www.hindawi.com International Journal of Advances in Combinatorics Hindawi Publishing Corporation http://www.hindawi.com Mathematical Physics Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Journal of Complex Analysis Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Mathematics and Mathematical Sciences Journal of Hindawi Publishing Corporation http://www.hindawi.com Stochastic Analysis Abstract and Applied Analysis Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com International Journal of Mathematics Volume 2014 Volume 2014 Discrete Dynamics in Nature and Society Volume 2014 Volume 2014 Journal of Journal of Discrete Mathematics Journal of Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Applied Mathematics Journal of Function Spaces Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Optimization Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014