We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schröder and Grand Schröder 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).
Enumeration of edges in some lattices of paths
MUNARINI, EMANUELE
2014-01-01
Abstract
We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schröder and Grand Schröder 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).File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Enumeration of edges in some lattices of paths_11311-875154_Munarini.pdf
accesso aperto
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
204.2 kB
Formato
Adobe PDF
|
204.2 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
