Abstract
A level sequence is a word (Formula presented.) over the set of nonnegative integers such that (Formula presented.) and (Formula presented.) for (Formula presented.), where (Formula presented.) is the number of levels in the word (Formula presented.), that is, the number of two entry factors (Formula presented.) such that (Formula presented.). In this paper, we obtain some enumerative results for level sequences avoiding patterns of length 3. In particular, we determine the number of Wilf equivalence classes among single patterns of length 3 and among pairs of patterns of length 3, and state the corresponding result for a set of k patterns of length 3 when (Formula presented.).
| Original language | English |
|---|---|
| Article number | 1983 |
| Journal | Mathematics |
| Volume | 14 |
| Issue number | 11 |
| DOIs | |
| State | Published - Jun 2026 |
Keywords
- generating tree
- level sequence
- pattern avoidance
- wilf equivalence class
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- General Mathematics
- Engineering (miscellaneous)
Fingerprint
Dive into the research topics of 'Wilf Classes for Level Sequences Avoiding Patterns of Length Three'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver