arXiv Analytics

Sign in

arXiv:1203.6807 [math.CO]AbstractReferencesReviewsResources

Enumeration of saturated chains in Dyck lattices

Luca Ferrari, Emanuele Munarini

Published 2012-03-30Version 1

We determine a general formula to compute the number of saturated chains in Dyck lattices, and we apply it to find the number of saturated chains of length 2 and 3. We also compute what we call the Hasse index (of order 2 and 3) of Dyck lattices, which is the ratio between the total number of saturated chains (of length 2 and 3) and the cardinality of the underlying poset.

Comments: 9 pages
Categories: math.CO, cs.FL
Subjects: 05A15, 05A05, 06A07
Related articles: Most relevant | Search more
arXiv:1203.6792 [math.CO] (Published 2012-03-30)
Enumeration of edges in some lattices of paths
arXiv:0710.1370 [math.CO] (Published 2007-10-06, updated 2011-05-05)
A problem of enumeration of two-color bracelets with several variations
arXiv:math/9904150 [math.CO] (Published 1999-04-27, updated 1999-04-28)
Enumeration of Matchings: Problems and Progress

Links

Toolbox