Some identities involving second kind Stirling numbers of types $B$ and $D$

Using Reiner's definition of Stirling numbers of the second kind in types $B$ and $D$, we generalize two well-known identities concerning the classical Stirling numbers of the second kind. The first identity relates them with Eulerian numbers and the second identity interprets them as entries in a transition matrix between the elements of two standard bases of the polynomial ring $R[x]$. Finally, we generalize these identities to the group of colored permutations $G_{m,n}$.


Introduction
The Stirling number of the second kind, denoted S(n, k), is defined as the number of partitions of the set [n] := {1, . . . , n} into k non-empty subsets (see [19, page 81]). Stirling numbers of the second kind arise in a variety of problems in enumerative combinatorics; they have many combinatorial interpretations, and have been generalized in various contexts and in different ways.
In the geometric theory of Coxeter groups they appear as follows. For any finite Coxeter group W , there is a corresponding hyperplane arrangement W, whose elements are the reflecting hyperplanes of W . Associated with W, there is the set of all the intersections of these hyperplanes, ordered by reverse inclusion, called the intersection lattice, and denoted L(W) (see e.g. [6,18]). It is well-known that in the Coxeter group of type A, L(A n ) is isomorphic to the lattice of the set partitions of [n]. By this identification, the subspaces of dimension n − k are counted by S(n, k). In this geometric context, Stirling numbers of the second kind are usually called Whitney numbers (see [20,22] for more details).
For Coxeter groups of types B and D, Zaslavsky [22] gave a description of L(B n ) and L(D n ) by using the general theory of signed graphs. Then, Reiner [15] gave a different combinatorial representation of L(B n ) and L(D n ) in terms of new types of set partitions, called B n -and D n -partitions. We call the number of B n -(resp. D n -) partitions with k pairs of nonzero blocks the Stirling number of the second kind of type B (resp. type D).
The posets of B n -and D n -partitions, as well as their isomorphic intersection lattices, have been studied in several papers [4,5,6,9,10,20], from algebraic, topological and combinatorial points of view. However, to our knowledge, two famous identities concerning the classical Stirling numbers of the second kind (see e.g. Bona [7, Theorems 1.8 and 1.17]) have not been generalized to types B and D in a combinatorial way: the first identity relates the Stirling numbers to the Date: January 24, 2019. This research was supported by a grant from the Ministry of Science and Technology, Israel, and the France's Centre National pour la Recherche Scientifique (CNRS).
Eulerian numbers, and the second one formulates a change of bases in R[x], both will be described below.
The original definition of the Eulerian numbers was given by Euler in an analytic context [11, §13]. Later, they began to appear in combinatorial problems, as the Eulerian number A(n, k) counts the number of permutations in the symmetric group S n having k − 1 descents, where a descent of σ ∈ S n is an element of the descent set of σ, defined by : We denote by des(σ) := |Des(σ)| the descent number.
The first above-mentioned identity relating Stirling numbers of the second kind and Eulerian numbers is the following one, see e.g. [ A(n, k) n − k r − k . ( The second identity arises when one expresses the standard basis of the polynomial ring R[x] as a linear combination of the basis consisting of the falling factorials (see e.g. the survey of Boyadzhiev [8]): Theorem 1.2. Let x ∈ R and let n ∈ N. Then we have where [x] k := x(x − 1) · · · (x − k + 1) is the falling factorial of degree k and [x] 0 := 1.
There are some known proofs for the last identity. A combinatorial one, realizing x n as the number of functions from the set {1, . . . , n} to the set {1, . . . , x} (for a positive integer x), is presented in [19,Eqn. (1.94d)]. The first geometric proof is due to Knop [12].
In this paper, we use Stirling numbers of the second kind of types B and D, in order to generalize the identities stated in Equations (2) and (3). Theorems 4.1 and 4.2 below are generalizations of the first identity for types B and D: they will be proven by providing explicit procedures to construct ordered set partitions starting from the elements of the corresponding Coxeter groups.
Theorems 5.1 and 5.4 generalize the second identity. We present here a geometric approach, suggested to us by Reiner [16], which is based on some geometric characterizations of the intersection lattices of types B and D. Moreover, we show how to generalize these two classical identities to the colored permutations group G m,n .
The rest of the paper is organized as follows. Sections 2 and 3 present the known generalizations of the Eulerian numbers and the set partitions, respectively, to the Coxeter groups of types B and D. In Sections 4 and 5, we state our generalizations of the two identities and prove them. Finally, in Section 6, we present some possible extensions of the main results.

Eulerian numbers of types B and D
We start with some notations. For n ∈ N, we set [±n] := {±1, . . . , ±n}. For a subset B ⊆ [±n], we denote by −B the set obtained by negating all the elements of B, and by ±B we denote the unordered pair of sets B, −B.
Let (W, S) be a Coxeter system. As usual, denote by ℓ(w) the length of w ∈ W , which is the minimal integer k satisfying w = s 1 · · · s k with s i ∈ S. The (right) descent set of w ∈ W is defined to be Des(w) := {s ∈ S | ℓ(ws) < ℓ(w)}.
A combinatorial characterization of Des(w) in type A is given by Equation (1) above. Now we recall analogous descriptions in types B and D.
We denote by B n the group of all bijections β of the set [±n] onto itself such that for all i ∈ [±n], with composition as the group operation. This group is usually known as the group of signed permutations on [n]. If β ∈ B n , then we write β = [β(1), . . . , β(n)] and we call this the window notation of β.
As a set of generators for B n we take The following characterization of the (right) descent set of β ∈ B n is well-known [3].
For all non-negative integers n ≥ k, we set and we call them the Eulerian numbers of type B. Note that in our context A B (n, k) counts permutations in B n having k descents rather than k − 1, like in type A, since this produces nicer formulas.
We denote by D n the subgroup of B n consisting of all the signed permutations having an even number of negative entries in their window notation. It is usually called the even-signed permutation group. As a set of generators for D n we take In particular, 0 ∈ Des D (γ) if and only if γ(1) + γ(2) < 0. We set des D (γ) := |Des D (γ)|.
For all non-negative integers n ≥ k, we set: and we call them the Eulerian numbers of type D.

Set partitions of types B and D
In this section, we introduce the concepts of set partitions of types B and D as defined by Reiner [15].
As mentioned above, we denote by L(W) the intersection lattice corresponding to the Coxeter hyperplane arrangement W of a finite Coxeter group W . We will focus only on the hyperplane arrangements of types A, B and D. In terms of the coordinate functions x 1 , . . . , x n in R n , they can be defined as follows: It is well-known that in type A, the intersection lattice L(A n ) is isomorphic to the lattice of set partitions of [n].
In type B, let us consider the following element of L(B 9 ): It can be easily presented as the following set partition of [±9]: This probably was Reiner's motivation to define the set partitions of type B, as follows: Definition 3.1. A B n -partition is a set partition of [±n] into blocks such that the following conditions are satisfied: • There exists at most one block satisfying −C = C, called the zero-block. It is a subset of [±n] of the form {±i | i ∈ S} for some S ⊆ [n].
• If C appears as a block in the partition, then −C also appears in that partition.
A similar definition holds for set partitions of type D: Definition 3.2. A D n -partition is a B n -partition such that the zero-block, if exists, contains at least two positive elements.
We denote by S B (n, r) (resp. S D (n, r)) the number of B n -(resp. D n -) partitions having exactly r pairs of nonzero blocks. These numbers are called Stirling numbers (of the second kind) of type B (resp. type D). They correspond, respectively, to the sequences oeis.org/A039755 and oeis.org/A039760 in the OEIS. Tables 1 and 2 record these numbers for small values of n and r.
We now define the concept of an ordered set partition:  Table 2. Stirling numbers S D (n, r) of the second kind of type D. Definition 3.3. A B n -partition (or D n -partition) is ordered if the set of blocks is totally ordered and the following conditions are satisfied: • If the zero-block exists, then it appears as the first block.
• For each block C which is not the zero-block, the blocks C and −C are adjacent.
Example 3.4. The following partitions are respectively, a B 5 -partition which is not a D 5 -partition, a D 4 -partition with no zero-block, and an ordered D 5 -partition having a zero-block.

Connections between Stirling and Eulerian numbers of types B and D
In this section, we present two generalizations of Theorem 1.1 for Coxeter groups of types B and D.
Theorem 4.2. For all non-negative integers n ≥ r, with n = 1, we have: is the usual Stirling number of the second kind.
Now, by inverting these formulas, similarly to the known equality in type A, mentioned in [7, Corollary 1.18]: we get the following expressions for the Eulerian numbers of type B (resp. type D) in terms of the Stirling numbers of type B (resp. type D): For all non-negative integers n ≥ k, we have: Corollary 4.4. For all non-negative integers n ≥ k, with n = 1, we have:

4.1.
Proof for type B. The proofs in this and in the next subsections use arguments similar to Bona's proof for the corresponding identity for type A, see [7, Theorem 1.17].
Proof of Theorem 4.1. We have to prove the following equality: The number 2 r r!S B (n, r) in the left-hand side is the number of ordered B npartitions having r pairs of nonzero blocks. Now, let us show that the right-hand side counts the same set of partitions in a different way.
Let β ∈ B n be a signed permutation with des B (β) = k, written in its window notation. We start by adding a separator after each descent of β and after β(n). If 0 ∈ Des B (β), this means that a separator is added before β(1). If r > k, we add extra r − k artificial separators in some of the n − k empty spots, where by a spot we mean a gap between two consecutive entries of β or the gap before the first entry β(1). This splits β into a set of r blocks, where the block C i is defined as the set of entries between the ith and the (i + 1)th separators for 1 ≤ i ≤ r. Now, this set of blocks is transformed into the ordered B n -partition with r pairs of nonzero blocks: There are exactly n−k r−k ordered B n -partitions obtained from β in this way. From now on, we refer to this process of creating B n -partitions starting from a single signed permutation β, as the B-procedure.
It is easy to see that the B-procedure applied to different signed permutations produces disjoint sets of ordered B n -partitions; therefore, one can create in this way r k=0 A B (n, k) n−k r−k distinct ordered B n -partitions with r pairs of nonzero blocks. Let us show that any ordered B n -partition λ = [C 0 , C 1 , −C 1 , . . . , C r , −C r ], can be obtained through the B-procedure. If λ contains a zero-block C 0 , then put the positive elements of C 0 in increasing order at the beginning of a sequence S, and add a separator after them. Then, order increasingly the elements in each of the blocks C 1 , . . . , C r , and write them sequentially in S (after the first separator if exists), by adding a separator after the last entry coming from each block. Reading the formed sequence S from the left to the right, one obtains the window notation of a signed permutation β. Note that the number of descents in β is smaller than or equal to r, since the elements in each block are ordered increasingly. Now, it is clear that λ can be obtained by applying the B-procedure to β, where the artificial separators are easily recovered. be an ordered B 5 -partition. The corresponding signed permutation with the added separators is β = [ 1, 4 5 | − 3, 2 | ] ∈ B 5 . Note that although C 1 = {5} is a separate block, there is no descent between 4 and 5, meaning that λ is obtained by adding an artificial separator in the spot between these two entries, denoted .

4.2.
Proof for type D. The proof of Theorem 4.2 is a bit more tricky. The basic idea is the same as before: obtaining the whole set of ordered D n -partitions with r pairs of nonzero blocks from elements in D n with at most r descents. We will use the B-procedure presented in the previous subsection, with the addition of an extra step, to take care of the special structure of the D n -partitions. First of all, we recall that we might have Des D (γ) = Des B (γ) for γ ∈ D n , see an example at the end of Section 2.
Let γ ∈ D n be such that des D (γ) = k. We start by adding the separators after the D-descents of γ and the artificial ones in case that k < r. Using the Bprocedure, we transform γ, equipped with the set of separators, into a B n -partition. The result is also a D n -partition, except in the case when there is a separator (either induced by a D-descent or by an artificial addition) between γ(1) and γ(2), but not before γ(1). In fact, in this case, we obtain an ordered B n -partition with a zero-block containing exactly one pair of elements, which is not a D n -partition.
Hence, only in this case, we slightly modify the algorithm as follows. First we toggle the sign of γ(1) and move the separator from after γ(1) to before it. We call this action the switch operation. Then, we transform this new sequence of entries and separators into a D n -partition by applying the B-procedure. We refer to this process of associating a permutation γ ∈ D n with the obtained set of ordered D n -partitions, as the D-procedure.
Before proving that this procedure indeed creates ordered D n -partitions, we give an example of an element γ ∈ D n , for which the application of the switch operation is required. As in type B, it is easy to see that by applying the D-procedure to all the permutations in D n , we obtain disjoint sets of ordered D n -partitions, though, in this case we do not obtain all of them. The next lemma specifies exactly which D npartitions are not reached: Lemma 4.7. The ordered D n -partitions with r pairs of nonzero blocks, which cannot be obtained by the D-procedure are exactly those of the form where * stands for a single element of [±n], and such that the total number of negative entries in the blocks C 1 = { * }, C 2 , . . . , C r is odd.
Proof. First of all, we remark that when the D-procedure is applied to a permutation (equipped with separators) without the use of the switch operation, it produces ordered D n -partitions [C 0 , C 1 , −C 1 , . . . , C r , −C r ] with an even number of negative entries in the union C 1 ∪ C 2 ∪ · · · ∪ C r . Let us call an ordered D n -partition even (resp. odd) if it satisfies (resp. does not satisfy) the latter condition. In contrast, if the switch operation is applied, only odd partitions of the form [C 1 , −C 1 , . . . , C r , −C r ] without a zero-block are obtained, and the first block C 1 contains at least the two entries γ(1) and γ (2).
From this it follows that the partitions in (7) cannot be reached.
Let us show, that all other ordered D n -partitions can be obtained using the D-procedure.
Let λ = [C 0 , C 1 , −C 1 , . . . , C r , −C r ] be an ordered D n -partition with a non-empty zero-block C 0 . We look for the preimage γ ∈ D n of λ. Since the switch operation on a permutation γ ∈ D n produces D n -partitions without a zero-block, in our case the switch operation has not been applied to γ.
We start by defining a sequence S as follows: we first put the positive entries of C 0 in their natural increasing order as the first elements of S, followed by a separator. If λ is odd, we change the sign of the first entry of S to be negative. Now, as described in the proof of Theorem 4.1, we complete S by concatenating the r sequences composed by the elements of the blocks C 1 , . . . , C r , where in each block the elements are ordered increasingly and followed by a separator. We now consider the obtained sequence S as a permutation γ ∈ D n . Note that 0 / ∈ Des D (γ), since by construction |γ(1)| < γ(2) and so γ(1) + γ(2) > 0. Moreover, it is clear that applying the D-procedure to γ yields the partition λ.
If λ is even, it is easy to see that the above construction without the initial step of reordering C 0 , produces γ ∈ D n which is the preimage of λ.
Finally, if λ is odd and is not listed in Equation (7) it means that the first block C 1 has at least two elements, and that the switch operation is necessary (due to the parity). As before, we define a sequence S by reordering increasingly all the blocks C i . Since C 1 has at least two elements, we have that S(1) < S(2). Since the partition is odd with no zero-block, we have applied a switch operation on its preimage. Therefore, the sign of S(1) is negative. Now consider S as a permutation γ ∈ D n . It is easy to see that the obtained permutation γ ∈ D n is indeed the preimage of λ.
We give now two examples of the reverse procedure: both examples are ordered odd D 5 -partitions, but one has a zero-block, while the other has no zero-block, so the latter requires the switch operation. be an ordered odd D 5 -partition with a zero-block C 0 which is odd since we have one negative sign in {3} ∪ {−5, 2}. For recovering its preimage γ 1 ∈ D 5 , we choose the negative sign for the smallest positive entry in the zero-block, which is 1. After inserting the other positive entry of C 0 and a separator, we insert the other blocks, where each block is ordered increasingly followed by a separator, to obtain the permutation: which is the preimage of the partition λ 1 using the D-procedure. be an ordered odd D 5 -partition without a zero-block. Hence, it is created by the switch operation. First, by the standard reverse procedure, we get the element: Then, after performing the toggling of the sign of the first digit, we obtain: that is the permutation from which the partition λ 2 is obtained. Note that in this case, artificial separators are not needed.
We can now complete the proof of Theorem 4.2.
Proof of Theorem 4.2. The equation in the statement of the theorem is equivalent to the following: The left-hand side of the above equation counts the number of ordered D npartitions with r pairs of nonzero blocks. The right-hand side counts the same set of partitions divided in two categories: those coming from the D-procedure, that are induced by permutations counted in A D (n, k), and those that are not, which are listed in Lemma 4.7. It is easy to see that the latter can be enumerated in the following way: first choose the absolute value of the unique element in C 1 = { * }, which can be done in n ways. Then, choose and order the r − 1 remaining blocks, which can be done in (r − 1)! · S(n − 1, r − 1) ways. Finally, choose the sign of each entry in the blocks C 1 , C 2 , . . . , C r , in such a way that an odd number of entries will be signed, and this can be done in 2 n−1 ways. This completes the proof.

Falling factorials for Coxeter groups of types B and D
In this section, we present generalizations of Theorem 1.2 for Coxeter groups of types B and D and provide combinatorial proofs for them.

Type B.
The following theorem is a natural generalization of Theorem 1.2 for the Stirling numbers of type B, and it is a particular case of an identity appearing in Bala [2], where the numbers S B (n, k) correspond to the sequence denoted there by S (2,0,1) . Bala uses generating functions techniques for proving this identity.
Theorem 5.1 (Bala). Let x ∈ R and let n ∈ N. Then we have where and [x] B 0 := 1. A combinatorial interpretation of S B (n, k) using the model of k-attacking rooks was given by Remmel and Wachs [17] (specifically, this is S 0,2 n,k (1, 1) in their notation). More information on the rook interpretation of this and other factorization theorems can be found in Miceli and Remmel [13].
Here we provide a kind of a geometric proof, suggested to us by Reiner, which is related to a method used by Blass and Sagan [6] to compute the characteristic polynomial of the poset L(B n ).
Proof. Being a polynomial identity, it is sufficient to prove it only for odd integers The left-hand side of Equation (8) counts the number of lattice points in the ndimensional cube {−m, −m+1, . . . , −1, 0, 1, . . . , m} n . We show that the right-hand side of Equation (8) counts the same set of points using the maximal intersection subsets of hyperplanes the points lay on.
For the first pair of nonzero blocks ±C 1 of the set partition λ, if j 1 ∈ C 1 ∪ −C 1 then there are x − 1 possibilities (excluding the value 0) to choose the value of x j1 . For the second pair of blocks ±C 2 of the partition λ, we have x − 3 possibilities (excluding the value 0 and the value x j1 chosen for ±C 1 and its negative). We continue in this way until we get x − (2k − 3) possibilities for the last pair of blocks ±C k .
In particular, for k = 0, λ consists of only the zero-block {±1, . . . , ±n}, and is associated with the single lattice point (0, . . . , 0); for k = n, the only B n -partition having n pairs of nonzero blocks is {±{1}, . . . , ±{n}} which corresponds to the lattice points (x 1 , . . . , x n ) such that x i = ±x j = 0 for all i = j. Note that these are the (x − 1)(x − 3) · · · (x − (2n − 1)) lattice points that do not lie on any hyperplane.   For k = 1, we have four B 2 -partitions, two of them contain a zero-block: and two of them do not: The partitions λ 1 and λ 2 correspond to the axes x 1 = 0 and x 2 = 0, respectively. The second pair λ 3 and λ 4 corresponds to the diagonals x 1 = x 2 and x 1 = −x 2 respectively. Each of these hyperplanes contains 6 lattice points (since the origin is excluded). For k = 2, the single B 2 -partition: corresponds to the set of lattice points (x 1 , x 2 ) with x 1 = ±x 2 = 0, which are those not lying on any hyperplane.

Type D.
The falling factorial in type D is defined as follows: (see [6]) We have found no generalization of Equation (3) for type D in the literature, so we supply one here.
Theorem 5.4. For all n ∈ N and x ∈ R: Proof. For D n -partitions having 0 ≤ k < n pairs of nonzero blocks the proof goes verbatim as in type B, so let k = n.
In this case, we have only one possible D n -partition having n pairs of nonzero blocks: {±{1}, . . . , ±{n}}. We associate this D n -partition with the lattice points of the form (x 1 , . . . , x n ) such that x i = ±x j for i = j, having at most one appearance of the value 0. Note that the points with exactly one appearance of 0 cannot be obtained by any D n -partition having k < n blocks, since the zero-block cannot consist of exactly one pair. If 0 does appear, then we have to place it in one of the n coordinates and then we are left with (x − 1)(x − 3) · · · (x − (2n − 3)) possibilities for the rest, while if 0 does not exist, then we have (x − 1)(x − 3) · · · (x − (2n − 1)) possibilities. These two values sum up to a total of )(x − (n − 1)). As in type B, this number is equal to the evaluation of the characteristic polynomial χ(D n , x) of L(D n ), where x is odd.
Note that during the above process of collecting lattice points of the n-dimensional cube, the points containing exactly one appearance of 0 and at least two nonzero coordinates are assigned the same absolute value are not counted, since the zeroblock (if exists) must contain at least two elements. This phenomenon happens when n > 2, and the number of such points is n((x − 1) n−1 − [x] D n−1 ). This concludes the proof.  For k = 2, as before, there is a single D n -partition with two pairs of nonzero blocks: λ = {±{1}, ±{2}}. The lattice points corresponding to this set partition are those with different values in their coordinates, i.e. x 1 = x 2 , but in the case of type D (in contrast to type B) the value 0 can also appear. In the figure, these are all the lattice points which do not lie on the diagonals.
Note that in the case n = 2 the second term in Equation (9) is 0 and hence does not count any missing lattice points, since we have already counted all the points. The missing points start to appear from n = 3, as presented in the next example.
Example 5.6. Let n = m = 3, so that x = 2m + 1 = 7. The lattice points which are not counted have the form (x 1 , x 2 , x 3 ), such that exactly one of their coordinates is 0 and the other two share the same absolute value, e.g. the lattice points (0, 2, 2) and (0, 2, −2) are not counted. In this case, the number of such missing lattice points (which is the first summand in the right-hand side of Equation (9)) is: 3 · 6 2 − 3 · 6 · 4 = 36.

Some generalizations
In this section, we present some generalizations and variants related to our main results in some different directions. In Section 6.1, we start with a short introduction to the colored permutations group and we generalize Theorems 4.1 and 5.1 to this case. In Section 6.2, we provide a version of Theorem 4.1 for the flag descent parameter in type B. A convenient way to look at G m,n is to consider the alphabet Σ := 1, . . . , n, 1 [1] , . . . , n [1] , . . . , 1 [m−1] , . . . , n [m−1] , as the set [n] colored by the colors 0, . . . , m − 1. Then, an element of G m,n is a bijection π : Σ → Σ satisfying the following condition: where the exponent [·] is computed modulo m. The elements of G m,n are usually called colored permutations.
In particular, G 1,n = S n is the symmetric group, while G 2,n = B n is the group of signed permutations.
Definition 6.4. A G m,n -partition is a set partition of Σ into blocks such that the following conditions are satisfied: • There exists at most one block satisfying C [1] = C. This block will be called the zero-block.
• If C appears as a block in the partition, then C [1] also appears in that partition. Two blocks C 1 and C 2 will be called equivalent if there is a natural number t ∈ N such that C 1 = C [t] 2 . The number of G m,n -partitions with r non-equivalent nonzero blocks is denoted by S m (n, r).
For example, the following is a G 3,4 − partition: We define now the concept of an ordered G m,n -partition: Definition 6.5. A G m,n -partition is ordered if the set of blocks is totally ordered and the following conditions are satisfied: • If the zero-block exists, then it appears as the first block.
The generalization of Theorem 1.1 in this setting is as follows.
Theorem 6.6. For all positive integers n, m and r, we have: The proof is similar to that of Theorem 4.1, so it is omitted.
In order to generalize Theorem 1.2, we define the falling factorial of type G m,n as follows: (see Equation 15 in [2]) We have: Theorem 6.7. Let x ∈ R and n ∈ N. Then we have: We present here the idea of the proof.
Sketch of the proof. Divide the unit circle S 1 in the plane into m parts according to the mth roots of unity: 1, ρ m , ρ 2 m , . . . , ρ m−1 m , see Figure 3, where m = 3 and the roots are represented by small bullets. This divides the circle into m arcs. Now, in each arc, locate t points in equal distances from each other (see Figure 3 where t = 5 and the points are represented by small lines). Including the point (1, 0), we get x = mt + 1 points on the unit circle.
Consider now the n-dimensional torus (S 1 ) n = S 1 × · · · × S 1 with x n lattice points on it. The same arguments we presented in the proof of Theorem 5.1 will apply now to Theorem 6.7, when we interpret the G m,n -partitions as intersections of subsets of hyperplanes in G m,n , where by G m,n we mean the following generalized hyperplane arrangement for the colored permutations group: See e.g. [14, p. 244].
6.2. The flag descent parameter for the Coxeter group of type B. Another possibility to generalize these results is to consider the flag descent statistics defined on group of signed permutations. Such parameters produce, in this context, similar expressions of those presented in the previous sections, but less elegant. As an example, we show here only one of these possible extensions. This is a different generalization of Theorem 4.1 by using the flag-descent number fdes, that is defined in [1] for a signed permutation β ∈ B n : fdes(β) := 2 · des A (β) + ε(β).
We denote by A * B (n, k) the number of permutations β ∈ B n satisfying fdes(β) = k − 1, and by S * B (n, r) the number of B n -partitions having exactly r blocks. Here,