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

braid relationscommutation classescommutation graphsroot sequencesroot systemssimply laced Coxeter groups

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

Review text

Let \((W,S)\) be a Coxeter group of some simply-laced type. Let \(\Phi\) be the root system of \((W,S)\) and \(\Phi^+\) and \(\Phi^-\) the positive and negative roots, respectively. For \(w\in W\), let \(\Phi(w)=\Phi^+\cap w^{-1}\Phi^-\) be the `inversion set' of \(w\). Every reduced expression of \(w\) defines a `root sequence' for \(w\). Any subset of \(\Phi(w)\) of the form \(\{\alpha,\alpha+\beta,\beta\}\) will be called an `inversion triple' of \(w\). An inversion triple \(T\) is called `contractible' if there is a root sequence for \(w\) in which the elements of \(T\) appear consecutively. If the contractible inversion triples of \(w\) are pairwise disjoint, then \(w\) is said to be `freely braided'. The Coxeter matrix associated with \((W,S)\) has entries \(m(s,t)\), where \(s,t\in S\). Here \(m(s,t)=1,2\), or \(3\) since \((W,S)\) is of a simply-laced type. Let \(S^*\) be the free monoid generated by \(S\). The authors introduce braid relations on \(S^*\) which are called short if \(m(s,t)=2\) and long if \(m(s,t)=3\). They use the term `commutation class' to refer to any equivalence class arising from the equivalence relation on \(S^*\) generated by the short braid relations. The authors show that every \(w\in W\) has at most \(2^{N(w)}\) commutation classes, where \(N(w)\) denotes the number of contractible inversion triples of \(w\); also, if \(w\) is freely braided, then \(w\) has precisely \(2^{N(w)}\) commutation classes of root sequences. They define a commutation graph \(G(W)\) for \(w\in W\) and they show that this graph is bipartite. If \((W,S)\) is of type \(A\), then they obtain more detailed results.

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)

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

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)