Bruhat order on classical Weyl groups: Minimal chains and covering relation
2005 (English)In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 26, no 5, 729-753 p.Article in journal (Refereed) Published
In this paper we study some aspects of the Bruhat order on classical Weyl groups, obtaining a direct combinatorial description of the minimal chains, that is chains with the lexicographically minimal labelling. Moreover, we find a combinatorial characterization of the covering relation in the hyperoctahedral group and in the even-signed permutation group, providing results analogous to the well-known characterization of the covering relation in the symmetric group. © 2004 Elsevier Ltd. All rights reserved.
Place, publisher, year, edition, pages
2005. Vol. 26, no 5, 729-753 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-50476DOI: 10.1016/j.ejc.2004.03.006OAI: oai:DiVA.org:liu-50476DiVA: diva2:271372