Filtered combinatorial invariance conjecture for Kazhdan–Lusztig polynomials

About 3 years old · traced to

Let (W,S)(W,S) be a finite Coxeter system equipped with a canonical filtration

J‾0=(∅=J0⊊J1⊊⋯⊊Jr=S).\underline{J}^0=(\emptyset=J_0\subsetneq J_1\subsetneq\cdots\subsetneq J_r=S).

This filtration gives a reflection-coloring map α:T→{1,…,r}\alpha:T\to\{1,\ldots,r\} by assigning to each reflection the least ii such that it lies in WJiW_{J_i}. Filtered combinatorial invariance conjecture. For any finite Coxeter system, there is an assigned canonical filtration J‾0\underline{J}^0 such that, for two filtered finite Coxeter systems and an isomorphism ϕ\phi of their directed Bruhat intervals, if there is an increasing map γ:{1,…,r1}→{1,…,r2}\gamma:\{1,\ldots,r_1\}\to\{1,\ldots,r_2\} satisfying

γ∘α1(t)=α2(t′)\gamma\circ\alpha_1(t)=\alpha_2(t')

for every edge σ1≤z<tz≤ω1\sigma_1\leq z<tz\leq\omega_1, where t′∈W2t'\in W_2 is the reflection determined by ϕ(tz)=t′ϕ(z)\phi(tz)=t'\phi(z), then

Pσ1,ω1=Pσ2,ω2.P_{\sigma_1,\omega_1}=P_{\sigma_2,\omega_2}.

The conjecture refines combinatorial invariance by requiring preservation of reflection colors up to an increasing relabeling. Its status is not specified in the supplied text.

References

Primary source

Maxim Gurevich and Chuijia Wang, “Parabolic recursions for Kazhdan-Lusztig polynomials and the hypercube decomposition”, arXiv:2303.09251 (2023).

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.