Pith. sign in

REVIEW 1 cited by

Simple formulas for constellations and bipartite maps with prescribed degrees

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1904.05371 v2 pith:J6FIP2AC submitted 2019-04-10 math.CO

classification math.CO
keywords formulasmapsbipartitenumberssimpleconstellationsdegreeshurwitz
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We obtain simple quadratic recurrence formulas counting bipartite maps on surfaces with prescribed degrees (in particular, $2k$-angulations), and constellations. These formulas are the fastest known way of computing these numbers. Our work is a natural extension of previous works on integrable hierarchies (2-Toda and KP), namely the Pandharipande recursion for Hurwitz numbers (proven by Okounkov and simplified by Dubrovin-Yang-Zagier), as well as formulas for several models of maps (Goulden-Jackson, Carrell-Chapuy, Kazarian-Zograf). As for those formulas, a bijective interpretation is still to be found. We also include a formula for monotone simple Hurwitz numbers derived in the same fashion. These formulas also play a key role in subsequent work of the author with T. Budzinski establishing the hyperbolic local limit of random bipartite maps of large genus.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Combinatorics of Bousquet-M\'elou-Schaeffer numbers in the light of topological recursion

    math.CO 2019-08 conditional novelty 7.0 of 10

    For stable genera, Bousquet-Mélou-Schaeffer numbers factor as a product of explicit Pochhammer-type factors times a polynomial in the partition parts, and the paper proves this combinatorially.

Pith tools