Abstract
In this paper, we find an explicit formula for the number of inversion sequences of length n that avoid each of the pattern sets {021, 010}, {021, 011}, {021, 100, 101}, {021, 000, 101}, and {101, 102, 201}. This is done using either generating trees and generating functions, or combinatorial bijections to restricted Schröder paths.
| Original language | English |
|---|---|
| Pages (from-to) | 2327-2338 |
| Number of pages | 12 |
| Journal | Quaestiones Mathematicae |
| Volume | 46 |
| Issue number | 11 |
| DOIs | |
| State | Published - 2023 |
Bibliographical note
Publisher Copyright:© 2022 NISC (Pty) Ltd.
Keywords
- Catalan numbers
- Inversion sequences
- Schröder paths
- generating trees
- pattern-avoiding
ASJC Scopus subject areas
- Mathematics (miscellaneous)