Maximal Degree Subposets of $\nu$-Tamari Lattices
Abstract
In this paper, we study two different subposets of the $\nu$-Tamari lattice: one in which all elements have maximal in-degree and one in which all elements have maximal out-degree. The maximal in-degree and maximal out-degree of a $\nu$-Dyck path turns out to be the size of the maximal staircase shape path that fits weakly abo ve $\nu$. For $m$-Dyck paths of height $n$, we further show that the maximal out-degree poset is poset isomorphic to the $\nu$-Tamari lattice of $(m-1)$-Dyck paths of height $n$, and the maximal in-degree poset is poset isomorphic to the $(m-1)$-Dyck paths of height $n$ together with a greedy order. We show these two isomorphisms and give some properties on $\nu$-Tamari lattices along the way.
Published
2023-06-16
How to Cite
Dermenjian, A. (2023). Maximal Degree Subposets of $\nu$-Tamari Lattices. The Electronic Journal of Combinatorics, 30(2), P2.43. https://doi.org/10.37236/11571
Article Number
P2.43