Tree-indexed sums of Catalan numbers
Abstract
We consider a family of infinite sums of products of Catalan numbers, indexed by trees. We show that these sums are polynomials in 1/π with rational coefficients; the proof is effective and provides an algorithm to explicitly compute these sums. Along the way we introduce parametric liftings of our sums, and show that they are polynomials in the complete elliptic integrals of the first and second kind. Moreover, the degrees of these polynomials are at most half of the number of vertices of the tree. The computation of these tree-indexed sums is motivated by the study of large meandric systems, which are non-crossing configurations of loops in the plane.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.