REVIEW 1 cited by
Combinatorial proof for the rationality of the bivariate generating series of maps in positive genus
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
read the original abstract
In this paper, we give the first combinatorial proof of a rationality scheme for the generating series of maps in positive genus enumerated by both vertices and faces, which was first obtained by Bender, Canfield and Richmond in 1993 by purely computational techniques. To do so, we rely on a bijection obtained by the second author in a previous work between those maps and a family of decorated unicellular maps. Our main contribution consists in a fine analysis of this family of maps. As a byproduct, we also obtain a new and simpler combinatorial proof of the rationality scheme for the generating series of maps enumerated by their number of edges, originally obtained computationally by Bender and Canfield in 1991 and combinatorially by the second author in 2019.
Forward citations
Cited by 1 Pith paper
-
Differential equations for bipartite maps with bounded face degrees
Combining the KP hierarchy with Virasoro constraints gives a triangular system of ODEs and recurrences for bipartite map counts with bounded face degrees.
Discussion (0). Continue with ORCID to comment.