Reduced words in affine Coxeter groups (Q1924363): Difference between revisions

For an element \(w\) of a Coxeter group \((W,S)\), a reduced word for \(w\) is obtained by writing \(w\) as a minimal product of generators. Let \(r(w)\) denote the number of reduced words for \(w\). \textit{R. P. Stanley} [Eur. J. Comb. 5, 359-372 (1984; Zbl 0587.20002)] and \textit{P. Edelman} and \textit{C. Greene} [Adv. Math. 63, 42-99 (1987; Zbl 0616.05005)] studied the number of reduced words for the elements of \(A_n\). \textit{M. D. Haiman} [Discrete Math. 99, No. 1-3, 79-113 (1992; Zbl 0760.05093)] generalized their work to include the finite Coxeter group \(B_n\) as well. The present paper establishes a general recurrence for \(r(w)\) if \(w\) is an element of any affine Coxeter group. In case of \(\widetilde A_n\) the recurrence takes a nice combinatorial form.