The genericity conjecture for Bruhat-graph sheaf inclusions

From papers

Let (W,S)({\mathcal W},{\mathcal S}) be a Coxeter system with length function ll, and let B(x)[y]B(x)y{\mathscr B}(x)^{[y]}\hookrightarrow {\mathscr B}(x)^y be the inclusion of the costalk into the stalk for y<xy<x. For a graded module MM, let M{k}M_{\{\leqslant k\}} denote the submodule generated in degrees at most kk. The genericity conjecture. For every x,yWx,y\in{\mathcal W} with y<xy<x, this inclusion is generic in the sense that, for every m1m\geq 1,

B(x){l(x)l(y)+m1}[y]B(x){l(x)l(y)m}y=0.{\mathscr B}(x)^{[y]}_{\{\leqslant l(x)-l(y)+m-1\}}\cap {\mathscr B}(x)^y_{\{\leqslant l(x)-l(y)-m\}}=0.

The paper proves that this conjecture implies the degree conjecture, placing it in the proposed inductive route to the Kazhdan–Lusztig conjecture. Its resolution status is not specified in the supplied text.

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

Peter Fiebig, “Kazhdan-Lusztig combinatorics via sheaves on Bruhat graphs”, arXiv:math/0512311 (2006).

Solutions 0

No solutions have been posted yet.