Date: Friday, February 10, 2012
Location: 3866 East Hall (4:10 PM to 5:00 PM)
Title: WCells from Scratch
Abstract: A Wgraph is an edgeweighted graph that encodes certain
representations of a Weyl group W or its associated Hecke algebra. In particular, the action of the Hecke algebra by left or right
multiplication on its KazhdanLusztig basis has this form. Knowing
the Wgraph makes the computation of KazhdanLusztig polynomials
relatively easy.
<br><br>
In this talk we will describe a method, not yet completely effective,
for constructing the (necessarily finite) set of "admissible" Wcells.
This is a class of Wgraphs that includes the cells (i.e., strongly
connected components) of the KazhdanLusztig Wgraph. For example,
in type A up to rank 9, we know that the only admissible cells are
the KL cells, but this fails for general W.
Files:
Speaker: John Stembridge
Institution: University of Michigan
Event Organizer:
