**Problem of the Week**

**Math Club**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

seminars:comb:abstract.201011bla

A Coxeter group W is a group generated by reflections; examples are the symmetric group and the hyperoctahedral group. These groups have many interesting combinatorial properties. For instance, one can define a partial order, called the Bruhat order, on the elements of W. Let [u,v] be an interval in the Bruhat order. The Bruhat graph of [u,v], B(u,v), includes the Hasse diagram of the poset [u,v] with edges directed upwards, as well as other edges that I will describe in the talk. A u-v path is a chain in [u,v], but while not every u-v chain is a u-v path, every maximal u-v chain is such a path (of greatest length).

While the poset of maximal chains in [u,v] is well understood (it is the face poset of a regular cell decomposition of a sphere), not much is known about the other u-v paths in B(u,v). In this talk, we describe properties of the poset of shortest u-v paths.

seminars/comb/abstract.201011bla.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported