Enumerating meandric systems with large number of loops

DOI10.4171/AIHPD/80zbMath1431.05006arXiv1609.02756MaRDI QIDQ2286576

Motohisa Fukuda, Ion Nechita

Publication date: 22 January 2020

Published in: Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.02756

zbMATH Keywords

free probabilityfree cumulantmeandermeandric system

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Free probability and free operator algebras (46L54) Asymptotic enumeration (05A16)

Related Items (2)

Cycles in random meander systems ⋮ On the geometry of uniform meandric systems

Cites Work

• The enumeration of irreducible combinatorial objects
• Meanders and the Temperley-Lieb algebra
• Some properties of crossings and partitions
• Meanders: Exact asymptotics
• Bounds for the growth rate of meander numbers
• A fast algorithm to generate open meandric systems and meanders
• Exact meander asymptotics: a numerical check

This page was built for publication: Enumerating meandric systems with large number of loops