Speaker:  Saul Blanco
Title:   Chains in the Bruhat Graph
Time: 3:00 PM, Monday, April 21, 2008   Note special time.
Place:  Malott 205

Abstract:  Given a Coxeter group W with reflection set T and an interval [u,v] in the Bruhat oder, one can define the Bruhat graph of [u,v]. This is a directed graph labeled with elements in T. Fixing a reflection ordering for T and looking at the descent distribution of maximal paths in the Bruhat graph, one can define the complete cd-index of the interval. We describe some of the properties of the reflection ordering and their consequences to the complete cd-index.

April 16, 2008