Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-20T03:30:32.959Z Has data issue: false hasContentIssue false
  • English
  • Français

COUNTING PERMUTATIONS BY NUMBERS OF EXCEDANCES, FIXED POINTS AND CYCLES

Part of: Combinatorics

Published online by Cambridge University Press:  04 October 2011

SHI-MEI MA
SHI-MEI MA*
Affiliation:
Department of Information and Computing Science, Northeastern University at Qinhuangdao, Qinhuangdao, Hebei 066004, PR China (email: shimeima@yahoo.com.cn)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we present a combinatorial proof of an identity involving the two kinds of Stirling numbers and the numbers of permutations with prescribed numbers of excedances and cycles. Several recurrence relations related to the numbers of excedances, fixed points and cycles are also obtained.

Keywords

excedancesfixed pointscyclespermutations

MSC classification

Secondary: 05A15: Exact enumeration problems, generating functions
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 85 , Issue 3 , June 2012 , pp. 415 - 421
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2011

References

[1]Bóna, M., Combinatorics of Permutations (Chapman & Hall/CRC, Boca Raton, FL, 2004).CrossRefGoogle Scholar
[2]Brändén, P., ‘On linear transformations preserving the Pólya frequency property’, Trans. Amer. Math. Soc. 358 (2006), 3697–3716.CrossRefGoogle Scholar
[3]Brenti, F., ‘A class of q-symmetric functions arising from plethysm’, J. Combin. Theory Ser. A 91 (2000), 137–170.CrossRefGoogle Scholar
[4]Comtet, L., Advanced Combinatorics (Reidel, Dordrecht, 1974).CrossRefGoogle Scholar
[5]Foata, D. and Schützenberger, M. P., Théorie géométrique des polynômes eulériens, Lecture Notes in Mathematics, 138 (Springer, New York, 1970).CrossRefGoogle Scholar
[6]Kasraoui, A. and Zeng, J., ‘Euler–Mahonian statistics on ordered set partitions (II)’, J. Combin. Theory Ser. A 116 (2009), 539–563.CrossRefGoogle Scholar
[7]Ksavrelof, G. and Zeng, J., ‘Two involutions for signed excedance numbers’, Sém. Lothar. Combin. 49 (2003), 8, Art. B49e.Google Scholar
[8]Liu, L. L. and Wang, Y., ‘A unified approach to polynomial sequences with only real zeros’, Adv. in Appl. Math. 38 (2007), 542–560.CrossRefGoogle Scholar
[9]Ma, S. M., ‘A summation formula related to the q-Eulerian polynomials’, Ars Combin. 94 (2010), 299–301.Google Scholar
[10]Mantaci, R. and Rakotondrajao, F., ‘A permutation representation that knows what “Eulerian” means’, Discrete Math. Theor. Comput. Sci. 4 (2001), 101–108.Google Scholar
[11]Mantaci, R. and Rakotondrajao, F., ‘Exceedingly deranging!’, Adv. in Appl. Math. 30 (2003), 177–188.CrossRefGoogle Scholar
[12]Rakotondrajao, F., ‘Permutations by number of fixed points and anti-excedances’, Afr. Mat., doi:10.1007/s13370-011-0025-y.CrossRefGoogle Scholar
[13]Stanley, R. P., Enumerative Combinatorics, Vol. 1 (Cambridge University Press, Cambridge, 1997).CrossRefGoogle Scholar
[14]Stanley, R. P., Enumerative Combinatorics, Vol. 2 (Cambridge University Press, Cambridge, 1999).CrossRefGoogle Scholar