Asymptotics for a Class of Meandric Systems, via the Hasse Diagram of NC(n)
arXiv:1708.05188 · doi:10.1093/imrn/rny044
Abstract
We consider closed meandric systems, and their equivalent description in terms of the Hasse diagrams of the lattices of non-crossing partitions . In this equivalent description, the number of components of a random meandric system of order translates into the distance between two partitions in . We focus on a class of couples -- namely the ones where is conditioned to be an interval partition -- for which it turns out to be tractable to study distances in the Hasse diagram. As a consequence, we observe a non-trivial class of meanders (i.e. connected meandric systems), which we call "meanders with shallow top", and which can be explicitly enumerated. Moreover, the expected number of components for a random "meandric system with shallow top", is asymptotically . Our calculations concerning expected number of components are related to the idea of taking the derivative at in a semigroup for the operation of free probability (but the underlying considerations are presented in a self-contained way, and can be followed without assuming a free probability background). Let denote the expected number of components of a general, unconditioned, meandric system of order . A variation of the methods used in the shallow-top case allows us to prove that . We also note that, by a direct elementary argument, one has . These bounds support the conjecture that follows a regime of "constant times " (where numerical experiments suggest that the constant should be ).
36 pages, 9 Figures, added Remark 7.3 giving a shorter proof to Thm 1.1, journal version