How many elements of a Coxeter group have a unique reduced expression?

DOI10.1515/JGTH-2017-0009MaRDI QIDQ2406660zbMATH OpenOpenAlexFDO

Authors Sarah B. Hart

Publication date 5 October 2017

Published in Journal of Group Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.01138

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Abstract: Let $(W,R)$ be an arbitrary Coxeter system. We determine the number of elements of $W$ that have a unique reduced expression.

Review text

Let \(W=\langle R : (rs)^{m_{r s}} = 1 , r, s \in R \rangle\) be a Coxeter group with generating set \(R\) of size \(n\) and Coxeter graph \(\Gamma\) with vertex set \(R\) and an edge \((r, s)\) labelled by \(m_{r s}\). Let \(V(\Gamma)\) be the set of elements of \(W\) that have a unique reduced expression. If \(W\) is finite, then \(V(\Gamma)\) is a two sided Kazhdan-Lusztig cell. This paper computes the number \(U(\Gamma) = \lvert V(\Gamma) \rvert\). Assume \(\Gamma\) is connected. Then \(U(\Gamma) < \infty\) if and only if \(\Gamma\) is a finite tree with all \(m_{ r s} < \infty\) and at most one edge with \(m_{rs} > 3\). Suppose \(\Gamma\) is such a graph. If \(\Gamma\) is simply laced, then the elements of \(V(\Gamma)\) correspond to the paths in the tree \(\Gamma\) implying \(U(\Gamma) = n^2\). If \(\Gamma\) has a unique edge with label \(m > 3\) and removing it gives two simply laced induced subgraphs of order \(a\) and \(b\), then \(U(\Gamma) = (\tfrac{1}{2} m n^2 - 2 a b)\) when \(m\) is even and \(U(\Gamma) = \tfrac{1}{2}( m - 1)n^2\) when \(m\) is odd. The proof is a combinatorial argument using Coxeter graphs.

Recommendations

• Reduced expressions in a Coxeter system with a complete Coxeter graph
• The reduced expressions in a Coxeter system with a strictly complete Coxeter graph
• scientific article; zbMATH DE number 5059399
• The enumeration of Coxeter elements
• Reduced words in affine Coxeter groups

Cites work

• scientific article; zbMATH DE number 53657 (Why is no real title available?)
• scientific article; zbMATH DE number 3209202 (Why is no real title available?)
• On the fully commutative elements of Coxeter groups
• On the number of reduced decompositions of elements of Coxeter groups
• Reduced words in affine Coxeter groups
• Simple transitive 2-representations of small quotients of Soergel bimodules
• The enumeration of Coxeter elements

Cited in

(6)

• The verification of a conjecture on left cells of certain Coxeter groups
• Classification of Coxeter groups with finitely many elements of \(\mathfrak{a}\)-value 2
• On inversion triples and braid moves
• The reduced expressions in a Coxeter system with a strictly complete Coxeter graph
• Kazhdan-Lusztig cells of \(\mathbf{a} \)-value 2 in \(\mathbf{a}(2)\)-finite Coxeter systems
• Reduced expressions in a Coxeter system with a complete Coxeter graph

This page was built for publication: How many elements of a Coxeter group have a unique reduced expression?

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