Search arXivSearch

arXiv · 1511.05937

The enumeration of generalized Tamari intervals

Abstract

Let $v$ be a grid path made of north and east steps. The lattice $\rm{T{\scriptsize AM}}(v)$, based on all grid paths weakly above $v$ and sharing the same endpoints as $v$, was introduced by Préville-Ratelle and Viennot (2014) and corresponds to the usual Tamari lattice in the case $v=(NE)^n$. Our main contribution is that the enumeration of intervals in $\rm{T{\scriptsize AM}}(v)$, over all $v$ of length $n$, is given by $\frac{2 (3n+3)!}{(n+2)! (2n+3)!}$. This formula was first obtained by Tutte(1963) for the enumeration of non-separable planar maps. Moreover, we give an explicit bijection from these intervals in $\rm{T{\scriptsize AM}}(v)$ to non-separable planar maps.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenjie Fang, Louis-François Préville-Ratelle. 2016-10-05. The enumeration of generalized Tamari intervals. https://doi.org/10.1016/j.ejc.2016.10.003

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO