Rank-generating functions and Poincaré polynomials of lattices in finite orthogonal space of even characteristic

Feng XU , Yanbing ZHAO , Yuanji HUO

Front. Math. China ›› 2024, Vol. 19 ›› Issue (4) : 181 -189.

PDF (492KB)
Front. Math. China ›› 2024, Vol. 19 ›› Issue (4) : 181 -189. DOI: 10.3868/s140-DDD-024-0011-x
RESEARCH ARTICLE

Rank-generating functions and Poincaré polynomials of lattices in finite orthogonal space of even characteristic

Author information +
History +
PDF (492KB)

Abstract

The geometry of classical groups over finite fields is widely used in many fields. In this paper, we study the rank-generating function, the characteristic polynomial, and the Poincaré polynomial of lattices generated by the orbits of subspaces under finite orthogonal groups of even characteristic. We also determine their expressions.

Keywords

Lattices / orthogonal space of even characteristic / rank-generating function / characteristic polynomial / Poincaré polynomial

Cite this article

Download citation ▾
Feng XU, Yanbing ZHAO, Yuanji HUO. Rank-generating functions and Poincaré polynomials of lattices in finite orthogonal space of even characteristic. Front. Math. China, 2024, 19(4): 181-189 DOI:10.3868/s140-DDD-024-0011-x

登录浏览全文

4963

注册一个新账户 忘记密码

1 Introduction

Earlier literature has introduced and studied the rank-generating functions and characteristic polynomials in partially ordered sets and lattices, as seen in references [1, 2, 7]. Typical group geometry over finite fields displays sound properties, making it widely used in many fields. For example, reference [5] studied the critical problem of non-singular subspaces in orthogonal spaces of even characteristic. References [3, 4] studied the rank function and characteristic polynomial of lattices generated by orbits of subspaces under finite classical groups, and provided corresponding definitions and expressions. Reference [9] studied the rank generating functions and characteristic polynomials generated by orbits of subspaces of finite linear groups, finite symplectic groups, and finite unitary groups under Fqn,Fq2ν,Fq2n, respectively. Reference [6] studied the rank-generating functions and characteristic polynomials in finite orthogonal spaces of even characteristic.

This paper draws on some research methods from reference [6], supplements the rank-generating function and Poincaré polynomial of lattices generated by the orbits of subspaces when the finite orthogonal group of even characteristic O2ν+δ(Fq) is under Fq(2ν+δ) in reference [9], and presents its characteristic polynomial again. Moreover, the calculation method is simpler than that in reference [9]. This paper adopts the terms, notations, and some results from references [1, 6, 8, 9].

2 Preliminaries

As seen from references [5, 8, 9], assume q is the power of 2, and Fq is a finite field with q elements. Let n=2ν+δ, where ν is a non-negative integer while δ=0,1,2. Introduce the notation

Δ={,ifδ=0;1,ifδ=1;(α1α),ifδ=2.

Assume G2ν+δ=[(0I(ν)00),Δ], then ν is said to be the exponent of G2ν+δ, while Δ is its definite part [5, 8, 9]. The group constructed through multiplication of the complete (2ν+δ)×(2ν+δ) matrix T on Fq satisfying TG2ν+δTTG2ν+δ is called an orthogonal group of 2ν+δ order with respect to G2ν+δ on Fq, denoted by O2ν+δ(Fq). The effect of row vector space Fq(2ν+δ) of 2ν+δ dimension and orthogonal group O2ν+δ(Fq) on it is jointly called finite orthogonal space of 2ν+δ dimension of even characteristic on Fq, denoted by Fq(2ν+δ).

Assume P is a subspace of m dimension of Fq(2ν+δ). An m×(2ν+δ) matrix of m rank is also expressed as P. Its row vector generates a subspace P, then we say P is the matrix representation of the subspace P. One subspace P of m dimension in the orthogonal space Fq(2ν+δ) of 2ν+δ dimension is said to be (m,2s+γ,s,Γ)-type subspace with respect to G2ν+δ if PG2ν+δPT displays congruence at [5, 8, 9].

M(m,2s+γ,s)={[G2s,0(m2s)],γ=0;[G2s,0(m2s),1],γ=1;[G2s,(α1α),0(m2s)],γ=2.

G2s=(0I(s)0).Γ={0or1,ife2ν+1Pore2ν+1P,whenδ=γ=1;ϕ(canbedeleted),whenδ1orγ1.

Here, e2v+1 is the row vector of 2ν+δ dimension with the (2ν+1)th component as 1 and the remaining components as 0. If δ1 or γ1, then the (m,2s+γ,s,Γ)-type subspace is denoted by (m,2s+γ,s), where s is the exponent of M(m,2s+γ,s)[9], 0s[mγ2], γ=0,1,2.

Proposition 2.1 [5, 8, 9]  The (m,2s+γ,s,Γ)-type subspace with respect to G2v+δ in Fq(2ν+δ) exists if and only if

2s+γm{ν+s+min{γ,δ},ifδ1orγ1,orγ=δ=1andΓ=1;ν+s,ifγ=δ=1andΓ=0.

M=M(m,2s+γ,s,Γ;2ν+δ) is used to represent the set of complete (m,2s+γ,s,Γ)-type subspaces with respect to G2v+δ in Fq(2ν+δ) and |M(m,2s+γ,s,Γ;2ν+δ)|=N(m,2s+γ,s,Γ;2ν+δ). N(m,2s+γ,s,Γ;2ν+δ) is given by [8, Theorem 7.28]. When δ1or γ1, it is denoted by M(m,2s+γ,s,2ν+δ). M is an orbit generated by a set of subspaces in Fq(2ν+δ) under orthogonal group O2ν+δ(Fq) [8, 9].

Based on similar literature [6, 9], let L(m,2s+γ,s,Γ;2ν+δ) be the set generated by the intersection of all non-empty subspaces in M and assume Fq(2ν+δ) is the intersection of zero subspaces in M. If the partial order of L(m,2s+γ,s,Γ;2ν+δ) is determined to be according to the revere inclusion of subspaces, then L(m,2s+γ,s,Γ;2ν+δ) is a finite lattice, called lattice generated by subspace orbit M(m,2s+γ,s,Γ;2ν+δ) under orthogonal group O2v+δ(Fq), denoted by L(M)=L(m,2s+γ,s,Γ;2ν+δ). From [9, Corollary 6.18], it can be seen that the minimum element of L(M) is Fq(2ν+δ) while the maximum element is XMX={0} [8, 9].

Proposition 2.2 [9]  Assume 2ν+δ>m1, and (m,2s+γ,s,Γ) satisfies (2.1). If

2s+γm<{ν+s+min{γ,δ},ifδ1orγ1;ν+s,ifγ=δ=1

holds, then L(M) consists of Fq(2ν+δ) and all (m1,2s1+γ1,s1,Γ1)-type subspaces satisfying

2m2m1(2s+γ)(2s1+γ1)+|γγ1|2|γγ1|

and Γ11.

In the text below, for the sake of convenience, it is denoted by

f(x,y;γ1)=m1=2s1+γ1ms+s1xs1=0min{[(m1γ1)/2],sy}N(m1,2s1+γ1,s1,Γ1;2ν+δ),

where (m1,2s1+γ1,s1,Γ1) satisfies (2.2) and (2.3) in Proposition 2.2 but Γ11,γ1=0,1,2.

Lemma 2.1  Let 1m1m2ν+δ1. Subspaces (m,2s+γ,s,Γ) and (m1,2s1+γ1,s1,Γ1) on Fq(2ν+δ) satisfy (2.2) and (2.3). Assume PL(M) and PFq(2ν+δ), dimP=m1, then the number Nγ(P) of P in L(M) satisfies

(1) if γ=0, then N0(P)=f(0,0;0)+f(0,1;1)+f(0,2;2);

(2) if γ=1, then N1(P)=f(1,0;0)+f(0,0;1)+f(0,1;2);

(3) if γ=2, thenN2(P)=f(2,0;0)+f(1,0;1)+f(0,0;2).

Proof Prove (3) only, as it is similar to cases (1) and (2). Computations for the three cases of γ1=0,γ1=1,γ1=2 are conducted below.

(a) γ=2,γ1=0. Since subspaces(m,2s+γ,s,Γ) and (m1,2s1+γ1,s1,Γ1) satisfy (2.2) and (2.3) holds, (2.2) becomes

2s1m1<ν+s1.

(2.3) becomes

mm1ss1+22.

Given m1, then 0s1min{[m12],s} can be obtained through (2.4) and (2.5). So, when (m1,2s1,s1) satisfies (2.2) and (2.3), the number of (m1,2s1,s1)-type subspaces in L(M) is

s1=0min{[m1/2],s}N(m1,2s1,s1;2ν+δ).

From (2.5), there is 0m1ms+s12, and ms+s12<ν+s1, and further through (2.4), it can be obtained that 2s1m1ms+s12. Therefore, when (m1,2s1,s1) satisfies (2.2) and (2.3), the number of PFq(2ν+δ) in L(M) is

m1=2s1ms+s12s1=0min{[m1/2],s}N(m1,2s1,s1;2ν+δ)=f(2,0;0).

(b) γ=2, γ1=1. Here, (2.2) becomes

2s1+1m1<{ν+s1+min{1,δ},ifδ1;ν+s1,ifδ=γ1=1,

(2.3) becomes mm1ss1+11.

As (a) is proved, when (m1,2s1+1,s1,Γ1) satisfies (2.2) and (2.3), the number of PFq(2ν+δ) in L(M) is

m1=2s1+1ms+s11s1=0min{[(m11)/2],s}N(m1,2s1+1,s1,Γ1;2ν+δ)=f(1,0;1).

(c) γ=2,γ1=2. Here, (2.2) becomes 2s1+2m1<ν+s1+δ, and (2.3) becomes mm1ss10.

As (a) is proved, when (m1,2s1+2,s1) satisfies (2.2) and (2.3), the number of PFq(2ν+δ) in L(M) is

m1=2s1+2ms+s1s1=0min{[(m12)/2],s}N(m1,2s1+2,s1;2ν+δ)=f(0,0;2).

Lemma 2.1 (3) is proved based on (2.6)‒(2.8).

3 Rank-generating function of L(m,2s+γ,s,Γ;2ν+δ)

Definition 3.1 [6, 9] If P is a graded partially ordered set of rank n, and there are pi elements whose rank is i, then we say polynomial

F(P,q)=i=0npiqi

is the rank-generating function of P. When P is a lattice L,F(P,q) is said to be the rank-generating function of lattice L.

Lemma 3.1 [6, 9]  Assume n=2ν+δ>m1, and (m,2s+γ,s,Γ) satisfies (2.2). Define XL(M)= L(m,2s+γ,s,Γ;2ν+δ) as

r(X)={m+1dimX,ifXFq(2ν+δ);0,ifX=Fq(2ν+δ).

Then r:L(M)N is the rank function of L(M).

Theorem 3.1  Let 1m1m2ν+δ1, L=L(M) and PL,Pis an (m1,2s1+γ1,s1,Γ1)-type subspace on Fq(2ν+δ). If subspaces (m,2s+γ,s,Γ) and (m1,2s1+γ1,s1,Γ1) satisfy (2.2), (2.3), then

(1) when γ=0, the rank-generating function of lattice L(m,2s,s;2ν+δ) is

F(L,q)=f(0,0;0)qm+1m1+f(0,1;1)qm+1m1+f(0,2;2)qm+1m1+1;

(2) when γ=1, the rank-generating function of lattice L(m,2s+1,s,Γ;2ν+δ) is

F(L,q)=f(1,0;0)qm+1m1+f(0,0;1)qm+1m1+f(0,1;2)qm+1m1+1;

(3) when γ=2, the rank-generating function of lattice L(m,2s+2,s;2ν+δ) is

F(L,q)=f(2,0;0)qm+1m1+f(1,0;1)qm+1m1+f(0,0;2)qm+1m1+1.

Proof Let L(M)=L(m,2s+γ,s,Γ;2ν+δ). From Lemma 3.1, it follows that XL(M),r:L(M)N is the rank function of the lattice. Assume PL(M), and L(M) comprises subspaces. If P=Fq(2ν+δ), r(P)=0, and the number of subspaces with a rank of 0 in L(M) is 1. If PFq(2ν+δ), let dimP=m1 and (m1,2s1+γ1,s1,Γ1) satisfies (2.2), (2.3). It can be seen from [8] that N(m1,2s1+γ1,s1,Γ1;2ν+δ)=|M(m1,2s1+γ1,s1,Γ1;2ν+δ)| is the number of (m1,2s1+γ1,s1,Γ1)-type subspaces in Fq(2ν+δ) that satisfy (2.2). Then the number of subspaces with a rank of i= m+1m1 in L(M) is determined by that of (m1,2s1+γ1,s1,Γ1)(Γ11).

In this way, the number of subspaces with a rank of i=m+1m10 in L(M) is given by the number of PFq(2ν+δ). It follows through Lemma 2.1 that Nγ(P) (γ=0,1,2), and the number of subspaces with a rank of 0 in L(M) is 1, so the theorem is established according to Definition 3.1. □

4 Characteristic polynomial of L(m,2s+γ,s,Γ;2ν+δ)

Definition 4.1 [6, 9] Assume P is a finite partially ordered set with a minimum element 0 and a maximum element 1. There are rank function r and Möbius function μ on P. Then, polynomial

χ(P,x)=aPμ(0,a)xr(1)r(P)

is said to be a characteristic polynomial on P.

Reference [9] presented the characteristic polynomial of L(M). Here, we will present it in a more simplified manner.

Theorem 4.1  Assume n=2ν+δ>mm11, (m,2s+γ,s,Γ) and (m1,2s1+γ1,s1,Γ1) satisfy (2.2), (2.3). Then

(1) when γ=0, the characteristic polynomial χ(L(M),x) on lattice L(m,2s,s;2ν+δ) is

gm+1(x)+m1=0m[m+1m1]qgm1(x)f(0,0;0)gm1(x)f(0,1;1)gm1(x)f(0,2;2)gm1(x);

(2) when γ=1, the characteristic polynomial χ(L(M),x) on lattice L(m,2s+1,s,Γ;2ν+δ) is

gm+1(x)+m1=0m[m+1m1]qgm1(x)f(1,0;0)gm1(x)f(0,0;1)gm1(x)f(0,1;2)gm1(x);

(3) when γ=2, the characteristic polynomial χ(L(M),x) on lattice L(m,2s+2,s;2ν+δ) is

gm+1(x)+m1=0m[m+1m1]qgm1(x)f(2,0;0)gm1(x)f(1,0;1)gm1(x)f(0,0;2)gm1(x),

where gm+1(x),gm1(x) is a Gauss polynomial, and x is unknown (see [9]).

Proof Similar to the proof of [6, Theorem 3.2], it can be readily proved by citing Lemma 2.1. □

The following is a special case of Theorem 4.1.

Corollary 4.1  Let n=2ν+δ>1. Then

x(L(2ν+δ1,2ν+δ1,ν1+min{δ,1},Γ,2ν+δ),x)=s1=0νN(ν+s1+δ,2s1+δ,s1,Γ;2ν+δ)gv(x)γ(x),

where gν(x) is a Gauss polynomial, and γ(x)Z[x] is a monic polynomial.

5 Poincaré polynomial of L(m,2s+γ,s,Γ;2ν+δ)

In the following, some results of Poincaré polynomial of lattices generated by the orbit of subspaces under a finite orthogonal group of even characteristic are discussed.

Assume 1m2ν+δ1,M=M(m,2s+γ,s,Γ;2ν+δ) is the orbit of Fq(2ν+δ) under O2ν+δ(Fq), and L=L(M)is the lattice generated by M. From [9, Proposition 1.3],L(M) has an Möbius function, and from [9, Corollary 6.18], XMX={0} (subspace with a dimension of 0), then Poincaré polynomial of the lattice L(M) can be defined.

Definition 5.1 For XL(M), the rank function r of L(M) is given by (3.1), and x is an indeterminate, then Poincaré polynomial of L(M) is

π(L(M),x)=XL(M)μ(Fq(2ν+δ),X)(x)r(X).

Theorem 5.1  Assume 1m2ν+δ1,M=M(m,2s+γ,s,Γ;2ν+δ) is the orbit of Fq(2ν+δ) under O2ν+δ(Fq),L(M) is the lattice generated by M. For XL(M), the rank function τ of L(M) is given by (3.1), and x is an indeterminate, then

π(L(M),x)=(x)m+1χ(L(M),x1).

Proof The minimum element of the lattice L(M) is Fq(2ν+δ), the maximum element is XMX={0}, the rank function r of L(M) is given by (3.1), and r({0})=m+1. Based on Definition 4.1, the characteristic polynomial of L(M) is

χ(L(M),x)=XL(M)μ(Fq(2ν+δ),X)xr({0})r(X)=XL(M)μ(Fq(2ν+δ),X)xm+1r(X).

Hence,

χ(L(M),x1)=XL(M)μ(Fq(2ν+δ),X)(x)(m+1)+r(X),

or

(x)m+1χ(L(M),x1)=XL(M)μ(Fq(2ν+δ),X)(x)r(X).

After comparison of (5.1) and (5.2), the Poincaré polynomial can be obtained through the available characteristic polynomial of the lattice L(M). □

If nm+1, let

ψn(x)=(x)m+1gn(x1)=(x)mn+1(1+x)(1+qx)(1+qn1x),

then with 2.1, Theorem 4.1 and Theorem 5.1, we have the following theorem.

Theorem 5.2  Assume 1m1m2ν+δ1,(m,2s+γ,s,Γ) and (m1,2s1+γ1,s1,Γ1) satisfy (2.2), (2.3), then

(1) when γ=0, the Poincaré polynomial of L(m,2s,s;2ν+δ) is

ψm+1(x)+m1=0m[m+1m1]qψm1(x)f(0,0;0)ψm1(x)f(0,1;1)ψm1(x)f(0,2;2)ψm1(x);

(2) when γ=1, the Poincaré polynomial of L(m,2s+1,s,Γ;2ν+δ) is

ψm+1(x)+m1=0m(m+1m1)qψm1(x)f(1,0;0)ψm1(x)f(0,0;1)ψm1(x)f(0,1;2)ψm1(x);

(3) when γ=2, the Poincaré polynomial of L(m,2s+2,s;2ν+δ) is

ψm+1(x)+m1=0m[m+1m1]qψm1(x)f(2,0;0)ψm1(x)f(1,0;1)ψm1(x)f(0,0;2)ψm1(x).

The following is a special case of Theorem 5.2.

Corollary 5.1  Let n=2ν+δ>1. Then

π(L(2ν+δ1,2ν+δ1,ν1+min{δ,1},Γ;2ν+δ),x)=s1=0νN(ν+s1+δ,2s1+δ,s1,Γ;2ν+δ)(x)νs1ϕv(x)γ(x),

where γ(x)Z[x] is a monic polynomial.

References

[1]

AignerM. Combinatorial Theory. Grundlehren der Mathematischen Wissenschaften, Vol 234. Berlin: Springer-Verlag, 1979

[2]

Gao Y, You H. Lattices generated by orbits of subspaces under finite singular classical groups and its characteristic polynomials. Comm Algebra 2003; 31(6): 2927–2950

[3]

Huo Y J, Liu Y S, Wan Z X. Lattices generated by transitive sets of subspaces under finite classical groups, II. The orthogonal case of odd characteristic. Comm.Algebra 1992; 20(9): 2685–2727

[4]

Huo Y J, Wan Z X. On the geometricity of lattices generated by orbits of subspaces under finite classical groups. J Algebra 2001; 243(1): 339–359

[5]

Huo L F, Zhao Y B, Huo Y J. Critical problems of nonsingular subspaces in finite orthogonal spaces of even characteristic. Adv Math (China) 2014; 43(6): 824–834

[6]

Li Y, Zhao Y B, Huo Y J. Rank-generating functions and characteristic polynomials of lattice generated by orbits of subspaces in finite orthogonal space. Appl Math J Chinese Univ Ser A 2022; 37(3): 337–344

[7]

StanleyR P. Enumerative Combinatorics, Vol 1, 2nd ed. Cambridge: Cambridge University Press, 2012

[8]

WanZ X. Geometry of Classical Groups over Finite Fields, 2nd ed. Beijing: Science Press, 2002

[9]

WanZ XHuoY J. Lattices Generated by Orbits of Subspaces under Finite Classical Groups, 2nd Ed. Beijing: Science Press, 2004 (in Chinese)

RIGHTS & PERMISSIONS

Higher Education Press 2024

AI Summary AI Mindmap
PDF (492KB)

621

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/