From parking functions to Gelfand pairs
HTML articles powered by AMS MathViewer
- by Kürşat Aker and Mahi̇r Bi̇len Can PDF
- Proc. Amer. Math. Soc. 140 (2012), 1113-1124 Request permission
Abstract:
A pair $(G,K)$ of a group and its subgroup is called a Gelfand pair if the induced trivial representation of $K$ on $G$ is multiplicity free. Let $(a_j)$ be a sequence of positive integers of length $n$, and let $(b_i)$ be its non-decreasing rearrangement. The sequence $(a_i)$ is called a parking function of length $n$ if $b_i \leq i$ for all $i=1,\dots ,n$. In this paper we study certain Gelfand pairs in relation with parking functions. In particular, we find explicit descriptions of the decomposition of the associated induced trivial representations into irreducibles. We obtain and study a new $q$-analogue of the Catalan numbers $\frac {1}{n+1}{ 2n \choose n }$, $n\geq 1$.References
- Susumu Ariki, Tomohide Terasoma, and Hiro-Fumi Yamada, Higher Specht polynomials, Hiroshima Math. J. 27 (1997), no. 1, 177–188. MR 1437932
- Tullio Ceccherini-Silberstein, Fabio Scarabotti, and Filippo Tolli, Trees, wreath products and finite Gelfand pairs, Adv. Math. 206 (2006), no. 2, 503–537. MR 2263713, DOI 10.1016/j.aim.2005.10.002
- Mark D. Haiman, Conjectures on the quotient ring by diagonal invariants, J. Algebraic Combin. 3 (1994), no. 1, 17–76. MR 1256101, DOI 10.1023/A:1022450120589
- Alan G. Konheim and Benjamin Weiss. An occupancy discipline and applications. SIAM J. Applied Math., 14:1266–1274, 1966.
- I. G. Macdonald, Symmetric functions and Hall polynomials, Oxford Mathematical Monographs, The Clarendon Press, Oxford University Press, New York, 1979. MR 553598
- Hiroshi Mizukawa, Zonal spherical functions on the complex reflection groups and $(n+1,m+1)$-hypergeometric functions, Adv. Math. 184 (2004), no. 1, 1–17. MR 2047846, DOI 10.1016/S0001-8708(03)00092-6
- Ronald Pyke, The supremum and infimum of the Poisson process, Ann. Math. Statist. 30 (1959), 568–576. MR 107315, DOI 10.1214/aoms/1177706269
- Bruce E. Sagan, The symmetric group, 2nd ed., Graduate Texts in Mathematics, vol. 203, Springer-Verlag, New York, 2001. Representations, combinatorial algorithms, and symmetric functions. MR 1824028, DOI 10.1007/978-1-4757-6804-6
- Richard P. Stanley, Enumerative combinatorics. Vol. 2, Cambridge Studies in Advanced Mathematics, vol. 62, Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin. MR 1676282, DOI 10.1017/CBO9780511609589
- Richard P. Stanley. Catalan Addendum. http://www.math.mit.edu/~rstan/ec/catadd.pdf, 2010.
Additional Information
- Kürşat Aker
- Affiliation: Feza Gürsey Institute, Istanbul, Turkey
- Email: aker@gursey.gov.tr
- Mahi̇r Bi̇len Can
- Affiliation: Tulane University, New Orleans, Louisiana 70118
- Email: mcan@tulane.edu
- Received by editor(s): February 10, 2010
- Published electronically: November 16, 2011
- Communicated by: Jim Haglund
- © Copyright 2011
American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication. - Journal: Proc. Amer. Math. Soc. 140 (2012), 1113-1124
- MSC (2010): Primary 20C30, 05A19, 05E18
- DOI: https://doi.org/10.1090/S0002-9939-2011-11010-4
- MathSciNet review: 2869097