arXiv Analytics

Sign in

arXiv:1203.6792 [math.CO]AbstractReferencesReviewsResources

Enumeration of edges in some lattices of paths

Luca Ferrari, Emanuele Munarini

Published 2012-03-30Version 1

We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schr\"oder and Grand Schr\"oder lattices. Finally, we give a general formula for the number of edges in an arbitrary Young lattice (which can be interpreted in a natural way as a lattice of paths).

Related articles: Most relevant | Search more
arXiv:1203.6807 [math.CO] (Published 2012-03-30)
Enumeration of saturated chains in Dyck lattices
arXiv:0907.0709 [math.CO] (Published 2009-07-03, updated 2009-12-11)
The enumeration of fully commutative affine permutations
arXiv:math/9804119 [math.CO] (Published 1998-04-24, updated 1999-01-28)
Enumeration of m-ary cacti