Equivariant Euler characteristics of subspace posets
Jesper M. M{\o}ller

TL;DR
This paper calculates the equivariant Euler characteristics of the building associated with the general linear group over finite fields, providing insights into the topological and algebraic structure of these mathematical objects.
Contribution
It introduces a method to compute the primary equivariant Euler characteristics of subspace posets for general linear groups over finite fields.
Findings
Explicit formulas for equivariant Euler characteristics obtained.
Enhanced understanding of the topology of subspace posets.
Potential applications in algebraic topology and group theory.
Abstract
We compute the (primary) equivariant Euler characteristics of the building for the general linear group over a finite field.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Algebra and Geometry · Homotopy and Cohomology in Algebraic Topology
Equivariant Euler characteristics of subspace posets
Jesper M. Møller
Institut for Matematiske Fag
Universitetsparken 5
DK–2100 København
[email protected] htpp://www.math.ku.dk/ moller
(Date: March 3, 2024)
Abstract.
The (-primary) equivariant reduced Euler characteristics of the building for the general linear group over a finite field are determined.
Key words and phrases:
Equivariant Euler characteristic, subspace lattice, general linear group, generating function, irreducible polynomial
2010 Mathematics Subject Classification:
05E18, 06A07
Supported by the Danish National Research Foundation through the Centre for Symmetry and Deformation (DNRF92)
Contents
-
3.1 Alternative presentations of the equivariant reduced Euler characteristics
-
4.1 Alternative presentations of the -primary equivariant reduced Euler characteristics
1. Introduction
Let be a finite group, a finite -poset, and a natural number. The th equivariant reduced Euler characteristic of the -poset as defined by Atiyah and Segal [1] and Tamanoi [21] is the normalized sum
[TABLE]
of the reduced Euler characteristics of the -fixed -subposets, , as ranges over the set of all homomorphisms of to . For example, when acts trivially on , where is the number of conjugacy classes of commuting -tuples of elements of [9, Lemma 4.13]. In this article we specialize to posets of linear subspaces of finite vector spaces. Let be a prime power, a natural number, the -dimensional vector space over , the -lattice of subspaces of , and the proper part of consisting of nontrivial and proper subspaces. The general Definition (1.1) takes the following form in this context:
Definition 1.2**.**
The th, , equivariant reduced Euler characteristic of the -poset is the normalized sum
[TABLE]
of the Euler characteristics of the subposets of -invariant subspaces as ranges over all homomorphisms of the free abelian group on generators into the general linear group .
The generating function for the sequence , , or th generating function for short, is the power series
[TABLE]
with coefficients in integral polynomials in .
Theorem 1.4**.**
* for all .*
The first generating functions for are
[TABLE]
When , tells us that for all and all prime powers , and when ,
[TABLE]
tells us that
[TABLE]
for all prime powers .
Corollary 1.5**.**
\displaystyle F_{r+1}(x,q)=\exp\big{(}-\sum_{n\geq 1}(q^{n}-1)^{r}\frac{x^{n}}{n}\big{)}* for all .*
We also discuss the -primary equivariant reduced Euler characteristics, , of the -poset for a given prime (Definition 4.2). The generating function for the sequence , , or th -primary generating function for short, is the power series
[TABLE]
with integer coefficients. We have if , or and is a power of . When is not a power of , depends only on the closure of the cyclic subgroup generated by in the topological group of -adic units (Lemma 4.9). In any case, the th -primary generating function is obtained from the th generating function of Corollary 1.5 simply by replacing the factor by its -part, .
Theorem 1.7**.**
\displaystyle F_{r+1}(x,q,p)=\exp\big{(}-\sum_{n\geq 1}(q^{n}-1)_{p}^{r}\frac{x^{n}}{n}\big{)}* for all .*
It is immediate from the elementary Lemma 3.7 that the product expansions of the generating functions of Corollary 1.5 and Theorem 1.7 are
[TABLE]
for all .
Using partitions we can express the equivariant reduced Euler characteristics more explicitly. Let us also introduce and for the coefficients of in the reciprocal power series and , respectively. Then (Proposition 3.13, (3.17), Proposition 4.19, (4.20))
[TABLE]
where , for each partition of , is the number of elements in the symmetric group of cycle type . The functions and count semi-simple and -singular semi-simple classes in , respectively (Corollary 4.22).
Tables 1 and 2 contain examples of concrete values of (-primary) equivariant reduced Euler characteristics.
Equivariant Euler characteristics have connections to representation theory, combinatorics, and topology. The Knörr–Robinson conjecture [12, 22, 23] (a reformulation of the (non block-wise) Alperin conjecture) predicts that
[TABLE]
where is the Brown -poset of nontrivial -subgroups of and the number of irreducible complex representations of of dimension divisible by . According to Quillen [15, Theorem 3.1], where is the characteristic of the field . Since and the second equivariant reduced Euler characteristic , we have verified the Knörr–Robinson conjecture for at its defining characteristic. This result is not new, however, as it was proved already by Thévenaz [22], but the approach used here may qualify as a candidate to the combinatorial proof envisioned in [22, Introduction, (1)]. As observed also by Thévenaz [22, Theorem A, B], and investigated further in Section 3.2, the equivariant Euler characteristics of the general linear groups, and presumably also of other families of finite groups of Lie type, lead to combinatorial polynomial identities. The connections to algebraic topology go through the -space , the topological realization of the -poset . It is convenient now to switch to the (unreduced) equivariant Euler characteristics . The first equivariant Euler characteristic of is the usual Euler characteristic of the quotient space (Proposition 2.1). The second equivariant Euler characteristic of is the Euler characteristic of the -space computed in -equivariant complex -theory [1, Theorem 1]. Finally, the th -primary equivariant Euler characteristic, , is the Euler characteristic of the homotopy orbit space computed in Morava -theory at [9] [21, 2-3, 5-1] [14, Remark 7.2].
See [21, 14] for (-primary) equivariant Euler characteristics of Boolean and partition posets.
The following notation will be used in this article:
[TABLE]
2. Equivariant Euler characteristics of subspace posets
The definition (1.1) of the first equivariant Euler characteristic,
[TABLE]
closely resembles the not-Burnside lemma [20, Lemma 7.24.5] or the Lefschetz formula [24, Exercise 4, p 225]. The topological realization functor takes the -poset to the -space and the following proposition is nothing surprising so the proof will be omitted.
Proposition 2.1**.**
**
Let be two poset endomorphisms of the poset . We write if for all and if and belong to the same class under the equivalence relation generated by this relation. The equivalence relation between -poset endomorphisms of the -poset is defined similarly. The poset is poset contractible if there exists a point such that where is the identity map. The -poset is -poset-contractible if there exists a point such that . The realization of a (-)poset contractible poset is a (-)contractible topological space [15, §1.3]. If is -poset-contractible then the subposets are poset contractible for all . Thus we have
[TABLE]
For instance, the Brown poset of nontrivial -subgroups of is -poset-contractible and for all if admits a nontrivial normal -subgroup [15, Proposition 2.4]. We shall see something similar in Lemma 2.6.
Here is a basic recursive relation between equivariant reduced Euler characteristics.
Lemma 2.3**.**
The th equivariant Euler characteristic (1.1) of is
[TABLE]
where the sum extends over conjugacy classes of elements in and .
Proof.
Any homomorphism corresponds to a unique pair of homomorphisms with and . The subposet of fixed by is the subposet fixed by in the subposet of fixed by , . The th equivariant Euler characteristic (1.1) of is
[TABLE]
where the last sum runs over conjugacy classes of elements in . ∎
We also need to know that the th equivariant reduced Euler characteristic is multiplicative. For any lattice , we write for the proper part of of all non-extreme elements.
Lemma 2.4**.**
The function is multiplicative in the sense that
[TABLE]
for any finite set of -lattices , , and any .
Proof.
This follows immediately from the similar multiplicative rule, , valid for usual Euler characteristics. Using this property, and assuming for simplicity that the index set has just two elements, we get
[TABLE]
for any . ∎
We now turn to the case where the poset is and the group is . To simplify notation, we shall often write for .
Proposition 2.5**.**
Suppose that or .
- (1)
When , is for and [math] for all . 2. (2)
When , for all .
Proof.
The space is the simplicial complex of flags in . The -orbit of a flag is described by the dimensions of the subspaces in the flag. Thus the quotient is the simplicial complex of all subsets of , an -simplex, . By Proposition 2.1, is the usual reduced Euler characteristic of the quotient, , which is when and [math] when . (Alternatively, this is a special case of Webb’s theorem [25, Proposition 8.2.(i)].)
When , is empty and as , the th equivariant Euler characteristic is
[TABLE]
for all . ∎
According to Proposition 2.5.(1), the first generating function, , is independent of . We aim now for a recursion leading to the other generating functions for . The next lemma reduces the problem significantly.
Lemma 2.6**.**
*Let be an abelian subgroup of where . If , then the -poset is -contractible. *
Proof.
The assumption is that the abelian group contains an element of order , the characteristic of . Let be the subspace of vectors in fixed by the nontrivial Sylow -subgroup of . is a nontrivial subspace since -groups actions on -vector spaces fix a nonzero vector [6, Proposition VI.8.1]. is a proper subspace since the nontrivial group acts faithfully on . is invariant under since for all , , . Thus belongs to . For any , is of course proper and also nontrivial by [6, Proposition VI.8.1] again. Since for all , the poset is poset contractible [15, §1.5]. It is even -poset-contractible since and for all , . ∎
Corollary 2.7**.**
When , the th equivariant Euler characteristic of the -poset is
[TABLE]
Proof.
If , , and , only the conjugacy classes of order prime to contribute to the sum of Lemma 2.3 according to (2.2) and Lemma 2.6. The corollary remains true for where . ∎
3. Proofs of Theorem 1.4 and Corollary 1.5
Let be a polynomial power series with constant term and a sequence of integers defined for every prime power .
Definition 3.1**.**
The -transform of the power series is the power series
[TABLE]
Note that is multiplicative in the sense that
[TABLE]
for any two polynomial power series .
The -transform will be especially important. (See Section 1 for the definition of .) Finite field theory tells us that [13, Corollary 3.21, Theorem 3.25]
[TABLE]
It is a little easier to calculate the transform with respect to the sequence where is the number of all Irreducible Monic polynomials of degree . As the two sequences agree except in degree where and , the two transforms,
[TABLE]
are closely related.
Lemma 3.5**.**
* and T_{\mathrm{IM}(q)}((1-q^{i}x)^{j})=\big{(}\frac{1-q^{i+1}x}{1-q^{i}x}\big{)}^{j} for any two integers and .*
Proof.
It is immediate that
[TABLE]
because the logarithm of the middle term is by the well-known Lemma 3.7 below and (3.3). The multiplicative property (3.2) and (3.4) now imply the result (cf. [16, Chp 2]). ∎
Lemma 3.7**.**
Let , , and be integer sequences such that
[TABLE]
Then
[TABLE]
where is the number theoretic Möbius function [11, Chp 2, §2] and it is understood that .
Proof.
The first identity follows from
[TABLE]
obtained by applying the operator to the given identity . Möbius inversion leads to the second identity. The third identity follows from
[TABLE]
obtained by applying the operator to the given identity \exp\big{(}\sum_{n\geq 1}a_{n}\frac{x^{n}}{n}\big{)}=1+\sum_{n\geq 1}c_{n}x^{n}. ∎
Since an element of is semi-simple if and only its order is prime to [22, §2], it is precisely the semi-simple elements that contribute terms to the right side in Corollary 2.7.
An element is semi-simple if and only the -module with has the form
[TABLE]
where the direct sum is over irreducible monic polynomials , , and the are natural numbers. (The irreducible polynomial of degree is excluded since we need to act as an automorphism on .) The Galois field has elements where is the degree of . Thus there is a bijective correspondence
[TABLE]
between the monic polynomials in of degree with nonzero constant term and the semi-simple classes in . Here, the s are monic irreducible polynomials with , and .
In the notation of [8, §1, §2], is semi-simple if and only if all parts of the associated partitions are or [math]. If partitions , the matrix is the zero -matrix and its module is as a -vector space. The lattice of subspaces invariant under in and the centralizer of in are
[TABLE]
according to [8, Lemma 2.1]. The semi-simple conjugacy class contributes
[TABLE]
to the sum of Corollary 2.7. The product runs over the irreducible monic factors of , the characteristic polynomial of .
It is now immediate from an extended version of the Product formula [2, Theorem 8.5] for generating functions that Corollary 2.7 translates to the recurrence relation
[TABLE]
for the generating functions (1.3). The base function is (Proposition 2.5.(1)).
Proof of Theorem 1.4.
The sequence , , of Theorem 1.4 solves recurrence (3.8) since
[TABLE]
for all by Lemma 3.5. ∎
See [22, Proposition 4.1] for the case where . As and ,
[TABLE]
by induction. This observation can be used to give another proof of Theorem 1.4.
Proof of Corollary 1.5.
The logarithm of the th generating function is
[TABLE]
The corollary follows. ∎
We now write down explicitly the coefficient of in the power series of Theorem 1.4 (Corollary 3.10) and apply Lemma 3.7 to the power series of Corollary 1.5 (Corollary 3.11).
Corollary 3.10**.**
The th, , equivariant reduced Euler characteristic of the -poset is
[TABLE]
where the sum ranges over all weak compositions of into parts [19, p 15].
Corollary 3.11**.**
The th, , equivariant reduced Euler characteristics satisfy the recursion
[TABLE]
For example, , , and
[TABLE]
for all (with the understanding that ).
3.1. Alternative presentations of the equivariant reduced Euler characteristics
One may equally well represent the equivariant reduced Euler characteristics by the generating functions
[TABLE]
where the parameter is fixed rather than as in (1.3). Declaring to be for all , we have .
The solution to the recursion of Corollary 3.11 involves integer partitions and the following terminology. A multiset is a base set with a multiplicity function defined for all . Representing the multiset as , we let
[TABLE]
so that is the cardinality (number of parts) of , partitions , , if , and is the number of elements in the symmetric group having cycle type [17, Proposition 1.1.1].
Proposition 3.13**.**
For and ,
[TABLE]
Proof.
The sequence as defined in the proposition solves the recursion of Corollary 3.11. ∎
Examples of Proposition 3.13 are , and
[TABLE]
Corollary 3.14**.**
The polynomial , , , is divisible by and also by when is even. The sum of the coefficients in the quotient polynomial is .
Proof.
Since is divisible by for all , Proposition 3.13 implies .
For even , the weak partitions of with contribute [math] to the sum in Corollary 3.10 since
[TABLE]
The remaining weak partitions with contribute [math] or a polynomial of degree . Thus .
The quotient evaluates to [math] at unless where the evaluation is . Thus at is . ∎
Remark 3.15**.**
Let denote the quotient polynomial where for odd and for even . Then and . The polynomial is reducible but I do not know of any reducible with . For example,
[TABLE]
is irreducible in by Eisenstein’s irreducibility criterion [11, p 78]. The coefficient sum is .
The reciprocal of ,
[TABLE]
satisfies by (3.2) the recursion . Let denote the coefficient of in . In particular, is, by construction, the number of semi-simple classes in . We have, as above,
[TABLE]
Special cases are , , and
[TABLE]
with the understanding that . For , , , and by Proposition 3.13 and (3.17).
3.2. Polynomial identities for partitions
The polynomial identities [22, Theorem A, B] are parts of a greater hierarchy of polynomial identities.
Let , , be the set of all finite multisets of pairs of natural numbers with multiplicities such that the multiset is a partition of . The coefficient of in the -transform (Definition 3.1) of is
[TABLE]
where
- •
the first product extends over the set of all second coordinates of the multiset
- •
is the multiset of multiplicities of elements of with as second coordinate
- •
the multinomial coefficient
[TABLE]
For instance, the multiset from contributes the term
[TABLE]
to the sum over all the multisets in .
The ordinary generating function for the number of elements in is
[TABLE]
where is the number of divisors of . The first terms are .
Proposition 3.13, (3.17) and the recursive relations give a sequence of polynomial identities
[TABLE]
where , for . Taking and we get the polynomial identities
[TABLE]
where we used that (Proposition 2.5.(1)) contributes only for , , and . The left sides above are
[TABLE]
The polynomial identities [22, Theorem A, B] are the identities at for . The polynomial identities for and the identities involving Corollary 3.13 seem to be new.
Specializing further to , the index set
[TABLE]
contains multisets and the above identities for are
[TABLE]
while for they are
[TABLE]
4. The -primary equivariant reduced Euler characteristic
The th -primary equivariant reduced Euler characteristic of the -poset is the normalized sum [21, (1-5)]
[TABLE]
of the reduced Euler characteristics of the -fixed -subposets as ranges over the set of all homomorphisms of to . When acts trivially on , is proportional to the number of conjugacy classes of commuting -tuples of -singular elements of [9, Lemma 4.13]. (A group element is -singular if its order is a power of [7, Definition 40.2, §82.1].) When does not divide the order of , there are no nontrivial -singular elements in and does not depend on . In particular, the primary equivariant Euler characteristics of the -poset are defined as follows.
Definition 4.2**.**
The th, , -primary equivariant reduced Euler characteristic of the -poset is the normalized sum
[TABLE]
of reduced Euler characteristics.
In this section we calculate the -primary generating functions (1.6) for the -primary equivariant reduced Euler characteristics, .
Proposition 4.3**.**
Suppose that or .
- (1)
When , is for and [math] for . 2. (2)
When , for all , , and .
Proof.
When , the -primary equivariant reduced Euler characteristic and the equivariant reduced Euler characteristic agree by Definition 4.2 and we refer to Proposition 2.5.(1). When ,
[TABLE]
since and . ∎
According to Proposition 4.3.(1), the first -primary generating function is independent of and . In fact, for all if is a power of by Lemma 2.6. The interesting case is thus when where the first terms in the th generating function are .
The analogue of Corollary 2.7, proved exactly as before, asserts that
[TABLE]
where the sum is extended over the set of -singular conjugacy classes in .
The order of a polynomial with is the least positive integer for which divides [13, Definition 3.2].
Lemma 4.4**.**
A semi-simple element of is -singular if and only if all irreducible factors of its characteristic polynomial have -power order.
Proof.
Is is enough to show that multiplication by on , where is an irreducible monic polynomial with , has -power order if and only if has -power order. But multiplication by has -power order if and only if divides for some -power if and only if the order of divides by [13, Lemma 3.6]. ∎
As in Section 3 we conclude from Lemma 4.4 that the -primary generating functions obey the recurrence relation
[TABLE]
with base function .
We need a little preparation before we can solve (4.5). The following observation is the -primary analogue of a fundamental classical result.
Theorem 4.6**.**
The product of all monic irreducible polynomials in with nonzero constant term, -power order, and degree dividing is .
Proof.
We already know from the classical theorem [13, Theorem 3.20] that each irreducible factor in occurs exactly once in the factorization. If is an irreducible factor of , then the order of divides by [13, Corollary 3.7]. Conversely, let , , be a monic irreducible polynomial of degree dividing and of order for some . Then divides where and hence also divides [13, Lemma 3.6, Corollary 3.7]. ∎
By comparing the degree of with the total degree of its canonical factorization [13, Theorem 1.59] we obtain -primary versions
[TABLE]
of the classical relations (3.3). See Section 1 for the definition of .
We are now ready to prove Theorem 1.7. The present proof, a tremendous improvement of the original lengthy case-by-case checking, is due to an anonymous referee. A similar argument can be used to prove Theorem 1.4.
Proof of Theorem 1.7.
We must show that the power series
[TABLE]
solve recurrence (4.5). Indeed, the -transform of equals because in the product
[TABLE]
the exponent of the -factor is
[TABLE]
In this calculation we used that, for fixed and , the sum
[TABLE]
contributes only when . ∎
Corollary 4.8**.**
The th, , -primary equivariant reduced Euler characteristics satisfy the recursion
[TABLE]
Proof.
Apply Lemma 3.7 to the formula of Theorem 1.7. ∎
We now look more closely at the sequence recording the number of irreducible monic polynomials of -power order, nonzero constant term, and degree in . If is a power of , and for all , as the only polynomial that fulfills the requirements is [13, Corollary 3.2]. In the more interesting case where and are prime, consider the subgroup of generated by in the unit topological group of the ring of -adic integers.
Lemma 4.9**.**
When , the sequence and the function , , depend only on the closure in of .
Proof.
The integer depends only on the images of under the continuous [18, Chp 1, §3] homomorphisms , . But and have the same image in the discrete topological space . ∎
We say that and , prime powers prime to , are -equivalent if in . More explicitly, and are -equivalent if and only if [5, §3] where, for a prime power prime to , denotes the integer pair
[TABLE]
The multiplicative order, , was defined in Section 1. The following well-known lemma can be used to calculate -adic valuations.
Lemma 4.11** (Lifting the Exponent).**
Let be any prime and any natural number.
- (1)
If and then 2. (2)
If is odd and then 3. (3)
If and are odd and even then . 4. (4)
If and are odd and then
We first consider the situation when is an odd prime. Let be a prime primitive root mod [11, Definition p 41]. Such a prime always exists by the Dirichlet Density Theorem [11, Chp 16, §1, Theorem 1] and the congruence class of generates for all [11, Chp 4, §1, Theorem 2]. By [4, Lemma 1.11.(a)] it suffices to consider -primary generating functions at the prime powers where divides and .
Lemma 4.12**.**
Let be an odd prime and . For all and ,
[TABLE]
and, for any , and .
Proof.
Since , Theorem 1.7 immediately gives the formula for . An elementary calculation verifies when the integers are defined as in the lemma. Since , we get by (4.7) and by Theorem 1.7. ∎
Lemma 4.13**.**
\displaystyle\exp(-\sum_{n\geq 1}(pn)_{p}^{r}\frac{x^{n}}{n})=\prod_{n\geq 0}\Big{(}\frac{(1-x^{p^{n}})^{p}}{1-(x^{p^{n}})^{p}}\Big{)}^{p^{(r-1)(n+1)}}* for any prime .*
Proof.
Let . The rewriting
[TABLE]
translates to the functional equation
[TABLE]
Repeated use of this relation leads to the product expansion of the lemma. ∎
Corollary 4.14**.**
Let be an odd prime. When , i.e. , and
[TABLE]
Proof.
Combine Lemma 4.12 and Lemma 4.13. ∎
Lemma 4.15**.**
Let be an odd prime and where and for some . Then
[TABLE]
for all and .
Proof.
Note that equals if is divisible by and if not. The th power of the generating function from Theorem 1.7 is
[TABLE]
An elementary calculation confirms that when the integers are defined as in the lemma. ∎
Example 4.16**.**
The -equivalence classes of prime powers prime to are represented by and with and , [4, Lemma 1.11.(a)] as is a primitive root modulo . The -equivalence classes of , , , and contain the prime powers
[TABLE]
The -primary generating functions satisfy
[TABLE]
according to Lemma 4.12, 4.13, 4.15.
When is odd, and is big, many -primary equivariant reduced Euler characteristics vanish.
Proposition 4.17**.**
Assume is odd, prime to and . Then unless , when , and where and .
Proof.
For , by convention. For , by Proposition 4.3.(2). Lemma 4.11 shows that for any while for any not a multiplum of . By Corollar 4.8, . It is now clear that we can proceed by induction using Corollary 4.8. ∎
Next, we consider the case . The -equivalence classes of odd prime powers are represented by the -adic numbers [4, Lemma 1.11.(b)] with
[TABLE]
The -classes of contain the prime powers
[TABLE]
The results for are summarized in Figure 3. When , and given by Theorem 1.7. An elementary calculation shows that when is as in Figure 3. When , the rewriting
[TABLE]
translates to
[TABLE]
An elementary calculation shows that when is as in Figure 3. The other cases are similar. Lemma 4.13 gives product expansions of the -primary generating functions.
4.1. Alternative presentations of the -primary equivariant reduced Euler characteristics
Consider the -primary version of the generating function (3.12),
[TABLE]
where the coefficient of is the th -primary reduced Euler characteristics . (Declare to be for all .) We have and by Proposition 4.3.(2). If is odd, and , unless and G_{d}(x,q,p)=-\frac{1}{d}\big{(}\frac{1}{1-x(q^{d}-1)_{p}}-\frac{1}{1-x}\big{)}=-G_{d+1}(x,q,p) by Proposition 4.17. The following description of the power series is obtained exactly as in Proposition 3.13 (and , , and are as there).
Proposition 4.19**.**
For and ,
[TABLE]
Examples of Proposition 4.19 with and are
[TABLE]
Define the reciprocal -primary equivariant reduced Euler characteristic, , to be the coefficient of in the reciprocal of . Then
[TABLE]
For instance, the multiplicative order and the sequences of (reciprocal) third -primary reduced equivariant Euler characteristics
[TABLE]
illustrate Proposition 4.17 and Definition (4.20).
We noted in Section 3.1 that counts semi-simple classes in . The following corollary is the -primary analogue.
Corollary 4.22**.**
The coefficient of in the power series
[TABLE]
is the number of -singular semi-simple classes in .
The recursive relations give a sequence of -primary polynomial identities
[TABLE]
where , for . The term in this sequence, a -primary version of [22, Theorem A, B], is
[TABLE]
where we used that (Proposition 4.3.(1)) contributes only for and for all .
When is a power of , the identity is the only -singular semi-simple element in and the generating function of Corollary 4.22 is . When , all -singular classes are semi-simple so
[TABLE]
where is the number of -singular classes. For instance, the groups and contain
[TABLE]
-singular conjugacy classes when .
Acknowledgments
I warmly thank the participants in a discussion thread at the internet site MathOverflow [10] for some extremely helpful hints and two anonymous referees for a dramatic shortening and improvement of the original version of this article. I used the computer algebra system Magma [3] for concrete and experimental computations and the On-Line Encyclopedia of Integer Sequences for reference.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Michael Atiyah and Graeme Segal, On equivariant Euler characteristics , J. Geom. Phys. 6 (1989), no. 4, 671–677. MR 1076708 (92c:19005)
- 2[2] Miklós Bóna, A walk through combinatorics , second ed., World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2006, An introduction to enumeration and graph theory, With a foreword by Richard Stanley. MR 2361255
- 3[3] Wieb Bosma, John Cannon, and Catherine Playoust, The Magma algebra system. I. The user language , J. Symbolic Comput. 24 (1997), no. 3-4, 235–265, Computational algebra and number theory (London, 1993). MR 1484478
- 4[4] C. Broto, J. M. Møller, and B. Oliver, Automorphisms of fusion systems of finite simple groups of Lie type , Ar Xiv e-prints (2016), Mem. Amer. Math. Soc. (to appear).
- 5[5] Carles Broto, Jesper M. Møller, and Bob Oliver, Equivalences between fusion systems of finite groups of Lie type , J. Amer. Math. Soc. 25 (2012), no. 1, 1–20. MR 2833477
- 6[6] Kenneth S. Brown, Cohomology of groups , Graduate Texts in Mathematics, vol. 87, Springer-Verlag, New York, 1982. MR 83k:20002
- 7[7] Charles W. Curtis and Irving Reiner, Representation theory of finite groups and associative algebras , AMS Chelsea Publishing, Providence, RI, 2006, Reprint of the 1962 original. MR 2215618 (2006 m:16001)
- 8[8] J. A. Green, The characters of the finite general linear groups , Trans. Amer. Math. Soc. 80 (1955), 402–447. MR 0072878
