Bijective counting of plane bipolar orientations and Schnyder woods
Eric Fusy, Dominique Poulalhon, and Gilles Schaeffer

TL;DR
This paper introduces a bijection linking plane bipolar orientations with lattice paths, providing a combinatorial proof for Baxter's formula and connecting Schnyder woods with Dyck words.
Contribution
It presents a new bijection that unifies plane bipolar orientations, lattice paths, and Schnyder woods, offering combinatorial proofs and new insights.
Findings
Proves Baxter's formula for plane bipolar orientations.
Establishes a bijection between Schnyder woods and Dyck words.
Provides a combinatorial proof using lattice paths.
Abstract
A bijection is presented between plane bipolar orientations with prescribed numbers of vertices and faces, and non-intersecting triples of upright lattice paths with prescribed extremities. This yields a combinatorial proof of the following formula due to R. Baxter for the number of plane bipolar orientations with non-polar vertices and inner faces: . In addition, it is shown that specializes into the bijection of Bernardi and Bonichon between Schnyder woods and non-crossing pairs of Dyck words.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Stochastic processes and statistical mechanics
