Login with your Reed credentials to view all events.

Summing maximal chains in the circular Bruhat order - 

The set of permutations of $n$ objects has a natural partial
ordering called the \emph{Bruhat order}.  In 2001, John Stembridge gave a formula for counting the number of maximal chains (walks from smaller elements to larger elements) in this ordering.  We will consider a variant of the Bruhat order arising from geometry and present a conjecture for a corresponding Stembridge-like formula. No knowledge beyond the idea of a permutation will be assumed.

Event Details

0 people are interested in this event