Cyclic Sieving for Generalised Non-crossing Partitions Associated with Complex Reflection Groups of Exceptional Type
We prove that the generalised non-crossing partitions associated with well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as conjectured by Armstrong, and by Bessis and Reiner. The computational details are provided in the manuscript “Cyclic sieving for generalised non-crossing partitions associated with complex reflection groups of exceptional type—the details” [arχiv:1001.0030].
KeywordsParabolic Subgroup Coxeter Group Exceptional Group Coxeter Element Coxeter Number
Unable to display preview. Download preview PDF.
The authors thank an anonymous referee for a very careful reading of the original manuscript, and for numerous pertinent suggestions which have helped to considerably improve the original manuscript.
- 1.G. E. Andrews, The Theory of Partitions, Encyclopedia of Math. and its Applications, vol. 2, Addison–Wesley, Reading, 1976.Google Scholar
- 2.G. E. Andrews, The Friedman–Joichi–Stanton monotonicity conjecture at primes, in: Unusual Applications of Number Theory (M. Nathanson, ed.), DIMACS Ser. Discrete Math. Theor. Comp. Sci., vol. 64, Amer. Math. Soc., Providence, R.I., 2004, pp. 9–15.Google Scholar
- 3.D. Armstrong, Generalized noncrossing partitions and combinatorics of Coxeter groups, Mem. Amer. Math. Soc., vol. 202, no. 949, Amer. Math. Soc., Providence, R.I., 2009.Google Scholar
- 4.D. Armstrong, C. Stump and H. Thomas, A uniform bijection between nonnesting and noncrossing partitions, Trans. Amer. Math. Soc. (to appear).Google Scholar
- 7.D. Bessis, The dual braid monoid, Ann. Sci. École Norm. Sup. (4) 36 (2003), 647–683.Google Scholar
- 8.D. Bessis, Finite complex reflection groups are \(K(\pi,1)\), preprint, ar χ iv:math/0610777.Google Scholar
- 11.T. Brady and C. Watt, \(K(\pi,1)\)’s for Artin groups of finite type, Geom. Dedicata 94 (2002), 225–250.Google Scholar
- 14.M. Geck, G. Hiss, F. Lübeck, G. Malle and G. Pfeiffer, CHEVIE—a system for computing and processing generic character tables for finite groups of Lie type, Appl. Algebra Engrg. Comm. Comput. 7 (1996), 175–210.Google Scholar
- 15.I. Gordon and S. Griffeth, Catalan numbers for complex reflection groups, Amer. J. Math. (to appear).Google Scholar
- 17.C. Krattenthaler, The F-triangle of the generalised cluster complex, in: Topics in Discrete Mathematics, dedicated to Jarik Nešetřil on the occasion of his 60th birthday (M. Klazar, J. Kratochvil, M. Loebl, J. Matoušek, R. Thomas and P. Valtr, eds.), Springer–Verlag, Berlin, New York, 2006, pp. 93–126.Google Scholar
- 18.C. Krattenthaler, The M-triangle of generalised non-crossing partitions for the types E 7 and E 8, Séminaire Lotharingien Combin. 54 (2006), Article B54l, 34 pages.Google Scholar
- 19.C. Krattenthaler, Non-crossing partitions on an annulus, in preparation.Google Scholar
- 21.C. Krattenthaler and T. W. Müller, Cyclic sieving for generalised non-crossing partitions associated with complex reflection groups of exceptional type—the details, manuscript; ar χ iv:1001.0030.Google Scholar
- 27.J. Michel, The GAP-part of the CHEVIE system, GAP 3-package available for download from http://people.math.jussieu.fr/jmichel/chevie/chevie.html.
- 30.B. Rhoades, Parking structures: Fuss analogs, preprint, ar χ iv:1205.4293.Google Scholar
- 32.B. E. Sagan, The cyclic sieving phenomenon: a survey, Surveys in combinatorics 2011, London Math. Soc. Lecture Note Ser., vol. 392, Cambridge Univ. Press, Cambridge, 2011, pp. 183–233.Google Scholar
- 37.J. R. Stembridge, scoxeter, Maple package for working with root systems and finite Coxeter groups; available at http://www.math.lsa.umich.edu/\~jrs.