English
Related papers

Related papers: A partial order on Motzkin paths

200 papers

We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…

Combinatorics · Mathematics 2012-03-28 Filippo Disanto , Luca Ferrari , Simone Rinaldi

Given a lattice path $\nu$, the $\nu$-Tamari lattice and the $\nu$-Dyck lattice are two natural examples of partial order structures on the set of lattice paths that lie weakly above $\nu$. In this paper, we introduce a more general family…

Combinatorics · Mathematics 2025-04-16 Cesar Ceballos , Clément Chenevière

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.…

Combinatorics · Mathematics 2017-09-28 Thomas McConville

In this paper, we explain how the Tamari lattice arises in the context of the representation theory of quivers, as the poset whose elements are the torsion classes of a directed path quiver, with the order relation given by inclusion.

Representation Theory · Mathematics 2011-10-14 Hugh Thomas

We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e.,…

Combinatorics · Mathematics 2007-05-23 Luca Ferrari , Renzo Pinzani

We introduce a new poset structure on Dyck paths where the covering relation is a particular case of the relation inducing the Tamari lattice. We prove that the transitive closure of this relation endows Dyck paths with a lattice structure.…

Combinatorics · Mathematics 2025-05-16 Jean-Luc Baril , Sergey Kirgizov , Mehdi Naima

I present an overview of the research I have conducted for the past ten years in algebraic, bijective, enumerative, and geometric combinatorics. The two main objects I have studied are the permutahedron and the associahedron as well as the…

Combinatorics · Mathematics 2023-10-20 Viviane Pons

There are three classical lattices on the Catalan numbers: the Tamari lattice, the lattice of noncrossing partitions and the lattice of Dyck paths. The first is known to be isomorphic to the lattice of torsion classes of the path algebra of…

Combinatorics · Mathematics 2024-10-24 Baptiste Rognerud

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…

Combinatorics · Mathematics 2017-11-15 Frédéric Chapoton

For any finite path $v$ on the square grid consisting of north and east unit steps, starting at (0,0), we construct a poset Tam$(v)$ that consists of all the paths weakly above $v$ with the same number of north and east steps as $v$. For…

Combinatorics · Mathematics 2014-06-17 Louis-François Préville-Ratelle , Xavier Viennot

Using the notion of series parallel interval order, we propose a unified setting to describe Dyck lattices and Tamari lattices (two well known lattice structures on Catalan objects) in terms of basic notions of the theory of posets. As a…

Combinatorics · Mathematics 2010-07-13 Filippo Disanto , Luca Ferrari , Renzo Pinzani , Simone Rinaldi

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…

Combinatorics · Mathematics 2020-02-05 Cesar Ceballos , Wenjie Fang , Henri Mühle

We introduce and study a new partial order on Dyck paths. We prove that these posets are meet-semilattices. We show that their numbers of intervals are the same as the number of bicubic planar maps. We describe an unexpected connection with…

Combinatorics · Mathematics 2018-10-01 Frédéric Chapoton

The usual, or type A_n, Tamari lattice is a partial order on T_n^A, the triangulations of an (n+3)-gon. We define a partial order on T_n^B, the set of centrally symmetric triangulations of a (2n+2)-gon. We show that it is a lattice, and…

Combinatorics · Mathematics 2007-05-23 Hugh Thomas

We explore some of the properties of a subposet of the Tamari lattice introduced by Pallo, which we call the comb poset. We show that three binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within…

Combinatorics · Mathematics 2019-07-25 Sebastian A. Csar , Rik Sengupta , Warut Suksompong

An extension of the Tamari lattice to the multiplihedra is discussed, along with projections to the composihedra and the Boolean lattice. The multiplihedra and composihedra are sequences of polytopes that arose in algebraic topology and…

Combinatorics · Mathematics 2015-03-19 Stefan Forcey

Given a fixed integer $n\geq 2$, we construct two new finite lattices that we call the cyclic Tamari lattice and the affine Tamari lattice. The cyclic Tamari lattice is a sublattice and a quotient lattice of the cyclic Dyer lattice, which…

Combinatorics · Mathematics 2025-02-12 Grant Barkley , Colin Defant

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…

Logic in Computer Science · Computer Science 2017-01-12 Noam Zeilberger

We introduce a novel combinatorial structure called pointed building sets, which can be viewed as families of lattices equipped with compatibility relations. To each pointed building set $\mathsf{B}$, we associate a complete lattice…

Combinatorics · Mathematics 2026-02-06 Andrew Sack

In this chapter, we trace the path from the Tamari lattice, via lattice congruences of the weak order, to the definition of Cambrian lattices in the context of finite Coxeter groups, and onward to the construction of Cambrian fans. We then…

Combinatorics · Mathematics 2026-05-13 Nathan Reading
‹ Prev 1 2 3 10 Next ›