Bijections on pattern avoiding inversion sequences and related objects
Abstract: The number of inversion sequences avoiding two patterns $101$ and $102$ is known to be the same as the number of permutations avoiding three patterns $2341$, $2431$, and $3241$. This sequence also counts the number of Schr\"{o}der paths without triple descents, restricted bicolored Dyck paths, $(101,021)$-avoiding inversion sequences, and weighted ordered trees. We provide bijections to integrate them together by introducing $F$-paths. Moreover, we define three kinds of statistics for each of the objects and count the number of each object with respect to these statistics. We also discuss direct sums of each object.
- Generating permutations with restricted containers. J. Combin. Theory Ser. A, 157:205–232, 2018.
- Enumeration of inversion sequences avoiding triples of relations. Discrete Appl. Math., 260:86–97, 2019.
- Patterns in inversion sequences i. Discrete Mathematics & Theoretical Computer Science, 18(Permutation Patterns), 2016.
- Ira M. Gessel. Lagrange inversion. J. Combin. Theory Ser. A, 144:212–249, 2016.
- Length-four pattern avoidance in inversion sequences. Electron. J. Combin., 29(4):Paper No. 4.37, 15, 2022.
- Jang Soo Kim. Bijections on two variations of noncrossing partitions. Discrete Math., 311(12):1057–1063, 2011.
- Sergey Kitaev. Patterns in permutations and words. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg, 2011. With a foreword by Jeffrey B. Remmel.
- Donald E. Knuth. The art of computer programming. Vol. 1. Addison-Wesley, Reading, MA, 1997. Fundamental algorithms, Third edition [of MR0286317].
- Donald E. Knuth. The art of computer programming. Vol. 3. Addison-Wesley, Reading, MA, 1998. Sorting and searching, Second edition [of MR0445948].
- Darla Kremer. Permutations with forbidden subsequences and a generalized Schröder number. Discrete Math., 218(1-3):121–130, 2000.
- D. H. Lehmer. Teaching combinatorial tricks to a computer. In Proc. Sympos. Appl. Math., Vol. 10, pages 179–193. Amer. Math. Soc., Providence, RI, 1960.
- Percy A. MacMahon. Combinatory analysis. Chelsea Publishing Co., New York, 1960. Two volumes (bound as one).
- Pattern avoidance in inversion sequences. Pure Math. Appl. (PU.M.A.), 25(2):157–176, 2015.
- Patterns in inversion sequences II: inversion sequences avoiding triples of relations. J. Integer Seq., 21(2):Art. 18.2.2, 44, 2018.
- OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences, 2024. Published electronically at http://oeis.org.
- On Delannoy paths without peaks and valleys. Discrete Math., 346(7):Paper No. 113399, 12, 2023.
- Restricted permutations. European J. Combin., 6(4):383–406, 1985.
- Inversion sequences avoiding pairs of patterns. Discrete Mathematics & Theoretical Computer Science, 22(Combinatorics), 2020.
- Sherry H. F. Yan. Schröder paths and pattern avoiding partitions. Int. J. Contemp. Math. Sci., 4(17-20):979–986, 2009.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.