2000 character limit reached
Topological Recursion for Generalized $bc$-Motzkin Numbers
Published 24 Nov 2021 in math.CO and math.AG | (2111.12839v1)
Abstract: We present a higher genus generalization of $bc$-Motzkin numbers, which are themselves a generalization of Catalan numbers, and we derive a recursive formula which can be used to calculate them. Further, we show that this leads to a topological recursion which is identical to the topological recursion that had previously been proved by Dumitrescu and Mulase for generalized Catalan numbers, and which is an example of the Eynard-Orantin topological recursion.
Sponsor
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.