Signed (p,q)(p,q)-enumerator identities for type B permutations

From papers

Let BnB_n be the hyperoctahedral group of signed permutations, and for σBn\sigma\in B_n let fwex(σ)\mathsf{fwex}(\sigma), ¬(σ)\mathsf{\neg}(\sigma), nestB(σ)\mathsf{nest}_B(\sigma), and croB(σ)\mathsf{cro}_B(\sigma) denote respectively the flag weak excedance, number of negative entries, type B nesting number, and type B crossing number. Let Rn(t,p,q)R_{n}(t,p,q) be the (p,q)(p,q)-derivative polynomial defined in the surrounding text. For n1n\geq 1, the signed type B enumerator identities.

σBn(1)fwex(σ)2t¬(σ)pnestB(σ)qcroB(σ)={(1)n2(t+1)Rn1(t,p,q)if n is odd,(1)n12(t1)Rn1(t,p,q)if n is even,\sum_{\sigma\in B_n}(-1)^{\left\lfloor \frac{\mathsf{fwex}(\sigma)}{2}\right\rfloor}t^{\mathsf{\neg}(\sigma)}p^{\mathsf{nest}_B(\sigma)}q^{\mathsf{cro}_B(\sigma)}=\begin{cases}(-1)^{\frac n2}(t+1)R_{n-1}(t,p,q)&\text{if $n$ is odd},\\(-1)^{\frac{n-1}{2}}(t-1)R_{n-1}(t,p,q)&\text{if $n$ is even},\end{cases}

and

σBn(1)fwex(σ)2t¬(σ)pnestB(σ)qcroB(σ)={(1)n2(t1)Rn1(t,p,q)if n is even,(1)n+12(t+1)Rn1(t,p,q)if n is odd.\sum_{\sigma\in B_n}(-1)^{\left\lceil \frac{\mathsf{fwex}(\sigma)}{2}\right\rceil}t^{\mathsf{\neg}(\sigma)}p^{\mathsf{nest}_B(\sigma)}q^{\mathsf{cro}_B(\sigma)}=\begin{cases}(-1)^{\frac n2}(t-1)R_{n-1}(t,p,q)&\text{if $n$ is even},\\(-1)^{\frac{n+1}{2}}(t+1)R_{n-1}(t,p,q)&\text{if $n$ is odd}.\end{cases}

These identities give signed refinements of the joint crossing–nesting enumerator for type B permutations in terms of the (p,q)(p,q)-derivative polynomials. The parser provides no resolution evidence, so the status is recorded as open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Hsin-Chieh Liao, “Signed Countings of Type B and D Permutations and t,q-Euler numbers”, arXiv:2006.13688 (2020).

Solutions 0

No solutions have been posted yet.