Wilf Classes for Level Sequences Avoiding Patterns of Length Three
Mathematics · 04.06.2026 · 14 (11) · 1983
DOI: 10.3390/math14111983 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 04.06.2026. Verfasst von Toufik Mansour. Die Arbeit nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
A level sequence is a word π=π1π2…πn over the set of nonnegative integers such that π1=0 and πi≤1+lev(π1π2…πi−1) for i=2,3,…,n, where lev(π1π2…πm) is the number of levels in the word π1π2…πm, that is, the number of two entry factors πjπj+1 such that πj=πj+1. 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 3≤k≤13.
Zitieren
APA
Mansour, T. (2026). Wilf Classes for Level Sequences Avoiding Patterns of Length Three. Mathematics, 14(11), 1983. https://doi.org/10.3390/math14111983
Vancouver
Mansour T. Wilf Classes for Level Sequences Avoiding Patterns of Length Three. Mathematics. 2026;14(11):1983. doi:10.3390/math14111983
BibTeX
@article{Mansour2026,
author = {Mansour, Toufik},
title = {Wilf Classes for Level Sequences Avoiding Patterns of Length Three},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {11},
pages = {1983},
doi = {10.3390/math14111983}
}
EUVIMED