Two Bijections on Weighted Motzkin Paths

In this paper, we provide a bijection between the set of underdiagonal lattice paths of length n and the set of(2, 2)-Motzkin paths of length n. Besides, we generalize the bijection of Shapiro and Wang(Shapiro L W, Wang C J. A bijection between 3-Motzkin paths and Schr¨oder paths with no peak at odd height. J. Integer Seq., 2009, 12: Article 09.3.2.) to a bijection between k-Motzkin paths and(k-2)-Schr¨oder paths with no horizontal step at even height. It is interesting that the second bijection is a generalization of the well-known bijection between Dyck paths and 2-Motzkin paths.     

Pairs of noncrossing free Dyck paths and noncrossing partitions

Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2n and noncrossing partitions of [2n+1] with n+1 blocks. In terms of the number of up steps at odd positions, we find a characterization of Dyck paths constructed from pairs of noncrossing free Dyck paths by using the Labelle merging algorithm.     

A Simple and Unusual Bijection for Dyck Paths and its Consequences

In this paper we introduce a new bijection from the set of Dyck paths to itself. This bijection has the property that it maps statistics that appeared recently in the study of patternavoiding permutations into classical statistics on Dyck paths, whose distribution is easy to obtain. We also present a generalization of the bijection, as well as several applications of it to enumeration problems of statistics in restricted permutations.AMS Subject Classification: 05A15, 05A05.     

Dyck paths with a first return decomposition constrained by height

We study the enumeration of Dyck paths having a first return decomposition with special properties based on a height constraint. We exhibit new restricted sets of Dyck paths counted by the Motzkin numbers, and we give a constructive bijection between these objects and Motzkin paths. As a byproduct, we provide a generating function for the number of Motzkin paths of height $k$ with a flat (resp. with no flats) at the maximal height.     

A bijection between 2-triangulations and pairs of non-crossing Dyck paths

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length 2(n−4). This solves the problem of finding a bijective proof of a result of Jonsson for the case k=2. We obtain the bijection by constructing isomorphic generating trees for the sets of 2-triangulations and pairs of non-crossing Dyck paths.     

A bijection between ordered trees and 2-Motzkin paths and its many consequences

A new bijection between ordered trees and 2-Motzkin paths is presented, together with its numerous consequences regarding ordered trees as well as other combinatorial structures such as Dyck paths, bushes, {0,1,2}-trees, Schröder paths, RNA secondary structures, noncrossing partitions, Fine paths, and Davenport-Schinzel sequences.RésuméUne nouvelle bijection entre arbres ordonnés et chemins de Motzkin bicolorés est présentée, avec ses nombreuses conséquences en ce qui concerne les arbres ordonnés ainsi que d'autres structures combinatoires telles que chemins de Dyck, buissons, arbres de type {0,1,2}, chemins de Schröder, structures secondaires de type RNA, partitions non croisées, chemins de Fine, et enfin suites de Davenport-Schinzel.     

Identities from weighted Motzkin paths

Based on a weighted version of the bijection between Dyck paths and 2-Motzkin paths, we find combinatorial interpretations of two identities related to the Narayana polynomials and the Catalan numbers. These interpretations answer two questions posed recently by Coker.     

A Distributive Lattice Structure Connecting Dyck Paths,Noncrossing Partitions and 312-avoiding Permutations

In [Ferrari, L. and Pinzani, R.: Lattices of lattice paths. J. Stat. Plan. Inference 135 (2005), 77–92] a natural order on Dyck paths of any fixed length inducing a distributive lattice structure is defined. We transfer this order to noncrossing partitions along a well-known bijection [Simion, R.: Noncrossing partitions. Discrete Math. 217 (2000), 367–409], thus showing that noncrossing partitions can be endowed with a distributive lattice structure having some combinatorial relevance. Finally we prove that our lattices are isomorphic to the posets of 312-avoiding permutations with the order induced by the strong Bruhat order of the symmetric group.     

Two bijections for the area of Dyck paths

The sum of the areas of (2n+2)-length Dyck paths, or total area, is equal to the number of points with ordinate 1 in Grand-Dyck paths of length 2n+2, n⩾0. A bijective proof of this correspondence is shown by passing through an auxiliary class of marked paths. The sequence of numbers 1,6,29,130,562,… counts the total area of (2n+2)-length Dyck paths as well as the number of points having ordinate 0 and which satisfy an additional condition, on 2n-length paths made up of rise and fall steps. First, a bijection between these points and the triangles constituting the total area of (2n+2)-length Dyck paths is established, and then the correspondence between the above-mentioned points and the points with ordinate 1 on (2n+2)-length Grand-Dyck paths is shown.     

Knight's paths towards Catalan numbers

We provide enumerating results for partial knight's paths of a given size. We prove algebraically that zigzag knight's paths of a given size ending on the x-axis are enumerated by the generalized Catalan numbers, and we give a constructive bijection with peakless Motzkin paths of a given length. After enumerating partial knight's paths of a given length, we prove that zigzag knight's paths of a given length ending on the x-axis are counted by the Catalan numbers. Finally, we give a constructive bijection with Dyck paths of a given length.     

Restricted Dumont permutations, Dyck paths, and noncrossing partitions

We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that uses cycle decomposition, as well as bijections between 132-, 231- and 321-avoiding Dumont permutations and Dyck paths. Finally, we enumerate Dumont permutations of the first kind simultaneously avoiding certain pairs of 4-letter patterns and another pattern of arbitrary length.     

Counting Dyck Paths by Area and Rank

The set of Dyck paths of length 2n inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths: area (the area under the path) and rank (the rank in the lattice). While area for Dyck paths has been studied, pairing it with this rank function seems new, and we get an interesting (q, t)-refinement of the Catalan numbers. We present two decompositions of the corresponding generating function: One refines an identity of Carlitz and Riordan; the other refines the notion of γ-nonnegativity, and is based on a decomposition of the lattice of noncrossing partitions due to Simion and Ullman. Further, Biane’s correspondence and a result of Stump allow us to conclude that the joint distribution of area and rank for Dyck paths equals the joint distribution of length and reflection length for the permutations lying below the n-cycle (12· · ·n) in the absolute order on the symmetric group.     

Greedy elements in rank 2 cluster algebras

A lot of recent activity in the theory of cluster algebras has been directed toward various constructions of “natural” bases in them. One of the approaches to this problem was developed several years ago by Sherman and Zelevinsky who have shown that the indecomposable positive elements form an integer basis in any rank 2 cluster algebra of finite or affine type. It is strongly suspected (but not proved) that this property does not extend beyond affine types. Here, we go around this difficulty by constructing a new basis in any rank 2 cluster algebra that we call the greedy basis. It consists of a special family of indecomposable positive elements that we call greedy elements. Inspired by a recent work of Lee and Schiffler; Rupel, we give explicit combinatorial expressions for greedy elements using the language of Dyck paths.     

Natural Operators Lifting Vector Fields to Bundles of Weil Contact Elements

Let A be a Weil algebra. The bijection between all natural operators lifting vector fields from m-manifolds to the bundle functor K ^A of Weil contact elements and the subalgebra of fixed elements SA of the Weil algebra A is determined and the bijection between all natural affinors on K ^A and SA is deduced. Furthermore, the rigidity of the functor K ^A is proved. Requisite results about the structure of SA are obtained by a purely algebraic approach, namely the existence of nontrivial SA is discussed.     

Indecomposable permutations, hypermaps and labeled Dyck paths

Hypermaps were introduced as an algebraic tool for the representation of embeddings of graphs on an orientable surface. Recently a bijection was given between hypermaps and indecomposable permutations; this sheds new light on the subject by connecting a hypermap to a simpler object. In this paper, a bijection between indecomposable permutations and labeled Dyck paths is proposed, from which a few enumerative results concerning hypermaps and maps follow. We obtain for instance an inductive formula for the number of hypermaps with n darts, p vertices and q hyperedges; the latter is also the number of indecomposable permutations of Sn with p cycles and q left-to-right maxima. The distribution of these parameters among all permutations is also considered.     

Representation of Numerical Semigroups by Dyck Paths

We introduce square diagrams that represent numerical semigroups and we obtain an injection from the set of numerical semigroups into the set of Dyck paths.     

Bijective counting of plane bipolar orientations and Schnyder woods

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 Baxter for the number Θ_ij of plane bipolar orientations with i non-polar vertices and j 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.This is the extended and revised journal version of a conference paper with the title “Bijective counting of plane bipolar orientations”, which appeared in Electr. Notes in Discr. Math. pp. 283–287 (Proceedings of Eurocomb’07, 11–15 September 2007, Sevilla).