Show simple item record

On the fully commutative elements of Coxeter groups

dc.contributor.authorStembridge, John R.en_US
dc.date.accessioned2006-09-11T17:33:59Z
dc.date.available2006-09-11T17:33:59Z
dc.date.issued1996-10en_US
dc.identifier.citationStembridge, John R.; (1996). "On the fully commutative elements of Coxeter groups." Journal of Algebraic Combinatorics 5(4): 353-385. <http://hdl.handle.net/2027.42/46260>en_US
dc.identifier.issn0925-9899en_US
dc.identifier.issn1572-9192en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/46260
dc.description.abstractLet W be a Coxeter group. We define an element w ε W to be fully commutative if any reduced expression for w can be obtained from any other by means of braid relations that only involve commuting generators. We give several combinatorial characterizations of this property, classify the Coxeter groups with finitely many fully commutative elements, and classify the parabolic quotients whose members are all fully commutative. As applications of the latter, we classify all parabolic quotients with the property that (1) the Bruhat ordering is a lattice, (2) the Bruhat ordering is a distributive lattice, (3) the weak ordering is a distributive lattice, and (4) the weak ordering and Bruhat ordering coincide.en_US
dc.format.extent1624607 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; Springer Science+Business Mediaen_US
dc.subject.otherMathematicsen_US
dc.subject.otherComputer Science, Generalen_US
dc.subject.otherGroup Theory and Generalizationsen_US
dc.subject.otherOrder, Lattices, Ordered Algebraic Structuresen_US
dc.subject.otherCombinatoricsen_US
dc.subject.otherConvex and Discrete Geometryen_US
dc.subject.otherCoxeter Groupen_US
dc.subject.otherReduced Worden_US
dc.subject.otherHeapen_US
dc.subject.otherWeak Orderen_US
dc.subject.otherBruhat Orderen_US
dc.titleOn the fully commutative elements of Coxeter groupsen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, 48109-1109, Ann Arbor, Michiganen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/46260/1/10801_2004_Article_BF00193185.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF00193185en_US
dc.identifier.sourceJournal of Algebraic Combinatoricsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.