Maximal degree subposets of $\nu$-Tamari lattices
Combinatorics
2025-11-19 v1
Abstract
In this paper, we study two different subposets of the -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 -Dyck path turns out to be the size of the maximal staircase shape path that fits weakly above . For -Dyck paths of height , we further show that the maximal out-degree poset is poset isomorphic to the -Tamari lattice of -Dyck paths of height , and the maximal in-degree poset is poset isomorphic to the -Dyck paths of height together with a greedy order. We show these two isomorphisms and give some properties on -Tamari lattices along the way.
Keywords
Cite
@article{arxiv.2208.11417,
title = {Maximal degree subposets of $\nu$-Tamari lattices},
author = {Aram Dermenjian},
journal= {arXiv preprint arXiv:2208.11417},
year = {2025}
}
Comments
34 pages, 3 figures