Asymptotics for a Class of Meandric Systems, via the Hasse Diagram of NC(n)

DOI10.1093/imrn/rny044zbMath1437.05105arXiv1708.05188OpenAlexW2747309007WikidataQ130168757 ScholiaQ130168757MaRDI QIDQ4960118

Doron Puder, Alexandru Nica, Ian P. Goulden

Publication date: 8 April 2020

Published in: International Mathematics Research Notices (Search for Journal in Brave)

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

zbMATH Keywords

number of components of a random meandric system

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Free probability and free operator algebras (46L54) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

On the geometry of uniform meandric systems ⋮ Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022 ⋮ Wiener indices of minuscule lattices

This page was built for publication: Asymptotics for a Class of Meandric Systems, via the Hasse Diagram of NC(n)