-Kreweras numbers for coincidental Coxeter groups attached to limit symbols
Abstract.
For a coincidental Coxeter group, i.e. of type or , we define the corresponding -Kreweras numbers attached to limit symbols in the sense of Shoji. The construction of these numbers resembles the argument of Reiner and Sommers and these two share similar properties, but our version is slightly different from and combinatorially simpler than theirs. We also study the combinatorial properties of our -Kreweras numbers, i.e. positivity, relation with -Narayana numbers, and cyclic sieving phenomenon.
0. Introduction
Catalan numbers are one of the most prominent sequences in algebraic combinatorics and have a lot of applications. For example, this sequence counts binary trees with fixed vertices, Dyck paths of fixed length, non-crossing partitions of points lying on the circumference of a circle, triangulation of a regular polygon, to name a few. We refer readers to Stanley’s expository monograph [Sta15] for more details and its history.
This series has a generalization to any complex reflection group so that the original one corresponds to the symmetric group. Moreover, similar to many other sequences in algebraic combinatorics, these Catalan numbers admit a -deformation. (cf. [GG12]) Namely, suppose that are the degrees of fundamental invariants of . Then the corresponding -Catalan number with parameter is given by
where . If is the symmetric group permuting elements, , and then it becomes the usual Catalan number .
When the complex reflection group is a coincidental type, i.e. if forms an arithmetic sequence, the corresponding -Catalan numbers are refined by another -sequence called -Narayana numbers. Following [RSS20], for given and we define
where satisfies and . This sequence then satisfies that . This decomposition also has an interpretation in terms of non-crossing partitions; if is the symmetric group permuting elements, , and then enumerates the number of non-crossing partitions of with exactly pieces.
The main object in this paper is -Kreweras numbers, which refines -Narayana numbers when is of coincidental type. Let be the set of complex irreducible representations of up to isomorphism. For each , we wish to find a systematic way to define , called the -Kreweras number attached to , such that where is a certain level function. Moreover, if is the symmetric group permuting elements, , and , so that corresponds to some partition , then we hope that enumerates the number of non-crossing partitions where the sizes of parts are given by .
In [RS18], Reiner and Sommers defined a version of -Kreweras numbers for Weyl groups which satisfies nice combinatorial properties. More precisely, they defined -Kreweras numbers indexed by the nilpotent orbits in the corresponding Lie algebra instead of and show that they are refinements of -Narayana numbers when is of type and . Moreover, they proved that their -Kreweras numbers enjoy cyclic sieving phenomena with respect to the generalization of non-crossing partitions studied by Armstrong [Arm09].
Their argument is based on Springer theory. Namely, Sommers [Som11] studied the decomposition of a certain virtual graded -representation , which naturally arises in the representation theory of double affine Hecke algebras, into the Green functions coming from the Springer theory of the corresponding reductive group. Then -Kreweras numbers are defined to be the “coefficients” in this decomposition. However, since the Springer correspondence (in type , and ) from the set of nilpotent orbits (with respect to the trivial local system) to is not in general bijective but only injective, their -Kreweras numbers are not parametrized by but nilpotent orbits. Indeed, if one tries to expand their definition to all of using the Springer correspondence with respect to various local systems of nilpotent orbits, then some of -Kreweras numbers become identically zero.
One of the main goals of this paper is to overcome this limitation. There is a general method to calculate the Green functions, the algorithm originally developed by Shoji [Sho83] and Lusztig [Lus86], which is now commonly called the Lusztig-Shoji algorithm. Later it is generalized by Shoji [Sho01], [Sho02] so that it is applied to complex reflection groups . In particular, he investigated the Green functions attached to so-called limit symbols [Sho04], which are combinatorially simpler than the usual Green functions.
Motivated from his work, when is a coincidental Coxeter group, i.e. of type , , , or , we define the -Kreweras numbers similarly to the argument of Reiner and Sommers but using the Green functions attached to limit symbols. This definition has certain advantages compared to their work. First, our method allows to define -Kreweras numbers for type and , which are not crystallographic so the Springer theory in the usual sense is not applicable. Moreover, in type the -Kreweras numbers only depend on the type of whereas in [RS18] there are two different series coming from the Springer theory of and , respectively. Also, our -Kreweras numbers are indexed by , or more precisely none of -Kreweras numbers is identically zero. We believe that our version is combinatorially simpler and more uniform than their results.
The main results of this paper are summarized as follows. Here is a coincidental Coxeter group, i.e. of type , , , or .
-
•
For each , we provide the closed formula of the -Kreweras number (which also shows that it is not identically zero).
- •
- •
-
•
Theorem 3.5: we show that refines the -Narayana numbers.
- •
Our argument is given case-by-case. For type , the Green functions attached to limit symbols are the same as the ones coming from the usual Springer theory, and thus there is nothing new compared to [RS18]. For type , we exploit the Springer theory of and the exotic nilcone, which are known to have a strong connection with the Green functions attached to limit symbols. For type and , our proof mainly relies on direct calculation. For these results, we use the computer program packages such as [GHLMP96], [Ach19], and [Sag20].
In this paper we only discuss coincidental Coxeter groups. However, the Green functions attached to limit symbols are well-defined for any complex reflection group of the form . Therefore, it is natural to consider a generalization of our results to such complex reflection groups, or at least for coincidental types. Moreover, even when we restrict our attention to Coxeter groups, we may choose different symbols to perform the Lusztig-Shoji algorithm, which provides different kinds of Green functions. It would be interesting to ask for which choice of symbols such -Kreweras numbers are well-defined and enjoy nice combinatorial properties.
This paper is organized as follows. In Section 1 we discuss basic definitions and notations used throughout this paper; in Section 2 we recall the definition and the classification of coincidental Coxeter groups and parametrizations of their complex irreducible representations; in Section 3 we study the definition and the properties of -Kreweras numbers and state the main theorems; from Section 4 to the end we prove the main theorems case-by-case.
1. Definitions and notations
For , we set . For , we set to be the largest integer not greater than and to be the smallest integer not smaller than . In other words, we have , , and .
For , we define . If then we have . We set and
When , we also write instead of . When equals or , we also write , , , , etc. Note that are elements in , i.e. polynomials in with nonnegative integer coefficients.
A partitions is an integer sequence such that . In such a case we define its length to be and its size to be . If then we set . We set the weighted size of to be where is the conjugate partition of . We write to be the set of partitions of size . For and , we set . For two partitions and , we define . Also we define to be the partition obtained by combining parts of and and rearranging them so that the result is in decreasing order. Let be the multiplicity of in . We often write to indicate . If then we also write .
Let to be the set of pairs of partitions such that . Its elements are called bipartitions of . Here we list some notations which will be used in Section 5 for the sake of readers’ convenience.
For a finite group , let be the set of complex irreducible representations of (up to isomorphism). Also we let be its Grothendieck group which is a free -module with basis , and be the submonoid of generated by . For any ring , we write .
2. Coincidental Coxeter groups
2.1. Classification of coincidental Coxeter groups
Let be a Coxeter group and be its exponents such that . We say that is coincidental if is an arithmetic sequence, i.e. there exists such that for . Such groups are classified as follows.
-
(1)
Type : exponents are and the Coxeter number is .
-
(2)
Type : exponents are and the Coxeter number is .
-
(3)
Type : exponents are and the Coxeter number is .
-
(4)
Type : exponents are and the Coxeter number is .
Throughout this paper, we assume that is one of these groups unless otherwise specified.
2.2. Irreducible representations
Let us discuss the parametrization of irreducible representations of (up to isomorphism). Here we adopt Carter’s notations, see [Car93, Chapter 13.2]. First suppose that is of type , so is the symmetric group permuting elements. Then its irreducible representations are parametrized by partitions of . Let us write to denote such a representation parametrized by . For example, is the identity representation and is the sign representation.
This time suppose that is of type , so is the hyperoctahedral group of rank . In this case its irreducible representations are parametrized by bipartitions of . Let us write to denote such a representation parametrized by . For example, is the identity representation and is the sign representation.
Before we proceed let us define the fake degree of an irreducible representation. Let be the symmetric algebra of the reflection representation of which is a graded -representation such that each is of degree . (Here, is a degree-keeping indeterminate.) Then for each , there exists an integer such that and . We say that is the fake degree of and write .
When is of type , each irreducible representation is completely determined by its dimension and fake degree. We write to be an irreducible representation such that and . Then we have:
Now suppose that is of type . If is odd then similarly we have
If is even, then there are two irreducible representations both of whose dimension is and fake degree is . Here we write to distinguish these two. Then we have
3. -Kreweras numbers attached to limit symbols
We keep assuming that is a coincidental Coxeter group. Here we provide a definition of -Kreweras numbers attached to limit symbols. To this end we start with the corresponding Green functions of .
3.1. Green functions attached to limit symbols
Recall the Lusztig-Shoji algorithm with respect to limit symbols as follows. We choose a total order on , say , which satisfies that . In each type this order is chosen as follows.
-
(1)
Type : is parametrized by . Here we choose any linearization of dominance order on .
-
(2)
Type : is parametrized by . To each bipartition we attach a sequence which is not necessarily a partition. Then we choose any linearization of dominance order on these sequences.
-
(3)
Type : we choose the order as follows.
-
(4)
Type : if is odd, then the order is uniquely determined. If is even then there are two possible choices of linear orders and we take either one.
Now we run the Lusztig-Shoji algorithm following [Sho01, Sho02, Sho04] with respect to the total order described above. If is of type or , this process is exactly the same as described in [Sho04]. In the case of and , there does not exist such a “limit symbol” but we may still follow the argument therein to calculate the Green functions with respect to the order described above. By abuse of terminology, we still say that these are the Green functions attached to limit symbols.
Remark.
Since we use a total order to perform the Lusztig-Shoji algorithm, the corresponding “-matrix” is not only block triangular but indeed triangular, i.e. each block consists of one irreducible representation. Moreover, the “-function” of each irreducible representation is equal to its fake degree.
Let be the Green function of as a result of the aforementioned algorithm. In particular, as a graded -representation with , is isomorphic to the coinvariant algebra of . In crystallographic cases, it is the total cohomology of the corresponding flag variety with the usual Springer -action where the degree of the -th cohomology group is . Then it is known that is a basis of . Moreover, in our case we have the following stronger statement.
Theorem 3.1.
Suppose that is a coincidental Coxeter group. Then for , (with respect to the limit symbol) is contained in . In other words, is a genuine -graded -representation.
3.2. -Kreweras numbers attached to limit symbols
Here we define the -Kreweras numbers attached to limit symbols similarly to [RS18, Section 1.3]. To this end, first we introduce a virtual graded -representation
where is a positive integer, is the rank of , is the reflection representation of , and is its symmetric algebra as a graded representation of . By Chevalley’s result, we have where are the fundamental degrees of . Thus we have . Moreover, we have for certain as the following theorem states.
Theorem 3.2.
For , we say that is very good if it satisfies the following condition.
-
(1)
Type : .
-
(2)
Type : is odd.
-
(3)
Type : .
-
(4)
Type : .
Then, we have if and only if is very good. In particular, is very good if is a multiple of the Coxeter number of .
Proof.
The proof of [Som11, Proposition 13] still applies here (even when is of type or ). ∎
Since is a basis of , can be uniquely written as a linear combination of . Let us define the -Kreweras numbers, , to be such that the following equation holds:
We are especially interested in the case when is very good. The following theorem will be shown case-by-case in later sections.
Theorem 3.3.
For very good, we have for any .
3.3. Positivity of -Kreweras numbers
In general, even if , it does not always hold that . Let us state the sufficient and necessary condition for the positivity of the -Kreweras numbers. To this end, we define a map from the set of (the conjugacy classes of) parabolic subgroups in to .
If is of type , then a parabolic subgroup is of the form for some such that . (Here, is the symmetric group permuting elements.) Let be the partition of obtained by rearranging if necessarly. Then we set . Note that this is also equivalent to the “principal-in-a-Levi” condition of [RS18]. Indeed, if we let be the nilpotent orbit which contains a regular nilpotent element in the Levi subalgebra corresponding to , then the (usual) Springer correspondence sends to .
If is of type , then any parabolic subgroup is isomorphic to where is a Coxeter group of type and . (Here can be zero.) In this case, without loss of generality we may assume that for some . We set
where there are ’s in . Now we set .
Remark.
If is of type , then we are no longer able to argue using the Levi subalgebra of some Lie algebra. Instead, for each there exists a unique which appears in with the highest fake degree. (For such a representation we have .) Then we set . We list the types of parabolic subgroups of and their images under :
Note that there are three different parabolic subgroups of type ; all of them are mapped to the same representation .
When is of type we define similarly to above. If is odd then we have:
If is even then we have:
Here and indicate two different parabolic subgroups, respectively, generated by each simple reflection of .
Now we state the positivity theorem of -Kreweras numbers. Its proof is given in later sections case-by-case.
Theorem 3.4 (cf. [RS18, Theorem 1.6]).
For and very good , the corresponding -Kreweras number has nonnegative integer coefficients if and only if .
3.4. Relation with -Narayana numbers
Recently Reiner-Shepler-Sommers [RSS20] defined the -Narayana numbers for any complex coincidental reflection group. Here we recall their definition. Suppose that the exponents of are for some where is the rank of . Then the -Narayana number with parameters and is defined to be
This definition also coincides with the ones given in [RS18] for type and .
In the following sections, we prove the following theorem case-by-case.
Theorem 3.5 (cf. [RS18, Definition 1.9]).
For a coincidental Coxeter group we have
Here, is the (ungraded) multiplicity of the reflection representation of in .
3.5. Cyclic sieving
In [RS18] it was conjectured, and proved for classical types (with respect to the usual Springer theory), that the -Kreweras numbers exhibit certain cyclic sieving phenomena. To this end, first we introduce the notion of (chains of) non-crossing partitions for general Coxeter groups. For a Coxeter system , we fix a (standard) Coxeter element, say . Let be the set of all reflections in . (This set is in general strictly larger than .) Define the absolute length of , say , to be the minimum number of reflections whose product is . We define an order on to be the closure of the cover relations where and . Now we define
This set depends on the choice of but they are all equivalent under conjugation.
Remark.
With we associate a sequence
called a -sequence in [Arm09]. Note that such a -sequence uniquely determines . Now we define a -action on (where is the Coxeter number of ) so that in terms of a -sequence it is described as
This action is indeed well-defined and clearly a -action. (See [Arm09, 3.4] for detailed discussion.)
Recall that when is very good, if and only if . For a parabolic subgroup , let be the set of point-wise fixed points in the reflection representation by elements in , and let . The following theorem is shown case-by-case in later sections.
Theorem 3.6 (cf. [RS18, Conjecure 1.4]).
Let be a parabolic subgroup of . For such that where is the Coxeter number of , the specialization is equal to the number of elements in
fixed by the order element in with respect to the cyclic action described above. Here, is a primitive -th root of unity.
4. Type
In type , the Green functions attached to limit symbols are the same as the usual Green functions (or Green polynomials). Thus, in this case everything is already covered by the results of Reiner and Sommers [RS18]. Here we review their work for the sake of readers’ convenience.
4.1. -Kreweras numbers and positivity
Suppose that is of type . Then for and , we have
where Here, where is the conjugate partition of . In particular, if then we have . (Note that in this case .)
4.2. Relation with -Narayana numbers
When is of type , for such that and the -Narayana number with parameters is given by
Then by [RS18, Definition 1.9, Theorem 1.10] we have
Here, if and only if .
4.3. Cyclic sieving
We recall [RS18, Section 6]. The Coxeter number of of type is , and here we assume that for some . Suppose that is a parabolic subgroup such that . In this case, for we have if and only if [ for all ] or [there exists a unique such that and it also satisfies ]. In this case we have
This is indeed the number of fixed points in by the order element in , as expected.
5. Type
Let be the Weyl group of type . Here we start with the exotic Springer theory first introduced by Kato [Kat09]. Later it was revealed by Achar-Henderson [AH08] that it has a strong connection with the Green functions attached to limit symbols.
5.1. Exotic Springer representations
Let be an algebraically closed field whose characteristic is not equal to . For instance we may set or where . Set and . We regard as a group of -linear automorphism of and as the endomorphism algebra of .
We fix a symplectic form on . Then there exists an involution such that for any and we have . This also induces an involution on , which we again denote by . We have an eigenspace decomposition where . Note that is isomorphic to the symplectic group , and thus its Weyl group is identified with .
Let be the set of nilpotent elements in . The variety is called the exotic nilpotent cone [Kat09, 1.1]. There is a diagonal -action on defined by . Then the -orbits in are parametrized by as follows. (ref. [AH08], [NRS18]) For a -orbit , choose any and let be the Jordan type of as an endomorphism on . Also let be the Jordan types of on . Note that and does not depend on the choice of . Then there exists a unique pair so that and . Again, is independent of the choice of and this gives a bijective correspondence from the set of -orbits in to . From now on we write to be the orbit parametrized by .
Let be the flag variety of defined to be:
For , we define , called the exotic Springer fiber of . Then by [Kat09] (see also [SS13]), there exists an action of on for each , called the exotic Springer representation.
Note that does not depend on the choice of as long as it is contained in a fixed -orbit of . Now we define as a graded -representation where is any element in . Then the leading term of is given by , i.e. the exotic Springer correspondence is given by . Moreover, coincides with the Green function with respect to attached to the limit symbols, which means that
5.2. Springer representation of
There is another Springer theory, i.e. of in characteristic 2, which shares the same Green functions as exotic one. Here we briefly describe its properties.
We start with the parametrization of the nilpotent orbits in . (ref. [Hes79], [Xue12b, Section 2.6]) Let be the set of pairs where and is a function from to such that the following conditions hold:
-
•
is even if is odd,
-
•
for any we have ,
-
•
if is odd, and
-
•
for such that , we have and .
For , we attach to its orbit as follows. Let be the Jordan type of . For we define to be Then and it is independent of the choice of in its orbit. This gives a desired parametrization.
We describe the Springer correspondence of . It is summarized by the bijection . (This bijection is deduced from, but not exactly the same as, the one defined in [Xue12a, 8.1]. Also see [Kim19, Section 13.1].) For , choose such that . We partition into blocks of size 1 or 2 so that:
-
is a single block if and only if and
-
other blocks consist of two consecutive integers.
(Here we adopt the convention that .) Note that if is a block then (and thus ). Now we set for to be:
-
if is a single block then , and
-
otherwise if is a block then and .
Now we set and (and remove zeroes at the end if necessary so that and do not depend on the choice of ). Then, from the definition of it follows that . Now we define . This is indeed a bijection and describes the Springer correspondence. In particular, if we let be the Green function for the nilpotent orbit parametrized by then we have .
5.3. Analogue of Sommers’ theorem
Here we prove an analogue of [Som11, Theorem 2] in our setting. Let be the reflection representation of .
Theorem 5.1 (cf. [Som11, Theorem 2]).
For , we have
where .
The rest of this section is devoted to the proof of this theorem. Here we mainly follow the argument of [Som11]. Most of the statements therein remain valid with minor modification. We start with the following lemma.
Lemma 5.2.
We have .
Proof.
Let us define
where is the number of -points in when the base field is (and is split over ). Also for , we define
where we set . Now we prove the following lemma.
Lemma 5.3 (cf. [Som11, (9)]).
For , we have
Proof.
We start with the orthogonality formula of Green functions presented in [Sho82], which is still valid in our situation:
Here we use the fact that the number of positive roots in the root system of is and the centralizer of any in is connected. If we set so that , then it follows that
Note that by the formula of Chevalley. Thus we have
Now the result follows from taking , multiplying , and summing up over . ∎
From [GNS99, Proposition 3.3], we have
where and (resp. ) is the content((column index)(row index)) (resp. the hook length) of in the Young diagram. In particular, by considering boxes at the first column of the Young diagrams of and , we see that when . (This statement is vacuous when , i.e. and .)
Before the proof of Theorem 5.1 let us observe the triangularity of Springer representations as follows. For , we say that if
for any . Then the result of [AH08, Theorem 6.3] states that if and only if . Moreover, by [SS14] and [Kat17], it follows that if and only if . Note that then . In particular, if we set , i.e. , then the above inequalities are translated to and for any . Thus when we have that .
We are ready to prove Theorem 5.1, i.e. . To this end, first we prove that the RHS divides by induction on . First, if , i.e. then it follows from the result of Solomon [Sol63]. In general, by Lemma 5.3 and the triangularity of Springer representations we have
Here we use the fact that (see [SS13, Remark 2.6]). Now by induction hypothesis and the argument above, it follows that .
Since does not have any common factor with , it follows that . On the other hand, we previously observed that if then . Thus it follows that as well. Now by considering the degree with respect to , it follows that for some . However, since the coefficient of in equals 1 (as the trivial representation only occurs at the zeroth cohomology group of the corresponding Springer fiber). This suffices for the proof of Theorem 5.1.
5.4. -Kreweras numbers and positivity
In this section we find a closed formula of . To this end, first we let for and . This can also be interpreted as follows. We set . Then is not necessarily a partition, but it is a quasi-partition in the sense of [AHS11]; we have for . Also we have and .
Lemma 5.4.
Set as above. For , suppose that (resp. ) is the smallest (resp. largest) index so that (resp. ). Then, there are three possible cases:
-
(1)
If and are both even then . Thus we have .
-
(2)
If then . Thus we have .
-
(3)
If and are both odd then . Thus we have .
Proof.
It can be shown case-by-case. ∎
Let be the number of such that the first condition in Lemma 5.4 is satisfied. (In this case we necessarily have .) In other words, we have . Also we define
where . We set .
Theorem 5.5.
For , the -Kreweras number is given by
In particular, when is odd, if and only if .
The rest of this section is devoted to its proof. Using , we have
Recall that . Thus we have
It follows that
On the other hand, if we substitute with in the equation of Theorem 5.1 then we have
Thus we have
We recall the result of Sun [Sun11, Corollary 3.13] that gives the closed formula of :
where if and only if is in the third case of Lemma 5.4. (See [Sun11, Notation 2.5].) Therefore, by Lemma 5.4 we see that
We substitute with this formula in the expansion of to see that
which is what we want to prove.
5.5. Relation with -Narayana numbers
When is of type , due to Lemma 5.2, Theorem 3.5 reads
First, note that we have
On the other hand, from 5.4 we have
Comparing the formulas above, it suffices to show that
Note that the RHS is the same as the one given in [RS18, Lemma 5.1]. Indeed, let be the set of Jordan types of nilpotent elements in where . For , let be the number of -points in the nilpotent orbit of whose elements are of Jordan type (when such an orbit is split over ). Then [RS18, Lemma 5.1] states that we have
(See also [Lus76].) Therefore, it suffices to show that
To this end, following [AHS11], first we define as follows. For such that and , we consider the sequence and substitute any two consecutive integers such that with , respectively. (These substitutions do not overlap with one another.) Then the result is a partition of which is set to be the image of under . Note that we have .
We define another map as follows. For as above, whenever we have we replace with , respectively, and whenever we have we replace with , respectively. (These substitutions do not overlap with one another.) Then the result is again an element of denoted by . Note that we have .
5.6. More on the positivity of -Kreweras numbers
In Theorem 5.5, for odd we have if and only if the first condition of Lemma 5.4 is invalid for any . Here we give other equivalent interpretations of this condition and prove Theorem 3.4 for type .
Recall the Springer correspondence of in characteristic 2 discussed in 5.2. Following [Kim19, Section 4.2], we define the notion of critical values. We say that is critical at , or is a critical value of , if
-
•
,
-
•
for , if then , and
-
•
for , if then .
Using this notion, we may decompose a nilpotent element into a “distinguished part” and an “induced part”. Indeed, we define to be
-
•
0 if is critical,
-
•
1 if ( is critical and) is odd, and
-
•
2 if is critical and is even.
(Indeed, it is easy to show that is critical if is odd.) Now we set to be and . Also we set to be (so that ) and . If we choose and such that their orbits are parametrized by and , respectively, then it is not hard to show that , i.e. there exists a direct sum decomposition such that and . Moreover, one can show that is a distinguished nilpotent element and is a regular nilpotent element in a certain Levi subalgebra all of whose simple factors are of type .
Theorem 5.6.
Suppose that . Then the following conditions are equivalent:
-
(1)
, i.e. .
-
(2)
There exists at most one critical value of , and if is such a value then is odd.
-
(3)
The nilpotent orbit in parametrized by contains a regular nilpotent element in some Levi subalgebra.
-
(4)
(This condition is still satisfied when or .)
Proof.
(2) (3) is easily deduced from the argument right above the theorem. (This is equivalent to saying that is a regular nilpotent element of .) The equivalence of (2) and (4) is easily shown using the definition of .
We prove (1) (4). Let us set and for each we attach the interval where (resp. ) is the smallest (resp. largest) index so that (resp. ). Then (1) is equivalent to that there is no such that and are both even. Since these intervals are pairwise disjoint and their union is , we have two possible cases:
-
(1)
If is even, i.e. , then all the intervals are of the form odd, even.
-
(2)
If is odd, i.e. , then there exists a unique so that if then is odd, even, is odd, odd, and if then is even, odd.
In the first case, direct calculation shows that , i.e. . In the second case, similarly we have and , i.e. and . This proves (1) (4). Conversely, if then it is easy to deduce (1) using the definition of . It suffices for the proof. ∎
Suppose that satisfies the second condition of Theorem 5.6. Let be the unique critical value of . (If there is no critical value, then we set .) From the definition of a critical value, for any we have if , if , and if . Thus, if we let where then by direct calculation we have
where is repeated times in the first factor. Note that this is equivalent to the description of in Section 3.3 for type , thus it proves Theorem 3.4 in type .
5.7. Cyclic sieving
We prove Theorem 3.6 in our setting. Here we set for some (note that the Coxeter number of is ). As in [RS18, 6.1], for we set and . Then for any we have
Recall that each parabolic subgroup may be identified with where is a Coxeter group of type and . (Here can be zero.) Without loss of generality we may assume that . Here we set as described at the end of 5.6 and let so that .
If we regard as the Weyl group of then corresponds to the nilpotent orbit of whose elements are of Jordan type . Therefore, using the result of [RS18, Section 6], here we only need to show that:
-
(1)
If but for some , then .
-
(2)
If and for every , then
(Here we use the fact that is odd for at most one , so .)
Let us embark on the proof. From Theorem 5.5, is equal to
Here, where is the largest index so that and is repeated times in . Also, note that in this case . Now we observe the following lemma.
Lemma 5.7.
Let be as above. Then we have and if . In any case, we have . Also, it follows that .
Proof.
It is straightforward from the description of . ∎
Remark.
In general if (see 5.2 for the definition of ) then we have:
-
•
if is not a critical value, then .
-
•
if is odd, then ( is critical and) .
-
•
if is even and is a critical value, then .
We also recall a useful lemma when calculating the specialization of -multinomials.
Lemma 5.8 ([RS18, Lemma 6.3]).
Suppose that . Then for a sequence of nonnegative integers so that , we have
Now suppose that but for some . Then it is clear that
thus as required. From now on we assume that and for every . (It also follows that .) Then by Lemma 5.8, equals
Thus it remains to show that the power of in the above expression is 1.
In our case, it is easy to see that each of and are the sum of for some , and thus is easily seen to be a multiple of . (Recall that and .) Thus we have
since .
Therefore, if is odd then and it suffices for the proof. It remains to assume that is even and . Here we have
Thus the claim also holds when is even.
6. Type
In this section we assume that is of type .
6.1. -Kreweras numbers and positivity.
Here we list for . (We acknowledge that these numbers were also calculated by Eric Sommers.)
-Kreweras | |||
---|---|---|---|
The first column represents the irreducible representations of . Here we use Carter’s notation [Car93, 13.2]. The second column represents corresponding -Kreweras numbers. The third column represents where is the reflection representation of . The fourth column represents the type of each parabolic subgroup where . Here we do not distinguish different parabolic subgroups of type as they all correspond to the same representation .
It is clear from the formula that if we have if and only if .
6.2. Relation with -Narayana numbers
6.3. Cyclic sieving
We identify with and fix a (standard) Coxeter element . Let us label all the reflections in as
and all the products of two reflections in as
(Here, .) Then we have . Moreover, direct calculation shows that and for , and and for .
From now on we calculate the fixed points of under the -action defined in 3.5 case-by-case. To this end, recall the definition of -sequence
for each . It is clear that for each . In terms of -sequence the cyclic action is given by
From now on let us write to denote the number of fixed points in starting with by an order element (where ). Also let be the sequence obtained from by removing the identity elements.
-
(1)
. In this case . Thus .
-
(2)
for some . In this case where is a reflection. Thus in this case if and only if and otherwise .
-
(3)
, . By conjugation by it suffices to consider the case when . Then possible are:
Thus direct calculation shows that if and only if and otherwise .
-
(4)
, . By conjugation by it suffices to consider the case that . Then possible are:
Thus direct calculation shows that if and only if and otherwise .
-
(5)
, . By conjugation by it suffices to consider the case that . Then possible are:
Thus direct calculation shows that if and only if and otherwise .
-
(6)
. In this case possible can be read from above calculations. Let us denote by the number of fixed elements with fixed .
-
(a)
. Direct calculation shows that if and only if and otherwise .
-
(b)
or for some . It is clear that if and only if and otherwise .
-
(c)
for some . Direct calculation shows that there are 50 possible , and we have if and if . Moreover, if and is one of
then the -sequence where for some is fixed by an element of order 3 and 6. Thus we have . Otherwise we have .
In sum, we have:
-
(a)
Now we consider the -Kreweras numbers where . Direct calculation shows that:
-
•
is of type . Then . For , if and only if . We have , thus whenever . This coincides with .
-
•
is of type . Then . For , if and only if for . We have , thus equals if and otherwise. Thus coincides with .
-
•
is of type . Then . For , if and only if for . We have , thus equals if and otherwise. Thus coincides with .
-
•
is of type . Then . For , if and only if for . We have , thus equals if and otherwise. Thus coincides with .
-
•
is of type . Then . For , if and only if for . We have , thus equals if and otherwise. Thus coincides with .
-
•
. Then . For , if and only if . We have , thus
This coincides with .
We exhaust all the possible cases and thus Theorem 3.6 is valid when is of type .
7. Type
In this section we assume that is of type for .
7.1. -Kreweras numbers and positivity.
Here we list for in the same way as type case. When is even we have:
-Kreweras | |||
---|---|---|---|
When is odd we have:
-Kreweras | |||
---|---|---|---|
It is clear from the formula that if we have if and only if .
7.2. Relation with -Narayana numbers
7.3. Cyclic sieving
We identify with and fix a (standard) Coxeter element . We have . One can show that each element is fixed by conjugation by if and only if (resp. ) if is odd (resp. even).
From now on we calculate the fixed points of under the -action defined in 3.5 case-by-case in the same manner as type case. Let us write to denote the number of fixed points in starting with by an order element (where ). Also let be the sequence obtained from by removing the identity elements.
-
(1)
. In this case . Thus .
-
(2)
is a reflection. In this case . Direct calculation shows that equals if and 0 otherwise.
-
(3)
. Let us denote by the number of fixed elements with fixed .
-
•
If , direct calculation shows that equals if and 0 otherwise.
-
•
If consists of two reflections, then there are possibilities of .
-
–
If is even then for any , and are not conjugate by powers of . Thus equals if and 0 otherwise.
-
–
If is odd then for any we have . Thus we have equals if and 0 if . Moreover, if and for some then the corresponding -sequence is fixed by an order 2 element. Therefore equals if and 0 otherwise.
-
–
In sum, we have
-
•
Now we consider the -Kreweras numbers where . Direct calculation shows that:
-
•
is of type . Then . For , if and only if . We have , thus whenever . This coincides with .
-
•
is of type , is odd. Then . For , if and only if is a reflection. We have , thus equals if and 0 otherwise. This coincides with .
-
•
is of type , is even. By symmetry it suffices to assume that and . For , if and only if (there are of them). We have , thus equals if and 0 otherwise. This coincides with .
-
•
. Then . For , if and only if . We have , thus
This coincides with .
We exhaust all the possible cases and thus Theorem 3.6 is valid when is of type .
References
- [AA08] Achar, P. N. and Aubert, A.-M., Springer correspondences for dihedral groups, Transform. Groups 13 (2008), no. 1, 1–24.
- [Ach19] Achar, P. N., An implementation of the generalized Lusztig-Shoji algorithm, version 0.98f, Available at https://www.math.lsu.edu/~pramod/docs/lsalg.g, 2019.
- [AH08] Achar, P. N. and Henderson, A., Orbit closures in the enhanced nilpotent cone, Adv. Math. 219 (2008), 27–62.
- [AHS11] Achar, P. N., Henderson, A., and Sommers, E., Pieces of nilpotent cones for classical groups, Represent. Theory 15 (2011), 584–616.
- [Arm09] Armstrong, D., Generalized Noncrossing Partitions and Combinatorics of Coxeter Groups, vol. 202, Mem. Amer. Math. Soc., no. 949, American Mathematical Society, Providence, Rhode Island, 2009.
- [Car93] Carter, R. W., Finite Groups of Lie Type: Conjugacy Classes and Complex Characters, Wiley Classics Library, no. 48, Wiley, 1993.
- [GG12] Gordon, I. G. and Griffeth, S., Catalan numbers for complex reflection groups, Amer. J. Math. 134 (2012), no. 6, 1491–1502.
- [GHLMP96] Geck, M., Hiss, G., Lübeck, F., Malle, G., and Pfeiffer, G., Chevie – a system for computing and processing generic character tables, Appl. Algebra Engrg. Comm. Comput. 7 (1996), 175–210.
- [GNS99] Gyoja, A., Nishiyama, K., and Shimura, H., Invariants for representations of Weyl groups and two-sided cells, J. Math. Soc. Japan 51 (1999), no. 1, 1–34.
- [Hes79] Hesselink, W. H., Nilpotency in classical groups over a field of characteristic 2, Math. Z. 166 (1979), 165–181.
- [Kat09] Kato, S., An exotic Deligne-Langlands correspondence for symplectic groups, Duke Math. J. 148 (2009), no. 2, 305–371.
- [Kat17] by same author, An algebraic study of extension algebras, Amer. J. Math. 139 (2017), no. 3, 567–615.
- [Kim19] Kim, D., On total Springer representations for the symplectic Lie algebra in characteristic 2 and the exotic case, Available at https://arxiv.org/abs/1909.01901 (2019).
- [Kre72] Kreweras, G., Sur les partitions non croisees d’un cycle, Discrete Math. 1 (1972), no. 4, 333–350.
- [Lus76] Lusztig, G., A note on counting nilpotent matrices of fixed rank, Bull. Lond. Math. Soc. 8 (1976), no. 1, 77–80.
- [Lus86] by same author, Character sheaves, V, Adv. Math. 61 (1986), 103–155.
- [NRS18] Nandakumar, V., Rosso, D., and Saunders, N., Irreducible components of exotic Springer fibres, J. Lond. Math. Soc. (2) 98 (2018), 609–637.
- [RS18] Reiner, V. and Sommers, E., Weyl group -Kreweras numbers and cyclic sieving, Ann. Comb. 22 (2018), 819–874.
- [RSS20] Reiner, V., Shepler, A. V., and Sommers, E., Invariant theory for coincidental complex reflection groups, Math. Z. (2020), Available at https://doi.org/10.1007/s00209-020-02592-8.
- [Sag20] The Sage Developers, Sagemath, the Sage Mathematics Software System (Version 9.2), 2020, http://www.sagemath.org.
- [Sho82] Shoji, T., On the Green polynomials of a Chevalley group of type , Comm. Algebra 10 (1982), no. 5, 505–543.
- [Sho83] by same author, On the Green polynomials of classical groups, Invent. Math. 74 (1983), 239–267.
- [Sho01] by same author, Green functions associated to complex reflection groups, J. Algebra 245 (2001), 650–694.
- [Sho02] by same author, Green functions associated to complex reflection groups, II, J. Algebra 258 (2002), 563–598.
- [Sho04] by same author, Green functions attached to limit symbols, Adv. Stud. Pure Math. 40 (2004), 443–467.
- [Sol63] Solomon, L., Invariants of finite reflection groups, Nagoya Math. J. 22 (1963), 57–64.
- [Som11] Sommers, E., Exterior powers of the reflection representation in Springer theory, Transform. Groups 16 (2011), no. 3, 889–911.
- [Spa91] Spaltenstein, N., On the reflection representation in Springer’s theory, Comment. Math. Helv. 66 (1991), 618–636.
- [SS13] Shoji, T. and Sorlin, K., Exotic symmetric space over a finite field, I, Transform. Groups 18 (2013), no. 3, 877–929.
- [SS14] by same author, Exotic symmetric space over a finite field, II, Transform. Groups 19 (2014), no. 3, 887–926.
- [Sta15] Stanley, R. P., Catalan Numbers, Cambridge University Press, New York, NY, 2015.
- [Sun11] Sun, M., Point stabilisers for the enhanced and exotic nilpotent cones, J. Group Theory 14 (2011), 825–839.
- [Xue12a] Xue, T., Combinatorics of the Springer correspondence for classical Lie algebras and their duals in characteristic 2, Adv. Math. 230 (2012), 229–262.
- [Xue12b] by same author, On unipotent and nilpotent pieces for classical groups, J. Algebra 349 (2012), 165–184.