Freely braided elements in Coxeter groups
| dc.creator | Green, R. M. | |
| dc.creator | Losonczy, J. | |
| dc.date | 2003-01-10 | |
| dc.date | 2003-06-17 | |
| dc.date.accessioned | 2026-07-07T04:54:23Z | |
| dc.date.available | 2026-07-07T04:54:23Z | |
| dc.description | We introduce a notion of "freely braided element" for simply laced Coxeter groups. We show that an arbitrary group element $w$ has at most $2^{N(w)}$ commutation classes of reduced expressions, where $N(w)$ is a certain statistic defined in terms of the positive roots made negative by $w$. This bound is achieved if $w$ is freely braided. In the type $A$ setting, we show that the bound is achieved only for freely braided $w$. | |
| dc.description | 18 pages, AMSTeX. Results renumbered to agree with published version | |
| dc.identifier | https://arxiv.org/abs/math/0301104 | |
| dc.identifier | http://arxiv.org/abs/math/0301104 | |
| dc.identifier | Annals of Combinatorics 6 (2002), 337-348 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66228 | |
| dc.subject | Combinatorics | |
| dc.subject | Group Theory | |
| dc.subject | 20F55 | |
| dc.title | Freely braided elements in Coxeter groups | |
| dc.type | text |