EUVIMEDEUVIMED entdecken
Crossref

Prime Factorization of Meanders

Yury Belousov

The Electronic Journal of Combinatorics · 08.05.2026 · 33 (2)

DOI: 10.37236/13636 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 08.05.2026. Verfasst von Yury Belousov.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper introduces a prime factorization of open meanders, articulated through the framework of 2-colored operads. We demonstrate that each open meander can be canonically constructed from building blocks of two types: iterated snakes and irreducible meanders. We find out that iterated snakes allow efficient enumeration, and thus the problem of enumerating meanders reduces to the problem of enumerating irreducible meanders. Additionally, we present some results concerning the asymptotics of meanders of both classes.

Zitieren

APA

Belousov, Y. (2026). Prime Factorization of Meanders. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/13636

Vancouver

Belousov Y. Prime Factorization of Meanders. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/13636

BibTeX
@article{Belousov2026,
  author = {Belousov, Yury},
  title = {Prime Factorization of Meanders},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  volume = {33},
  number = {2},
  doi = {10.37236/13636}
}
Kostenlos starten →