paper

Intervals in the greedy Tamari posets

arXiv:2303.18077 · doi:10.5070/C61055360

Abstract

We consider a greedy version of the -Tamari order defined on -Dyck paths, recently introduced by Dermenjian. Inspired by intriguing connections between intervals in the ordinary 1-Tamari order and planar triangulations, and more generally by the existence of simple formulas counting intervals in the ordinary -Tamari orders, we investigate the number of intervals in the greedy order on -Dyck paths of fixed size. We find again a simple formula, which also counts certain planar maps (of prescribed size) called -constellations. For instance, when the number of intervals in the greedy order on 1-Dyck paths of length is proved to be , which is also the number of bipartite maps with edges. Our approach is recursive, and uses a ``catalytic'' parameter, namely the length of the final descent of the upper path of the interval. The resulting bivariate generating function is algebraic for all . We show that the same approach can be used to count intervals in the ordinary -Tamari lattices as well. We thus recover the earlier result of the first author, Fusy and Préville-Ratelle, who were using a different catalytic parameter.

24 pages

References in corpus (3)

Cited by in corpus (8)