2000 character limit reached
A new family of bijections for planar maps (1806.02362v2)
Published 6 Jun 2018 in math.CO
Abstract: We present bijections for the planar cases of two counting formulas on maps that arise from the KP hierarchy (Goulden-Jackson and Carrell-Chapuy formulas), relying on a "cut-and-slide" operation. This is the first time a bijective proof is given for quadratic map-counting formulas derived from the KP hierarchy. Up to now, only the linear one-faced case was known (Harer-Zagier recurrence and Chapuy-F\'eray-Fusy bijection). As far as we know, this bijection is new and not equivalent to any of the well-known bijections between planar maps and tree-like objects.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.