The type-BC indifference graph equivalence conjecture for Kazhdan–Lusztig basis elements

Let v,wBnv,w\in\mathfrak{B}_n avoid the patterns 34123412 and 42314231. Write Γ(v)\Gamma(v) and Γ(w)\Gamma(w) for their type-BC\mathsf{BC} indifference graphs, and let C~vBC(q),C~wBC(q)\widetilde{C}_{v}^{\mathsf{BC}}(q),\widetilde{C}_{w}^{\mathsf{BC}}(q) be the corresponding Kazhdan–Lusztig basis elements. For elements of HnB(q)H_n^{\mathfrak{B}}(q), define D1qD2D_1\approx_qD_2 when every trace θqT(HnB(q))\theta_q\in\mathcal{T}(H_n^{\mathfrak{B}}(q)) has θq(D1)=θq(D2)\theta_q(D_1)=\theta_q(D_2). The type-BC indifference graph conjecture. If Γ(v)Γ(w)\Gamma(v)\cong\Gamma(w), then

C~vBC(q)qC~wBC(q).\widetilde{C}_{v}^{\mathsf{BC}}(q)\approx_q\widetilde{C}_{w}^{\mathsf{BC}}(q).

The corresponding implication at q=1q=1 is known only in the reverse direction, so this strengthening remains open even for the indicated pattern-avoiding elements.

Sources & referencesView supporting material

Primary source

Mark Skandera, “Hyperoctahedral group characters and a type-BC analog of graph coloring”, arXiv:2402.04148 (2025).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.