← All problems

Bonnafé–Geck–Iancu–Lam conjecture on left cells in type B_n

19 years old · traced to

Let WnW_n be a Weyl group of type BnB_n with weight function LL, and let s=b/as=b/a be its parameter. For each non-negative integer rr, let Gr:Wn→SDTr(n)×SDTr(n)G_r:W_n\to SDT_r(n)\times SDT_r(n) be the generalized Robinson–Schensted map, and write Gr(x)=(Sr(x),Tr(x))G_r(x)=(S_r(x),T_r(x)). The irreducible combinatorial left cells of rank rr are the equivalence classes defined by Tr(x)=Tr(y)T_r(x)=T_r(y); the reducible combinatorial left cells of rank rr are the equivalence classes defined by Tr(y)=MT(Tr(x),C)T_r(y)=MT(T_r(x),C) for some set CC of non-core open cycles.

Bonnafé–Geck–Iancu–Lam conjecture. If s∉Ns\notin\mathbb{N}, the Kazhdan–Lusztig left cells coincide with the irreducible combinatorial left cells of rank ⌊s⌋\lfloor s\rfloor. If s∈Ns\in\mathbb{N}, the Kazhdan–Lusztig left cells coincide with the reducible combinatorial left cells of rank s−1s-1.

This conjecture describes the Kazhdan–Lusztig left-cell decomposition in type BnB_n using generalized Robinson–Schensted algorithms and standard domino tableaux. The paper states that it verifies the conjecture, so the claim is recorded as solved.

References

3 papers in this index state this conjecture (2007–2009). The statement above is taken from the most recent of them; the others are arXiv:0803.3335, arXiv:0710.3846.

Status

Source: Thomas Pietraho, “Module structure of cells in unequal parameter Hecke algebras”, arXiv:0902.1907 (2009).

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.