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

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.