Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Light leaves and Lusztig's conjecture (1304.1448v2)

Published 4 Apr 2013 in math.RT and math.GR

Abstract: We introduce the Double leaves basis, a combinatorial basis for the Hom spaces between two Bott-Samelson-Soergel bimodules. As an application we give a combinatorial algorithm to find, for any given Weyl or affine Weyl group, the set of primes for which Soergel's conjecture hold. This conjecture for Weyl groups is equivalent to a part of Lusztig's conjecture and for affine Weyl groups implies (and is probably equivalent to) the full Lusztig conjecture. Following this double leaves approach G. Williamson found counterexamples to Lusztig's conjecture. The double leaves basis has found other spectacular applications in the recent proof by B. Elias and G. Williamson of the positivity of the coefficients of Kazhdan-Lusztig polynomials for any Coxeter system and in their algebraic proof of Kazhdan-Lusztig conjecture.

Summary

We haven't generated a summary for this paper yet.