A. Asinowski and M. A. Polley. Patterns in rectangulations. Part I: ⊤-like patterns, inversion se- quence classes i(010, 101, 120, 201) and i(011, 201), and rushed dyck paths. Discrete Mathematics & Theoretical Computer Science, 27(1):15118, 2025. doi:10.46298/dmtcs.15118. Permutation Pat- terns 2024.
DOI : 10.46298/dmtcs.15118N. R. Beaton, M. Bouvel, V. Guerrini, and S. Rinaldi. Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. Theoretical Computer Science, 777:69-92, 2019. doi:10.1016/j.tcs.2019.02.003.
DOI : 10.1016/j.tcs.2019.02.003C. M. Bender and S. A. Orszag. Advanced Mathematical Methods for Scientists and Engineers I. Springer New York, 1999.
DOI : 10.1007/978-1-4757-3069-2D. Bevan, R. Brignall, A. Elvey Price, and J. Pantone. A structural characterisation of Av(1324) and new bounds on its growth rate. European Journal of Combinatorics, 88:103115, 2020. doi:10.1016/j.ejc.2020.103115.
DOI : 10.1016/j.ejc.2020.103115M. Bouvel, V. Guerrini, A. Rechnitzer, and S. Rinaldi. Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence. SIAM Journal on Discrete Mathematics, 32(4):2795-2819, 2018.
DOI : 10.1137/17m1126734D. Callan and T. Mansour. Inversion sequences avoiding quadruple length-3 patterns. Integers, 23: Article A78, 2023. doi:10.5281/ZENODO.8399694.
DOI : 10.5281/ZENODO.8399694D. Callan, V. Jelínek, and T. Mansour. Inversion sequences avoiding a triple of patterns of 3 letters. The Electronic Journal of Combinatorics, pages P3.19-P3.19, 2023. doi:10.37236/11603.
DOI : 10.37236/11603W. Cao, E. Y. Jin, and Z. Lin. Enumeration of inversion sequences avoiding triples of relations. Discrete Applied Mathematics, 260:86-97, 2019. doi:10.1016/j.dam.2019.01.035.
DOI : 10.1016/j.dam.2019.01.035J. N. Chen and Z. Lin. A bijection for length-5 patterns in permutations. Journal of Combinatorial Theory, Series A, 202:105815, 2024. doi:10.1016/j.jcta.2023.105815.
DOI : 10.1016/j.jcta.2023.105815A. R. Conway, A. J. Guttmann, and P. Zinn-Justin. 1324-avoiding permutations revisited. Advances in Applied Mathematics, 96:312-333, 2018. doi:10.1016/j.aam.2018.01.002.
DOI : 10.1016/j.aam.2018.01.002S. Corteel, M. A. Martinez, C. D. Savage, and M. Weselcouch. Patterns in Inversion Sequences I. Discrete Mathematics & Theoretical Computer Science, 18(2):1323, 2016. doi:10.46298/dmtcs.1323. Proceedings of Permutation Patterns 2015.
DOI : 10.46298/dmtcs.1323P. Flajolet and R. Sedgewick. Analytic Combinatorics. Cambridge University Press, 2009.
DOI : 10.1017/cbo9780511801655A. J. Guttmann. Analysis of series expansions for non-algebraic singularities. Journal of Physics A: Mathematical and Theoretical, 48(4):045209, 2015. doi:10.1088/1751-8113/48/4/045209.
DOI : 10.1088/1751-8113/48/4/045209S. Kitaev. Patterns in Permutations and Words. Monographs in Theoretical Computer Science. An EATCS Series. Springer-Verlag, 2011.
DOI : 10.1007/978-3-642-17333-2D. E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison- Wesley, Reading, Massachusetts, 3 edition, 1997.
I. Kotsireas, T. Mansour, and G. Yıldırım. An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences. Journal of Symbolic Computation, 120:102231, 2024. doi:10.1016/j.jsc.2023.102231.
DOI : 10.1016/j.jsc.2023.102231Z. Lin. Patterns of relation triples in inversion and ascent sequences. Theoretical Computer Science, 804:115-125, 2020. doi:10.1016/j.tcs.2019.11.007.
DOI : 10.1016/j.tcs.2019.11.007T. Mansour and M. Shattuck. Pattern avoidance in inversion sequences. Pure Mathematics and Applications, 25(2):157-176, 2015. doi:10.1515/puma-2015-0016.
DOI : 10.1515/puma-2015-0016T. Mansour, H. Skogman, and R. Smith. Sorting inversion sequences. Discrete Mathematics & Theoretical Computer Science, 27(1), 2025. doi:10.46298/dmtcs.14010. Permutation Patterns 2024.
DOI : 10.46298/dmtcs.14010M. A. Martinez and C. D. Savage. Patterns in inversion sequences II: Inversion sequences avoiding triples of relations. Journal of Integer Sequences, 21:Article 18.2.2, 2018.
OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences, 2025.
J. Pantone. The enumeration of inversion sequences avoiding the patterns 201 and 210. Enumerative Combinatorics and Applications, 4(4):12, 2024. doi:10.54550/ECA2024V4S4R25.
DOI : 10.54550/eca2024v4s4r25H. Prodinger. The kernel method: A collection of examples. Séminaire Lotharingien de Com- binatoire, 50:Article B50f, 19 pp., 2004.
R. Simion and F. W. Schmidt. Restricted permutations. European Journal of Combinatorics, 6(4): 383-406, 1985. doi:10.1016/S0195-6698(85)80052-4.
DOI : 10.1016/s0195-6698(85)80052-4B. Testart. Completing the enumeration of inversion sequences avoiding one or two patterns of length 3, 2025. Preprint.
B. Testart. Generating trees growing on the left for pattern-avoiding inversion sequences. Discrete Mathematics & Theoretical Computer Science, 27(1):14716, 2025. doi:10.46298/dmtcs.14716. Per- mutation Patterns 2024.
DOI : 10.46298/dmtcs.14716C. Yan and Z. Lin. Inversion sequences avoiding pairs of patterns. Discrete Mathematics & Theo- retical Computer Science, 22(1), 2020. doi:10.23638/DMTCS-22-1-23.
DOI : 10.23638/dmtcs-22-1-23