Enumerating meandric systems with large number of loops

DOI10.4171/AIHPD/80MaRDI QIDQ2286576zbMATH OpenFDO

Authors 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 cumulantfree probabilitymeandermeandric system

Mathematics Subject Classification ID

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

Abstract: 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 $rleq6$, as well as the asymptotic behavior of the meandric numbers for general $r$.

Review text

Summary: 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 \leq 6\), as well as the asymptotic behavior of the meandric numbers for general \(r\).

Recommendations

• Free probability aspect of irreducible meandric systems, and some related observations about meanders
• Cycles in random meander systems
• Asymptotics for a class of meandric systems, via the Hasse diagram of \(\mathrm{NC}(n)\)
• Components in Meandric Systems and the Infinite Noodle
• scientific article; zbMATH DE number 516158

Cites work

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

Cited in

(6)

• Cycles in random meander systems
• Asymptotics for a class of meandric systems, via the Hasse diagram of \(\mathrm{NC}(n)\)
• On the geometry of uniform meandric systems
• Components in Meandric Systems and the Infinite Noodle
• Generating series and matrix models for meandric systems with one shallow side
• Permutons, meanders, and SLE-decorated Liouville quantum gravity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286576)