Freely braided elements in Coxeter groups.

DOI10.1007/S000260200008MaRDI QIDQ1400787zbMATH OpenOpenAlexFDO

Authors R. M. Green, Jozsef Losonczy

Publication date 14 August 2003

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0301104, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.236.6878

zbMATH Keywords

root systemsbraid relationscommutation graphssimply laced Coxeter groupscommutation classesroot sequences

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Generators, relations, and presentations of groups (20F05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Free semigroups, generators and relations, word problems (20M05)

Abstract: 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$.

Recommendations

• Freely braided elements in Coxeter groups. II.
• Some combinatorial aspects of reduced words in finite Coxeter groups
• scientific article; zbMATH DE number 5059399
• On the fully commutative elements of Coxeter groups
• scientific article; zbMATH DE number 2159652

Cited in

(19)

• A refinement of weak order intervals into distributive lattices
• On inversion triples and braid moves
• Posets from admissible Coxeter sequences.
• The enumeration of permutations whose posets have a maximum element
• Maximally clustered elements and Schubert varieties.
• Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations.
• Bruhat inversions in Weyl groups and torsion-free classes over preprojective algebras
• The enumeration of fully commutative affine permutations
• Reduced decompositions and permutation patterns
• Enumerations relating braid and commutation classes
• Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes
• scientific article; zbMATH DE number 5059399 (Why is no real title available?)
• Low elements and small inversion sets are in bijection in rank 3 Coxeter graphs
• Enumeration Schemes for Restricted Permutations
• scientific article; zbMATH DE number 2159652 (Why is no real title available?)
• On the maximally clustered elements of Coxeter groups.
• The enumeration of maximally clustered permutations
• Freely braided elements in Coxeter groups. II.
• A root system criterion for fully commutative and short braid-avoiding elements in affine Weyl groups

This page was built for publication: Freely braided elements in Coxeter groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400787)