W.Y.C. Chen, A.Y.L. Dai and R.D.P. Zhou,
Ordered partitions avoiding a permutation pattern of length 3,
European J. Combin. 36 (2014) 416-424.

Cited by

  1. D. Birmajer, J.B. Gil, D.S. Kenepp and M.D. Weiner, Restricted generating trees for weak orderings, arXiv:2108.04302.

  2. A. Godbole, A. Goyt, J. Herdan and L. Pudwell, Pattern avoidance in ordered set partitions, Ann. Comb. 18 (2014) 429-445.

  3. A. Kasraoui, Pattern avoidance in ordered set partitions and words, Adv. in Appl. Math. 61 (2014) 85-101.

  4. R.A. Proctor and M.J. Willis, Parabolic Catalan numbers count flagged Schur functions; Convexity of tableau sets for Demazure characters, arXiv:1612.06323.

  5. R.A. Proctor and M.J. Willis, Parabolic Catalan numbers count flagged Schur functions and their appearances as type A Demazure characters (key polynomials), Discrete Math. Theor. Comput. Sci. 19(3) (2017) Paper No. 15, 27 pp.

  6. R.A. Proctor and M.J. Willis, Convexity of tableau sets for type A Demazure characters (key polynomials), parabolic Catalan numbers, Discrete Math. Theor. Comput. Sci. 20(2) (2018) Paper No. 3, 20 pp.

  7. D. Qiu and J. Remmel, Patterns in words of ordered set partitions, arXiv:1804.07087.

  8. N. Shar, Experimental methods in permutation patterns and bijective proof, Rutgers, The State University of New Jersey, 2016.

  9. N. Shar and D. Zeilberger, The (ordinary) generating functions enumerating 123-avoiding words with r occurrences of each of 1, 2,..., n are always algebraic, Ann. Comb. 20 (2016) 387-396.