In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and explicit formulas are studied. Combinatorial explanations are given for some equidistributions.
References
M. H. Albert, R. E. L. Aldred, M. D. Atkinson, C. Handley and D. Holton, Permutations of a multiset avoiding permutations of length $3$, European J. Combin. 22 (2001), no. 8, 1021–1031. 10.1006/eujc.2001.0538 MR1861045 0988.05005 M. H. Albert, R. E. L. Aldred, M. D. Atkinson, C. Handley and D. Holton, Permutations of a multiset avoiding permutations of length $3$, European J. Combin. 22 (2001), no. 8, 1021–1031. 10.1006/eujc.2001.0538 MR1861045 0988.05005
C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy and D. Gouyou-Beauchamps, Generating functions for generating trees, Discrete Math. 246 (2002), no. 1-3, 29–55. 10.1016/S0012-365X(01)00250-3 MR1884885 0997.05007 C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy and D. Gouyou-Beauchamps, Generating functions for generating trees, Discrete Math. 246 (2002), no. 1-3, 29–55. 10.1016/S0012-365X(01)00250-3 MR1884885 0997.05007
M. Bóna, Real zeros and normal distribution for statistics on Stirling permutations defined by Gessel and Stanley, SIAM J. Discrete Math. 23 (2008/09), no. 1, 401–406. 10.1137/070702254 MR2476838 M. Bóna, Real zeros and normal distribution for statistics on Stirling permutations defined by Gessel and Stanley, SIAM J. Discrete Math. 23 (2008/09), no. 1, 401–406. 10.1137/070702254 MR2476838
A. Burstein and T. Mansour, Words restricted by patterns with at most $2$ distinct letters, Electron. J. Combin. 9 (2002), no. 2, Research paper # R3, 16 pp. MR2028273 1021.05002 A. Burstein and T. Mansour, Words restricted by patterns with at most $2$ distinct letters, Electron. J. Combin. 9 (2002), no. 2, Research paper # R3, 16 pp. MR2028273 1021.05002
A. Claesson and S. Kitaev, Classification of bijections between $321$- and $132$-avoiding permutations, Sém. Lothar. Combin. 60 (2008), Art. B60d, 30 pp. MR2465405 1179.05006 A. Claesson and S. Kitaev, Classification of bijections between $321$- and $132$-avoiding permutations, Sém. Lothar. Combin. 60 (2008), Art. B60d, 30 pp. MR2465405 1179.05006
I. Gessel and R. P. Stanley, Stirling polynomials, J. Combinatorial Theory Ser. A 24 (1978), no. 1, 24–33. 10.1016/0097-3165(78)90042-0 I. Gessel and R. P. Stanley, Stirling polynomials, J. Combinatorial Theory Ser. A 24 (1978), no. 1, 24–33. 10.1016/0097-3165(78)90042-0
S. Heubach and T. Mansour, Avoiding patterns of length three in compositions and multiset permutations, Adv. in Appl. Math. 36 (2006), no. 2, 156–174. MR2199986 1088.05010 10.1016/j.aam.2005.06.005 S. Heubach and T. Mansour, Avoiding patterns of length three in compositions and multiset permutations, Adv. in Appl. Math. 36 (2006), no. 2, 156–174. MR2199986 1088.05010 10.1016/j.aam.2005.06.005
––––, Combinatorics of Compositions and Words, Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca Raton, FL, 2010. 10.1201/9781420072686 ––––, Combinatorics of Compositions and Words, Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca Raton, FL, 2010. 10.1201/9781420072686
Q.-H. Hou and T. Mansour, Kernel method and linear recurrence system, J. Comput. Appl. Math. 261 (2008), no. 1, 227–242. 10.1016/j.cam.2007.05.001 1138.65108 Q.-H. Hou and T. Mansour, Kernel method and linear recurrence system, J. Comput. Appl. Math. 261 (2008), no. 1, 227–242. 10.1016/j.cam.2007.05.001 1138.65108
S. Janson, Plane recursive trees, Stirling permutations and an urn model, in Fifth Colloquium on Mathematics and Computer Science, 541–547, Discrete Math. Theor. Comput. Sci. Proc., AI, 2008. 1358.60015 S. Janson, Plane recursive trees, Stirling permutations and an urn model, in Fifth Colloquium on Mathematics and Computer Science, 541–547, Discrete Math. Theor. Comput. Sci. Proc., AI, 2008. 1358.60015
S. Janson, M. Kuba and A. Panholzer, Generalized Stirling permutations, families of increasing trees and urn models, J. Combin. Theory Ser. A 118 (2011), no. 1, 94–114. 10.1016/j.jcta.2009.11.006 1230.05100 S. Janson, M. Kuba and A. Panholzer, Generalized Stirling permutations, families of increasing trees and urn models, J. Combin. Theory Ser. A 118 (2011), no. 1, 94–114. 10.1016/j.jcta.2009.11.006 1230.05100
D. E. Knuth, The Art of Computer Programming, Second edition, Addison-Wesley, Reading, MA, 1973. 0302.68010 D. E. Knuth, The Art of Computer Programming, Second edition, Addison-Wesley, Reading, MA, 1973. 0302.68010
M. Kuba and A. Panholzer, Enumeration formulae for pattern restricted Stirling permutations, Discrete Math. 312 (2012), no. 21, 3179–3194. 10.1016/j.disc.2012.07.011 MR2957938 M. Kuba and A. Panholzer, Enumeration formulae for pattern restricted Stirling permutations, Discrete Math. 312 (2012), no. 21, 3179–3194. 10.1016/j.disc.2012.07.011 MR2957938
S.-M. Ma and T. Mansour, The $1/k$-Eulerian polynomials and $k$-Stirling permutations, Discrete Math. 338 (2015), no. 8, 1468–1472. 10.1016/j.disc.2015.03.015 MR3336116 1310.05009 S.-M. Ma and T. Mansour, The $1/k$-Eulerian polynomials and $k$-Stirling permutations, Discrete Math. 338 (2015), no. 8, 1468–1472. 10.1016/j.disc.2015.03.015 MR3336116 1310.05009
T. Mansour and M. Shattuck, Some results on the avoidance of vincular patterns by multisets, Discrete Appl. Math. 181 (2015), 201–208. 10.1016/j.dam.2014.10.011 MR3284526 1304.05003 T. Mansour and M. Shattuck, Some results on the avoidance of vincular patterns by multisets, Discrete Appl. Math. 181 (2015), 201–208. 10.1016/j.dam.2014.10.011 MR3284526 1304.05003
T. Mansour, M. Shattuck and S. Wagner, Counting subwords in flattened partitions of sets, Discrete Math. 338 (2015), no. 11, 1989–2005. 10.1016/j.disc.2015.04.023 MR3357785 1314.05022 T. Mansour, M. Shattuck and S. Wagner, Counting subwords in flattened partitions of sets, Discrete Math. 338 (2015), no. 11, 1989–2005. 10.1016/j.disc.2015.04.023 MR3357785 1314.05022
T. Mansour and A. Vainshtein, Restricted permutations, continued fractions, and Chebyshev polynomials, Electron. J. Combin. 7 (2000), Research Paper 17, 9 pp. MR1756286 0940.05001 T. Mansour and A. Vainshtein, Restricted permutations, continued fractions, and Chebyshev polynomials, Electron. J. Combin. 7 (2000), Research Paper 17, 9 pp. MR1756286 0940.05001
––––, Restricted $132$-avoiding permutations, Adv. in Appl. Math. 26 (2001), no. 3, 258–269. 10.1006/aama.2000.0719 ––––, Restricted $132$-avoiding permutations, Adv. in Appl. Math. 26 (2001), no. 3, 258–269. 10.1006/aama.2000.0719
A. Robertson, H. Wilf and D. Zeilberger, Permutation patterns and continuous fractions, Electron. J. Combin. 6 (1999), Research Paper 38. MR1725702 0937.05004 A. Robertson, H. Wilf and D. Zeilberger, Permutation patterns and continuous fractions, Electron. J. Combin. 6 (1999), Research Paper 38. MR1725702 0937.05004
C. D. Savage and H. S. Wilf, Pattern avoidance in compositions and multiset permutations, Adv. in Appl. Math. 36 (2006), no. 2, 194–201. 10.1016/j.aam.2005.06.003 MR2199988 1087.05002 C. D. Savage and H. S. Wilf, Pattern avoidance in compositions and multiset permutations, Adv. in Appl. Math. 36 (2006), no. 2, 194–201. 10.1016/j.aam.2005.06.003 MR2199988 1087.05002
R. Simion and F. W. Schmidt, Restricted permutations, European J. Combin. 6 (1985), no. 4, 383–406. 10.1016/s0195-6698(85)80052-4 0615.05002 R. Simion and F. W. Schmidt, Restricted permutations, European J. Combin. 6 (1985), no. 4, 383–406. 10.1016/s0195-6698(85)80052-4 0615.05002
N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences. http://oeis.org http://oeis.org 1274.11001 N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences. http://oeis.org http://oeis.org 1274.11001
