Pith. sign in

REVIEW 1 cited by

Bijective counting of tree-rooted maps and shuffles of parenthesis systems

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 math/0601684 v1 pith:LUBRAZBX submitted 2006-01-27 math.CO

classification math.CO
keywords mapsbijectionnumberparenthesisshufflessystemstree-rootedawaited
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size $n$ is C(n)C(n+1) where C(n)=binomial(2n,n)/(n+1) is the nth Catalan number. We present a (long awaited) simple bijection which explains this result. We prove that our bijection is isomorphic to a former recursive construction on shuffles of parenthesis systems due to Cori, Dulucq and Viennot.

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. Random surfaces and Liouville quantum gravity

    math.PR 2019-08 unverdicted

    An expository overview of the definition of Liouville quantum gravity surfaces, the three senses in which random planar maps converge to them, and the major open problems.

Pith tools