Abstract
Let P(n, k) denote the set of partitions of {1, 2, ..., n} having exactly k blocks. In this paper, we find the generating function which counts the members of P(n, k) according to the number of descents of size d or more, where d ≥ 1 is fixed. An explicit expression in terms of Stirling numbers of the second kind may be given for the total number of such descents in all the members of P(n, k). We also compute the generating function for the statistics recording the number of ascents of size d or more and show that it has the same distribution on P(n, k) as the prior statistics for descents when d ≥ 2, by both algebraic and combinatorial arguments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burstein Alex and Mansour Toufik, Counting occurrences of some subword patterns, Discrete Math. Theor. Comp. Sci. 6 (2003) 1–12
Chen William Y C, Gessel Ira M, Yan Catherine H and Yang Arthur L B, A major index for matchings and set partitions, J. Combin. Theory Ser. A 115(6) (2008) 1069–1076
Deodhar Rajendra S and Srinivasan Murali K, An inversion number statistic on set partitions, in: Electronic Notes in Discrete Mathematics, volume 15, pages 84–86 (2003) (Amsterdam: Elsevier)
Graham Ronald L, Knuth Donald E and Patashnik Oren, Concrete Mathematics: A Foundation for Computer Science, second edition (1994) (Boston: Addison-Wesley Publishing Company, Inc.)
Klazar Martin, On abab-free and abba-free set partitions, European J. Combin. 17(1) (1996) 53–68
Mansour Toufik and Munagi Augustine O, Enumeration of partitions by long rises, levels and descents, J. Integer Seq. 12:Article 09.1.8 (2009) 17 pp.
Mansour Toufik and Munagi Augustine O, Enumeration of partitions by rises, levels and descents, in: Permutation Patterns, Volume 376 of London Mathematical Society Lecture Note Series (2010) (Cambridge: Cambridge University Press) pages 221–232
Mansour Toufik, Shattuck Mark and Yan Sherry H F, Counting subwords in a partition of a set, Electron. J. Combin. 17(1):R19 (2010) 21 pp.
Milne Stephen, A q-analog of restricted growth functions, Dobinski’s equality and Charlier polynomials, Trans. Am. Math. Soc. 245 (1978) 89–118
Stanley Richard P, Enumerative Combinatorics, Volume 1 (1997) (Cambridge: Cambridge University Press). With a foreword by Gian-Carlo Rota, corrected reprint of the 1986 original
Wagner Carl, Partition statistics and q-Bell numbers (q = − 1), J. Integer Seq. 7:Article 04.1.1 (2004) 12 pp.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
MANSOUR, T., SHATTUCK, M. & SONG, C. Enumerating set partitions according to the number of descents of size d or more. Proc Math Sci 122, 507–517 (2012). https://doi.org/10.1007/s12044-012-0098-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12044-012-0098-z