Bijections for Baxter families and related objects
The Baxter number B n can be written as B n = ∑ k = 0 n Θ k , n − k − 1 with Θ k , ℓ = 2 ( k + 1 ) 2 ( k + 2 ) ( k + ℓ k ) ( k + ℓ + 1 k ) ( k + ℓ + 2 k ) . 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...
Uloženo v:
| Vydáno v: | Journal of combinatorial theory. Series A Ročník 118; číslo 3; s. 993 - 1020 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article Publikace |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.04.2011
Elsevier |
| Témata: | |
| ISSN: | 0097-3165, 1096-0899 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The Baxter number
B
n
can be written as
B
n
=
∑
k
=
0
n
Θ
k
,
n
−
k
−
1
with
Θ
k
,
ℓ
=
2
(
k
+
1
)
2
(
k
+
2
)
(
k
+
ℓ
k
)
(
k
+
ℓ
+
1
k
)
(
k
+
ℓ
+
2
k
)
.
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
Θ
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
Θ
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
Θ
k
,
ℓ
as an application of the lemma of Lindström 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. |
|---|---|
| ISSN: | 0097-3165 1096-0899 |
| DOI: | 10.1016/j.jcta.2010.03.017 |