2000 character limit reached
Hopf Algebras and Topological Recursion
Published 10 Mar 2015 in math-ph, math.CO, and math.MP | (1503.02993v3)
Abstract: We consider a model for topological recursion based on the Hopf Algebra of planar binary trees of Loday and Ronco. We show that extending this Hopf Algebra by identifying pairs of nearest neighbor leaves and producing in this way graphs with loops we obtain the full recursion formula of Eynard and Orantin.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.