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 with infinitely many parameters arising from an integrable hierarchy.
From: Juliette Schabanel [view email]
[v1]
Tue, 11 Feb 2025 14:29:09 UTC (672 KB)
[v2]
Wed, 8 Jul 2026 09:26:54 UTC (573 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。