116 research outputs found
Old and young leaves on plane trees
A leaf of a plane tree is called an old leaf if it is the leftmost child of
its parent, and it is called a young leaf otherwise. In this paper we enumerate
plane trees with a given number of old leaves and young leaves. The formula is
obtained combinatorially by presenting two bijections between plane trees and
2-Motzkin paths which map young leaves to red horizontal steps, and old leaves
to up steps plus one. We derive some implications to the enumeration of
restricted permutations with respect to certain statistics such as pairs of
consecutive deficiencies, double descents, and ascending runs. Finally, our
main bijection is applied to obtain refinements of two identities of Coker,
involving refined Narayana numbers and the Catalan numbers.Comment: 11 pages, 7 figure
Reduction of -Regular Noncrossing Partitions
In this paper, we present a reduction algorithm which transforms -regular
partitions of to -regular partitions of .
We show that this algorithm preserves the noncrossing property. This yields a
simple explanation of an identity due to Simion-Ullman and Klazar in connection
with enumeration problems on noncrossing partitions and RNA secondary
structures. For ordinary noncrossing partitions, the reduction algorithm leads
to a representation of noncrossing partitions in terms of independent arcs and
loops, as well as an identity of Simion and Ullman which expresses the Narayana
numbers in terms of the Catalan numbers
Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths
The problem of counting plane trees with edges and an even or an odd
number of leaves was studied by Eu, Liu and Yeh, in connection with an identity
on coloring nets due to Stanley. This identity was also obtained by Bonin,
Shapiro and Simion in their study of Schr\"oder paths, and it was recently
derived by Coker using the Lagrange inversion formula. An equivalent problem
for partitions was independently studied by Klazar. We present three parity
reversing involutions, one for unlabelled plane trees, the other for labelled
plane trees and one for 2-Motzkin paths which are in one-to-one correspondence
with Dyck paths.Comment: 8 pages, 4 figure
Riordan Paths and Derangements
Riordan paths are Motzkin paths without horizontal steps on the x-axis. We
establish a correspondence between Riordan paths and
-avoiding derangements. We also present a combinatorial proof
of a recurrence relation for the Riordan numbers in the spirit of the
Foata-Zeilberger proof of a recurrence relation on the Schr\"oder numbers.Comment: 9 pages, 2 figure
Motzkin Intervals and Valid Hook Configurations
We define a new natural partial order on Motzkin paths that serves as an
intermediate step between two previously-studied partial orders. We provide a
bijection between valid hook configurations of -avoiding permutations and
intervals in these new posets. We also show that valid hook configurations of
permutations avoiding (or equivalently, ) are counted by the same
numbers that count intervals in the Motzkin-Tamari posets that Fang recently
introduced, and we give an asymptotic formula for these numbers. We then
proceed to enumerate valid hook configurations of permutations avoiding other
collections of patterns. We also provide enumerative conjectures, one of which
links valid hook configurations of -avoiding permutations, intervals in
the new posets we have defined, and certain closed lattice walks with small
steps that are confined to a quarter plane.Comment: 22 pages, 8 figure
- β¦