Enumeration of chains and saturated chains in Dyck lattices.

DOI10.1016/J.AAM.2014.09.003MaRDI QIDQ472925zbMATH OpenOpenAlexFDO

Authors L. Ferrari, Emanuele Munarini

Publication date 20 November 2014

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.6807

zbMATH Keywords

Dyck pathsfinite distributive latticesnumbers of chainscombinatorics of lattice pathsDyck latticesHasse indicesnumbers of saturated chains

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Structure and representation theory of distributive lattices (06D05)

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.

Recommendations

• Enumeration of edges in some lattices of paths
• Lattices of lattice paths
• scientific article; zbMATH DE number 5812185
• A note on lattice chains and Delannoy numbers
• The Dyck pattern poset

Cites work

• scientific article; zbMATH DE number 3987281 (Why is no real title available?)
• scientific article; zbMATH DE number 1111371 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• A Course in Enumeration
• Counting paths in Young's lattice
• Counting strings in Dyck paths
• Determinants of (generalised) Catalan numbers
• Dyck path enumeration
• Enumeration of edges in some lattices of paths
• Intervals in Catalan lattices and realizers of triangulations
• Lattices of lattice paths
• Lattices of paths: representation theory and valutions
• Pairs of noncrossing free Dyck paths and noncrossing partitions

Cited in

(10)

• Catalan intervals and uniquely sorted permutations
• Schröder partitions, Schröder tableaux and weak poset patterns
• Water capacity of Dyck paths
• Chains with small intervals in the lattice of binary paths
• The rank enumeration of certain parabolic non-crossing partitions
• Dyck algebras, interval temporal logic, and posets of intervals
• Enumeration of edges in some lattices of paths
• A Heyting algebra on Dyck paths of type A and B
• A note on lattice chains and Delannoy numbers
• Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Enumeration of chains and saturated chains in Dyck lattices.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472925)