JOURNAL OF
ALGEBRAIC
COMBINATORICS

Home > Vol 7, No 3 (1998)

John R. Stembridge

A Coxeter group element w is fully commutative if any reduced expression for w can be obtained from any other via the interchange of commuting generators. For example, in the symmetric group of degree n, the number of fully commutative elements is the nth Catalan number. The Coxeter groups with finitely many fully commutative elements can be arranged into seven infinite families A _n, B _n, D _n, E _n,F _n, H _n and I ₂(m). For each family, we provide explicit generating functions for the number of fully commutative elements and the number of fully commutative involutions; in each case, the generating function is algebraic.

1. S. Billey, W. Jockusch, and R. Stanley, “Some combinatorial properties of Schubert polynomials,” J. Alg. Combin. 2 (1993), 345-374.
2. N. Bourbaki, Groupes et Alg`ebres de Lie, Masson, Paris, Chapters IV-VI, 1981.
3. L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, 1974.
4. C.K. Fan, “A Hecke algebra quotient and properties of commutative elements of a Weyl group,” Ph.D. Thesis, MIT, 1995.
5. C.K. Fan, “Structure of a Hecke algebra quotient,” J. Amer. Math. Soc. 10 (1997), 139-167.
6. I.P. Goulden and D.M. Jackson, Combinatorial Enumeration, Wiley, New York, 1983.
7. J. Graham, “Modular representations of Hecke algebras and related algebras,” Ph.D. Thesis, University of Sydney, 1995.
8. J.E. Humphreys, Reflection Groups and Coxeter Groups, Cambridge University Press, Cambridge, 1990.
9. J.R. Stembridge, “On the fully commutative elements of Coxeter groups,” J. Alg. Combin. 5 (1996), 353-385.
10. J.R. Stembridge, “Some combinatorial aspects of reduced words in finite Coxeter groups,” Trans. Amer. Math. Soc. 349 (1997), 1285-1332.