Let Bn be the hyperoctahedral group of signed permutations, and for σ∈Bn let fwex(σ), ¬(σ), nestB(σ), and croB(σ) denote respectively the flag weak excedance, number of negative entries, type B nesting number, and type B crossing number. Let Rn(t,p,q) be the (p,q)-derivative polynomial defined in the surrounding text. For n≥1, the signed type B enumerator identities.
σ∈Bn∑(−1)⌊2fwex(σ)⌋t¬(σ)pnestB(σ)qcroB(σ)={(−1)2n(t+1)Rn−1(t,p,q)(−1)2n−1(t−1)Rn−1(t,p,q)if n is odd,if n is even,
and
σ∈Bn∑(−1)⌈2fwex(σ)⌉t¬(σ)pnestB(σ)qcroB(σ)={(−1)2n(t−1)Rn−1(t,p,q)(−1)2n+1(t+1)Rn−1(t,p,q)if n is even,if n is odd.
These identities give signed refinements of the joint crossing–nesting enumerator for type B permutations in terms of the (p,q)-derivative polynomials. The parser provides no resolution evidence, so the status is recorded as open.