Prime Factorization of Meanders
Yury Belousov · The Electronic Journal of Combinatorics · 2026
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2026
Abstract
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.
Open the resolved locator · 10.37236/13636
Metadata licence: OpenAlex metadata (CC0)