The enumeration of Coxeter elements (Q679088): Difference between revisions

Let \(W\) be a Coxeter group with a finite distinguished generator set, \(S\), and Coxeter graph, \(\Gamma\). A Coxeter element of \(W\) is a product of all the generators. Let \(C(W)\) denote the set of Coxeter elements in \(W\). The author shows that \(C(W)\) is in one-to-one correspondence with the set of all acyclic orientations of \(\Gamma\). Let \(c(W)\) denote the cardinality of \(C(W)\). A recurrence formula for \(c(W)\) is given and this number is determined for several large classes of Coxeter groups as well as for some particular examples.