Prime Factorization of Meanders
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.
Fields of Study & Subjects
Mathematics and Applications
graph theory and CDMA systems
Graph Labeling and Dimension Problems
Publication details
- Journal / source
- The Electronic Journal of Combinatorics
- Volume
- 33
- Issue
- 2
- Publication date
- 8 May 2026
- Language
- EN