Slit-Slide-Sew bijections for planar bipartite maps with prescribed degree (2502.07582v1)
Abstract: We present a bijective proof for the planar case of Louf's counting formula on bipartite planar maps with prescribed face degree, that arises from the Toda hierarchy. We actually show that his formula hides two simpler formulas, both of which can be rewritten as equations on trees using duality and Schaeffer's bijection for eulerian maps. We prove them bijectively and show that the constructions we provide for trees can also be interpreted as "slit-slide-sew" operations on maps. As far as we know, this is the first bijection for a formula arising from an integrable hierarchy with infinitely many parameters.
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.