Shuffle of parenthesis systems and Baxter permutations
Journal of Combinatorial Theory Series A
Embedding planar graphs in four pages
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Discrete Mathematics
The order dimension of convex polytopes
SIAM Journal on Discrete Mathematics
Bipolar orientations revisited
Discrete Applied Mathematics - Special issue: Fifth Franco-Japanese Days, Kyoto, October 1992
Stack words, standard tableaux and Baxter permutations
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
Proceedings of the 7th conference on Formal power series and algebraic combinatorics
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Doubly alternating Baxter permutations are Catalan
Discrete Mathematics
On topological aspects of orientations
Discrete Mathematics
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
SIAM Journal on Discrete Mathematics
On the number of rectangulations of a planar point set
Journal of Combinatorial Theory Series A
Optimal Coding and Sampling of Triangulations
Algorithmica
Convex Drawings of 3-Connected Plane Graphs
Algorithmica
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
ACM Transactions on Algorithms (TALG)
Intervals in Catalan lattices and realizers of triangulations
Journal of Combinatorial Theory Series A
Bijective counting of plane bipolar orientations and Schnyder woods
European Journal of Combinatorics
Straight-line drawing of quadrangulations
GD'06 Proceedings of the 14th international conference on Graph drawing
Enumerative Combinatorics: Volume 1
Enumerative Combinatorics: Volume 1
The Hopf algebra of diagonal rectangulations
Journal of Combinatorial Theory Series A
European Journal of Combinatorics
4-Labelings and grid embeddings of plane quadrangulations
GD'09 Proceedings of the 17th international conference on Graph Drawing
Bijective Counting of Involutive Baxter Permutations
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Hi-index | 0.00 |
The Baxter number B"n can be written as B"n=@?"k"="0^n@Q"k","n"-"k"-"1 with@Q"k","@?=2(k+1)^2(k+2)(k+@?k)(k+@?+1k)(k+@?+2k). These numbers have first appeared in the enumeration of so-called Baxter permutations; B"n is the number of Baxter permutations of size n, and @Q"k","@? is the number of Baxter permutations with k descents and @? rises. With a series of bijections we identify several families of combinatorial objects counted by the numbers @Q"k","@?. Apart from Baxter permutations, these include plane bipolar orientations with k+2 vertices and @?+2 faces, 2-orientations of planar quadrangulations with k+2 white and @?+2 black vertices, certain pairs of binary trees with k+1 left and @?+1 right leaves, and a family of triples of non-intersecting lattice paths. This last family allows us to determine the value of @Q"k","@? as an application of the lemma of Lindstrom Gessel-Viennot. The approach also allows us to count certain other subfamilies, e.g., alternating Baxter permutations, objects with symmetries and, via a bijection with a class of plane bipolar orientations, also Schnyder woods of triangulations. Most of the enumerative results and some of the bijections are not new. Our contribution is mainly in the simplified and unifying presentation of this beautiful piece of combinatorics.