Random monotone factorisations of the cycle

From MaRDI portal




Abstract: In this article we study decreasing and increasing factorisations of the cycle, which are decompositions of the cycle (12dotsn) into a product of n−1 transpositions satisfying monotonicity conditions. We explicit a bijection between such factorisations and plane trees with n vertices. This will allow us to study some of their combinatorial properties, as well as a geometric representation in terms of laminations, which are non-crossing line segments in the unit disk.














This page was built for publication: Random monotone factorisations of the cycle

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