W.Y.C. Chen, A.Y.L. Dai, T. Dokos, T. Dwyer and B.E. Sagan,
On 021-avoiding ascent sequences,
Electron. J. Combin. 20(1) (2013) #P76.

Cited by

  1. A.M. Baxter and L.K. Pudwell, Ascent sequences avoiding pairs of patterns, Electron. J. Combin. 22 (2015) Paper 1.58, 23 pp.

  2. D. Callan, Another bijection for 021-avoiding ascent sequences, arXiv:1402.5898.

  3. D. Callan, On ascent, repetition and descent sequences, arXiv:1911.02209.

  4. D. Callan, T. Mansour and M. Shattuck, Restricted ascent sequences and Catalan numbers, Appl. Anal. Discrete Math. 8 (2014) 288-303.

  5. L.R. Campbell, S. Dahlberg, R. Dorward, J. Gerhard, T. Grubb, C. Purcell and B.E. Sagan, Restricted growth function patterns and statistics, Adv. in Appl. Math. 100 (2018) 1-42.

  6. S. Dahlberg, Patterns in set partitions and restricted growth functions, Ph.D. Thesis, Michigan State University, 2016.

  7. E.S. Egge, Pattern-avoiding fishburn permutations and ascent sequences, arXiv:2208.01484.

  8. Z. Lin, Patterns of relation triples in inversion and ascent sequences, Theoret. Comput. Sci. 804 (2020) 115–125.

  9. Z. Lin and S. Fu, On 120-avoiding inversion and ascent sequences, Discrete Math. 93 (2021) 103282.

  10. Z. Lin and S.H.F. Yan, Vincular patterns in inversion sequences, Appl. Math. Comput. 364 (2020) 124672.

  11. A. Sabri, Gray codes and efficient exhaustive generation for several classes of restricted words, Ph.D. Thesis, Université de Bourgogne, 2015.

  12. A. Sabri and V. Vajnovszki, Two reflected gray code-based orders on some restricted growth sequences, The Computer Journal, 58 (2015) 1099-1111.

  13. E. Steingrímsson, Some open problems on permutation patterns, In: Surveys in combinatorics 2013, 239-263, London Math. Soc. Lecture Note Ser. 409, Cambridge Univ. Press, Cambridge, 2013.

  14. S.H.F. Yan, Ascent sequences and 3-nonnesting set partitions, European J. Combin. 39 (2014) 80-94.

  15. S.H.F. Yan, Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions, Appl. Math. Comput. 325 (2018) 24-30.