Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Hopf Algebras and Topological Recursion (1503.02993v3)

Published 10 Mar 2015 in math-ph, math.CO, and math.MP

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.

Summary

We haven't generated a summary for this paper yet.