Abstract
In this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingrímsson (2011) for ascent sequences. More precisely, we provide systematically the generating functions for the number of weak ascent sequences avoiding the patterns 001, 011, 012, 021, and 102. Additionally, we establish bijective connections between pattern-avoiding weak ascent sequences and other combinatorial objects, such as compositions, upper triangular 01-matrices, and plane trees.
| Original language | English |
|---|---|
| Article number | 2 |
| Journal | Discrete Mathematics and Theoretical Computer Science |
| Volume | 26 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2024 |
Bibliographical note
Publisher Copyright:© 2024 by the author(s)
Keywords
- generating function
- pattern avoidance
- weak ascent sequence
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science
- Discrete Mathematics and Combinatorics