Related papers: Two bijections on Tamari intervals
We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T0, T1] where T0 and T1 are balanced trees are isomorphic as posets to a hypercube. We introduce tree patterns and…
The Tamari order is a central object in algebraic combinatorics and many other areas. Defined as the transitive closure of an associativity law, the Tamari order possesses a surprisingly rich structure: it is a congruence-uniform lattice.…
The $m$-Tamari lattices $\mathcal{T}_{n}^{(m)}$ were recently introduced by Bergeron and Pr\'eville-Ratelle as posets on $m$-Dyck paths, and it was shown by Bousquet-M\'elou, Fusy and Pr\'eville-Ratelle that these lattices form intervals in…
To every partial order P, one associates a polynomial $\mathbb{D}_P$ in 4 variables that enumerates the intervals of P according to 4 parameters. Some symmetry properties of this polynomial are obtained for a specific family of posets, the…
We give new interpretations of the $\nu$-Tamari lattice of Pr\'eville-Ratelle and Viennot. First, we describe it as a rotation lattice of $\nu$-trees, which uncovers the relation with known combinatorial objects such as tree-like tableaux…
We introduce a new combinatorial structure: the metasylvester lattice on decreasing trees. It appears in the context of the $m$-Tamari lattices and other related $m$-generalizations. The metasylvester congruence has been recently introduced…
The Stanley lattice, Tamari lattice and Kreweras lattice are three remarkable orders defined on the set of Catalan objects of a given size. These lattices are ordered by inclusion: the Stanley lattice is an extension of the Tamari lattice…
The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi paper explores the geometric interpretation of interval…
Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on…
Thomas and Williams conjectured that rowmotion acting on the rational $(a,b)$-Tamari lattice has order $a+b-1$. We construct an equivariant bijection that proves this conjecture when $b\equiv 1\pmod a$; in fact, we determine the entire…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial…
As a classical object, the Tamari lattice has many generalizations, including $\nu$-Tamari lattices and parabolic Tamari lattices. In this article, we unify these generalizations in a bijective fashion. We first prove that parabolic Tamari…
This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…
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\'eville-Ratelle and Viennot (2014) and…
This document is an extended abstract for two articles in preparation. Recently, framing lattices were introduced to generalize many classical lattices such as the Tamari lattice and the weak order on the symmetric group. We define bricks…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…
We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering…
We count the number of linear intervals in the Tamari and the Dyck lattices according to their height, using generating series and Lagrange inversion. Surprisingly, these numbers are the same in both lattices. We define a new family of…