Freely braided elements in Coxeter groups, II

Simple item page
dc.creatorGreen, R. M.
dc.creatorLosonczy, J.
dc.date2003-10-08
dc.date.accessioned2026-07-07T05:01:44Z
dc.date.available2026-07-07T05:01:44Z
dc.descriptionWe continue the study of freely braided elements of simply laced Coxeter groups, which we introduced in a previous work (math.CO/0301104). A known upper bound for the number of commutation classes of reduced expressions for an element of a simply laced Coxeter group is shown to be achieved only when the element is freely braided; this establishes the converse direction of a previous result. It is also shown that a simply laced Coxeter group has finitely many freely braided elements if and only if it has finitely many fully commutative elements.
dc.descriptionAMSTeX, approximately 19 pages
dc.identifierhttps://arxiv.org/abs/math/0310120
dc.identifierhttp://arxiv.org/abs/math/0310120
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68786
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subject20F55
dc.titleFreely braided elements in Coxeter groups, II
dc.typetext

Files

Collections

arXiv