Click here to flash read.
arXiv:2112.10289v4 Announce Type: replace
Abstract: In this paper, we introduce 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 asymptotic of meanders of both classes.
Click here to read this post out
ID: 820910; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: April 24, 2024, 7:32 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 14
CC:
No creative common's license
No creative common's license
Comments: