Reduced words in affine Coxeter groups (Q1924363): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(96)83011-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1989909995 / rank | |||
Normal rank |
Latest revision as of 09:41, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Reduced words in affine Coxeter groups |
scientific article |
Statements
Reduced words in affine Coxeter groups (English)
0 references
7 April 1997
0 references
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.
0 references
Coxeter group
0 references
reduced word
0 references