Abstract
We consider triples τ of 3-letter patterns for which ascent sequences that avoid τ are counted by Fibonacci-related numbers. Several cases are equivalent to avoiding a pair of 3-letter patterns and have already been treated using generating functions. Here we give direct proofs of all our results. We also consider avoiders for some quadruples of 3-letter patterns.
| Original language | English |
|---|---|
| Journal | Art of Discrete and Applied Mathematics |
| Volume | 7 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2024 |
Bibliographical note
Publisher Copyright:© 2024 University of Primorska. All rights reserved.
Keywords
- Ascent sequences, Fibonacci numbers
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver