The generating function for the number of roots of a Coxeter group (Q1300628)

Let \((W,R)\) be a Coxeter system of finite rank \(|R|\). Then \(W=\langle r\in R:(rs)^{m_{rs}}=1\) for \(r,s\in R\rangle\), where \(m_{rr}=1\) and \(m_{rs}\geq 2\) for \(r,s\in R\), \(r\neq s\) (with \(m_{rs}=\infty\) allowed). Let \(\Pi=\{\alpha_r:r\in R\}\) be the basis of an \(\mathbb{R}\)-vector space \(V\). The set \(\Phi=\{w\cdot\alpha_r:w\in W,\;r\in R\}\subset V\) is called the root system of \(W\). Let \(\Phi^+\) denote the set of positive roots, and \(\Phi^-=-\Phi^+\). Let \(w\in W\). By \(l(w)\) is denoted the length of \(w\). For \(\alpha\in\Phi^+\) the depth \(\text{dp}(\alpha)\) of \(\alpha\) is defined as \(\text{dp}(\alpha)=\min\{l(w):w\in W,\;w\cdot\alpha\in\Phi^-\}\). Let \(\alpha,\beta\in\Phi^+\). We say that \(\alpha\) dominates \(\beta\) with respect to \(W\), iff for all \(w\in W\), \(w\cdot\alpha\in\Phi^-\) implies \(w\cdot\beta\in\Phi^-\). This defines a partial order on \(\Phi^+\). Let \(\varepsilon\subset\Phi^+\) denote the set of minimal elements with respect to this ordering. The elements of \(\varepsilon\) are called elementary roots. Using elementary roots and finite automata, the author shows that the generating function counting the depths of the roots of a Coxeter group of finite rank is rational.