Enumerating meandric systems with large number of loops - Archive ouverte HAL
Article Dans Une Revue Annales de l’Institut Henri Poincaré (D) Combinatorics, Physics and their Interactions Année : 2019

Enumerating meandric systems with large number of loops

Résumé

We investigate meandric systems with a large number of loops using tools inspired by free probability. For any fixed integer r, we express the generating function of meandric systems on 2n points with n→r loops in terms of a finite (the size depends on r) subclass of irreducible meandric systems, via the moment-cumulant formula from free probability theory. We show that the generating function, after an appropriate change of variable, is a rational function, and we bound its degree. Exact expressions for the generating functions are obtained for r≤6, as well as the asymptotic behavior of the meandric numbers for general r.

Dates et versions

hal-04762172 , version 1 (31-10-2024)

Identifiants

Citer

Motohisa Fukuda, Ion Nechita. Enumerating meandric systems with large number of loops. Annales de l’Institut Henri Poincaré (D) Combinatorics, Physics and their Interactions, 2019, 6 (4), pp.607-640. ⟨10.4171/aihpd/80⟩. ⟨hal-04762172⟩
9 Consultations
0 Téléchargements

Altmetric

Partager

More