The Enumeration of Coxeter Elements
Jian-Yi Shi
East China Normal University Department of Mathematics Shanghai 200062 P.R.C
DOI: 10.1023/A:1008695121783
Abstract
Let (W,S, Ĩ \in S in any fixed order. We use the notation C(W) to denote the set of all the Coxeter elements in W. These elements play an important role in the theory of Coxeter groups, e.g., the determination of polynomial invariants, the Poincaré polynomial, the Coxeter number and the group order of W (see [1-5] for example). They are also important in representation theory (see [6]). In the present paper, we show that the set C(W) is in one-to-one correspondence with the set C( 
) of all acyclic orientations of . Then we use some graph-theoretic tricks to compute the cardinality c(W) of the set C(W) for any Coxeter group W. We deduce a recurrence formula for this number. Furthermore, we obtain some direct formulae of c(W) for a large family of Coxeter groups, which include all the finite, affine and hyperbolic Coxeter groups.
) of all acyclic orientations of . Then we use some graph-theoretic tricks to compute the cardinality c(W) of the set C(W) for any Coxeter group W. We deduce a recurrence formula for this number. Furthermore, we obtain some direct formulae of c(W) for a large family of Coxeter groups, which include all the finite, affine and hyperbolic Coxeter groups. The content of the paper is organized as below. In Section 1, we discuss some properties of Coxeter elements for simplifying the computation of the value c(W). In particular, we establish a bijection between the sets C(W) and C( ) . Then among the other results, we give a recurrence formula of c(W) in Section 2. Subsequently we deduce some closed formulae of c(W) for certain families of Coxeter groups in Section 3.
) . Then among the other results, we give a recurrence formula of c(W) in Section 2. Subsequently we deduce some closed formulae of c(W) for certain families of Coxeter groups in Section 3.Pages: 161–171
Keywords: a Coxeter system; Coxeter element; acyclic orientation of a graph
Full Text: PDF
References
1. S. Berman, Y.S. Lee, and R.V. Moody, “The spectrum of a Coxeter transformation, affine Coxeter transformations, and the defect map,” J. Algebra 121 (1989), 339-357.
2. N. Bourbaki, Groupes et alg`ebres de Lie, Hermann, Paris, 1968, Ch. 4-6; Masson, Paris, 1981.
3. A.J. Coleman, “Killing and the Coxeter transformation of Kac-Moody algebras,” Invent. Math. 95 (1989), 447-477.
4. R.B. Howlett, “Coxeter groups and M-matrices,” Bull. London Math. Soc. 14 (1982), 137-141.
5. J. Humphreys, Reflection Groups and Coxeter Groups, Cambridge University Press, 1992.
6. G\ddot otz Pfeiffer, “Young characters on Coxeter basis elements of Iwahori-Hecke algebras and a Murnaghan- Nakayama formula,” to appear in J. Algebra.
7. R. Steinberg, “Finite subgroups of SU2, Dynkin diagrams and affine Coxeter elements,” Pacific J. Math. 118(2) (1985), 587-597.
8. K. Thulasiraman and M.N.S. Swamy, Graphs: Theory and Algorithms, John Wiley & Sons, Inc., 1992.
2. N. Bourbaki, Groupes et alg`ebres de Lie, Hermann, Paris, 1968, Ch. 4-6; Masson, Paris, 1981.
3. A.J. Coleman, “Killing and the Coxeter transformation of Kac-Moody algebras,” Invent. Math. 95 (1989), 447-477.
4. R.B. Howlett, “Coxeter groups and M-matrices,” Bull. London Math. Soc. 14 (1982), 137-141.
5. J. Humphreys, Reflection Groups and Coxeter Groups, Cambridge University Press, 1992.
6. G\ddot otz Pfeiffer, “Young characters on Coxeter basis elements of Iwahori-Hecke algebras and a Murnaghan- Nakayama formula,” to appear in J. Algebra.
7. R. Steinberg, “Finite subgroups of SU2, Dynkin diagrams and affine Coxeter elements,” Pacific J. Math. 118(2) (1985), 587-597.
8. K. Thulasiraman and M.N.S. Swamy, Graphs: Theory and Algorithms, John Wiley & Sons, Inc., 1992.
© 1992–2009 Journal of Algebraic Combinatorics
©
2012 FIZ Karlsruhe /
Zentralblatt MATH for the EMIS Electronic Edition