1. Office of Academic Affairs, Xuanhua Vocational College of Science and Technology, Zhangjiakou 075100, China
2. Department of Basic Courses, Zhangjiakou Vocational and Technical College, Zhangjiakou 075051, China
3. Department of Mathematics, Hebei North University, Zhangjiakou 075000, China
18931311531@163.com
Show less
History+
Received
Accepted
Published
Issue Date
Revised Date
2024-07-25
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.
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
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 , 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 is under 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 is the power of 2, and is a finite field with elements. Let , where is a non-negative integer while . Introduce the notation
Assume , then is said to be the exponent of , while is its definite part [5, 8, 9]. The group constructed through multiplication of the complete matrix on satisfying is called an orthogonal group of order with respect to on , denoted by . The effect of row vector space of dimension and orthogonal group on it is jointly called finite orthogonal space of dimension of even characteristic on , denoted by .
Assume is a subspace of dimension of . An matrix of rank is also expressed as . Its row vector generates a subspace , then we say is the matrix representation of the subspace . One subspace of dimension in the orthogonal space of dimension is said to be -type subspace with respect to if displays congruence at [5, 8, 9].
Here, is the row vector of 2 dimension with the (21)th component as 1 and the remaining components as 0. If or , then the -type subspace is denoted by , where is the exponent of [9], ,
Proposition 2.1 [5, 8, 9] The -type subspace with respect toinexists if andonly if
is used to represent the set of complete -type subspaces with respect to in and . is given by [8, Theorem 7.28]. When or , it is denoted by is an orbit generated by a set of subspaces in under orthogonal group [8, 9].
Based on similar literature [6, 9], let be the set generated by the intersection of all non-empty subspaces in and assume is the intersection of zero subspaces in . If the partial order of is determined to be according to the revere inclusion of subspaces, then is a finite lattice, called lattice generated by subspace orbit under orthogonal group , denoted by . From [9, Corollary 6.18], it can be seen that the minimum element of is while the maximum element is [8, 9].
Proposition 2.2 [9] Assume , andsatisfies (2.1). If
holds, thenconsists ofand all -type subspaces satisfying
and 1.
In the text below, for the sake of convenience, it is denoted by
where satisfies (2.2) and (2.3) in Proposition 2.2 but .
Lemma 2.1Let 1. Subspacesandonsatisfy (2.2) and (2.3). Assumeand , , then the numberofP insatisfies
(1) if , then
(2) if , then
(3) if , then
Proof Prove (3) only, as it is similar to cases (1) and (2). Computations for the three cases of are conducted below.
(a) Since subspaces and satisfy (2.2) and (2.3) holds, (2.2) becomes
(2.3) becomes
Given , then can be obtained through (2.4) and (2.5). So, when satisfies (2.2) and (2.3) the number of -type subspaces in is
From (2.5), there is , and , and further through (2.4), it can be obtained that Therefore, when satisfies (2.2) and (2.3) the number of in is
(b) , Here, (2.2) becomes
(2.3) becomes
As (a) is proved, when ( satisfies (2.2) and (2.3), the number of in is
(c) Here, (2.2) becomes , and (2.3) becomes .
As (a) is proved, when satisfies (2.2) and (2.3), the number of in is
Lemma 2.1 (3) is proved based on (2.6)‒(2.8).
3 Rank-generating function of
Definition 3.1 [6, 9] If is a graded partially ordered set of rank , and there are elements whose rank is , then we say polynomial
is the rank-generating function of . When is a lattice is said to be the rank-generating function of lattice .
Theorem 3.1Let , andis an -typesubspace on . If subspacesandsatisfy (2.2), (2.3), then
(1) when , the rank-generating function of latticeis
(2) when , the rank-generating function of latticeis
(3) when , the rank-generating function of latticeis
Proof Let . From Lemma 3.1, it follows that is the rank function of the lattice. Assume , and comprises subspaces. If , , and the number of subspaces with a rank of 0 in is 1. If , let and satisfies (2.2), (2.3). It can be seen from [8] that is the number of -type subspaces in that satisfy (2.2). Then the number of subspaces with a rank of in is determined by that of .
In this way, the number of subspaces with a rank of in is given by the number of . It follows through Lemma 2.1 that , and the number of subspaces with a rank of 0 in is 1, so the theorem is established according to Definition 3.1. □
4 Characteristic polynomial of
Definition 4.1 [6, 9] Assume is a finite partially ordered set with a minimum element 0 and a maximum element 1. There are rank function and Möbius function on . Then, polynomial
is said to be a characteristic polynomial on .
Reference [9] presented the characteristic polynomial of . Here, we will present it in a more simplified manner.
Theorem 4.1Assume , andsatisfy (2.2), (2.3). Then
(1) when , the characteristic polynomialon latticeis
(2) when , the characteristic polynomialon latticeis
(3) when , the characteristic polynomialon latticeis
whereis a Gauss polynomial, andis 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.1Let . Then
whereis a Gauss polynomial, andis a monic polynomial.
5 Poincaré polynomial of
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 is the orbit of under , and is the lattice generated by . From [9, Proposition 1.3 has an Möbius function, and from [9, Corollary 6.18], (subspace with a dimension of 0), then polynomial of the lattice can be defined.
Definition 5.1 For , the rank function of is given by (3.1), and is an indeterminate, then Poincaré polynomial of is
Theorem 5.1Assumeis the orbit ofunderis the lattice generated by . For , the rank function of is given by (3.1), andis an indeterminate, then
Proof The minimum element of the lattice is , the maximum element is , the rank function of is given by (3.1), and . Based on Definition 4.1, the characteristic polynomial of is
Hence,
or
After comparison of (5.1) and (5.2), the Poincaré polynomial can be obtained through the available characteristic polynomial of the lattice . □
If , let
then with 2.1, Theorem 4.1 and Theorem 5.1, we have the following theorem.
Gao Y, You H. Lattices generated by orbits of subspaces under finite singular classical groups and its characteristic polynomials. Comm Algebra2003; 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.Algebra1992; 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 Algebra2001; 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 A2022; 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 中Eng×
Note: Please be aware that the following content is generated by artificial intelligence. This website is not responsible for any consequences arising from the use of this content.