Emerging consecutive pattern avoidance
Discrete Mathematics & Theoretical Computer Science · 10.11.2026 · vol. 28:1, Permutation... (Special issues)
DOI: 10.46298/dmtcs.16861 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 10.11.2026. Verfasst von Nathanaël Hassler und 1 weiteren Autor:innen.
Abstract (Originalsprache)
In this note we study the asymptotic popularity, that is, the limit probability to find a given consecutive pattern at a random position in a random permutation in the eighteen classes of permutations avoiding at least two length 3 consecutive patterns. We show that for ten classes, this popularity can be readily deduced from the structure of the permutations. By combining analytical and bijective approaches, we study in detail two more involved cases. The problem remains open for five classes.
Zitieren
APA
Hassler, N., & Kirgizov, S. (2026). Emerging consecutive pattern avoidance. Discrete Mathematics & Theoretical Computer Science, vol. 28:1, Permutation...(Special issues). https://doi.org/10.46298/dmtcs.16861
Vancouver
Hassler N, Kirgizov S. Emerging consecutive pattern avoidance. Discrete Mathematics & Theoretical Computer Science. 2026;vol. 28:1, Permutation...(Special issues). doi:10.46298/dmtcs.16861
BibTeX
@article{Hassler2026,
author = {Hassler, Nathanaël and Kirgizov, Sergey},
title = {Emerging consecutive pattern avoidance},
journal = {Discrete Mathematics & Theoretical Computer Science},
year = {2026},
volume = {vol. 28:1, Permutation...},
number = {Special issues},
doi = {10.46298/dmtcs.16861}
}
EUVIMED