Abstract
It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group Sn generated by the n-cycle (1,2,...,n) on the set of permutations of fixed cycle type and fixed number of excedances provides an instance of the cyclic sieving phenomenon of Reiner, Stanton and White. The main tool is a class of symmetric functions recently introduced in work of two of the authors.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 536-562 |
| Number of pages | 27 |
| Journal | Advances in Applied Mathematics |
| Volume | 46 |
| Issue number | 1-4 |
| DOIs | |
| State | Published - Jan 1 2011 |
Keywords
- Cyclic sieving
- Excedance
- Major index
- Quasisymmetric functions
ASJC Scopus subject areas
- Applied Mathematics
Fingerprint Dive into the research topics of 'Eulerian quasisymmetric functions and cyclic sieving'. Together they form a unique fingerprint.
Cite this
Sagan, B., Shareshian, J., & Wachs, M. L. (2011). Eulerian quasisymmetric functions and cyclic sieving. Advances in Applied Mathematics, 46(1-4), 536-562. https://doi.org/10.1016/j.aam.2010.01.013