20 research outputs found
Noncommutative crossing partitions
We define and study noncommutative crossing partitions which are a
generalization of non-crossing partitions. By introducing a new cover relation
on binary trees, we show that the partially ordered set of noncommutative
crossing partitions is a graded lattice. This new lattice contains the Kreweras
lattice, the lattice of non-crossing partitions, as a sublattice. We calculate
the M\"obius function, the number of maximal chains and the number of
-chains in this new lattice by constructing an explicit -labeling on the
lattice. By use of the -labeling, we recover the classical results on the
Kreweras lattice. We characterize two endomorphism on the Kreweras lattice, the
Kreweras complement map and the involution defined by Simion and Ullman, in
terms of the maps on the noncommutative crossing partitions. We also establish
relations among three combinatorial objects: labeled -ary trees,
-chains in the lattice, and -Dyck tilings.Comment: 45 page
Heaps of pieces for lattice paths
We study heaps of pieces for lattice paths, which give a combinatorial
visualization of lattice paths. We introduce two types of heaps: type and
type . A heap of type is characterized by peaks of a lattice path. We
have a duality between a lattice path and its dual on
heaps of type . A heap of type for is characterized by the skew
shape between the lowest path and . We give a determinant expression for
the generating function of heaps for general lattice paths, and an explicit
formula for rational -Dyck paths by using the inversion lemma. We
introduce and study heaps in -dimensions which are bijective to heaps of
type for -Dyck paths. Further, we show a bijective correspondence
between type and type in the case of rational -Dyck paths. As
another application of heaps, we give two explicit formulae for the generating
function of heaps for symmetric Dyck paths in terms of statistics on Dyck paths
and on symmetric Dyck paths respectively.Comment: 31 page