Author: Drew Armstrong
Publisher: American Mathematical Soc.
Published: 2009-10-08
Total Pages: 176
ISBN-13: 0821844903
DOWNLOAD EBOOKThis memoir is a refinement of the author's PhD thesis -- written at Cornell University (2006). It is primarily a desription of new research but also includes a substantial amount of background material. At the heart of the memoir the author introduces and studies a poset $NC^{(k)}(W)$ for each finite Coxeter group $W$ and each positive integer $k$. When $k=1$, his definition coincides with the generalized noncrossing partitions introduced by Brady and Watt in $K(\pi, 1)$'s for Artin groups of finite type and Bessis in The dual braid monoid. When $W$ is the symmetric group, the author obtains the poset of classical $k$-divisible noncrossing partitions, first studied by Edelman in Chain enumeration and non-crossing partitions.
Book Synopsis Generalized Noncrossing Partitions and Combinatorics of Coxeter Groups by : Drew Armstrong
Download or read book Generalized Noncrossing Partitions and Combinatorics of Coxeter Groups written by Drew Armstrong and published by American Mathematical Soc.. This book was released on 2009-10-08 with total page 176 pages. Available in PDF, EPUB and Kindle. Book excerpt: This memoir is a refinement of the author's PhD thesis -- written at Cornell University (2006). It is primarily a desription of new research but also includes a substantial amount of background material. At the heart of the memoir the author introduces and studies a poset $NC^{(k)}(W)$ for each finite Coxeter group $W$ and each positive integer $k$. When $k=1$, his definition coincides with the generalized noncrossing partitions introduced by Brady and Watt in $K(\pi, 1)$'s for Artin groups of finite type and Bessis in The dual braid monoid. When $W$ is the symmetric group, the author obtains the poset of classical $k$-divisible noncrossing partitions, first studied by Edelman in Chain enumeration and non-crossing partitions.