Enumeration of saturated chains in Dyck lattices
Combinatorics
2021-04-01 v1 Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.1203.6807,
title = {Enumeration of saturated chains in Dyck lattices},
author = {Luca Ferrari and Emanuele Munarini},
journal= {arXiv preprint arXiv:1203.6807},
year = {2021}
}
Comments
9 pages