Enumeration of edges in some lattices of paths
From MaRDI portal
(Redirected from Publication:5404362)
Abstract: 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).
Recommendations
Cited in
(13)- Catalan intervals and uniquely sorted permutations
- Schröder partitions, Schröder tableaux and weak poset patterns
- Lattices of paths: representation theory and valutions
- scientific article; zbMATH DE number 1058046 (Why is no real title available?)
- Dyck algebras, interval temporal logic, and posets of intervals
- On the edge set of graphs of lattice paths
- Enumeration of chains and saturated chains in Dyck lattices.
- A Heyting algebra on Dyck paths of type A and B
- Pattern distributions in Dyck paths with a first return decomposition constrained by height
- A bijection for essentially 4-connected toroidal triangulations
- Enumeration of the Motzkin paths above a line of rational slope
- Enumeration of paths in the Young-Fibonacci graph
- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
This page was built for publication: Enumeration of edges in some lattices of paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404362)