Related papers: Catalan lattices on series parallel interval order…
Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas for forests and the combinatorics of Hermite polynomials. The…
The Catalan numbers form a sequence that counts over 200 combinatorial objects. A remarkable property of the Catalan numbers, which extends to these objects, is its recursive definition; that is, we can determine the $n^{th}$ object from…
A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…
This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and $s$-permutahedra, certain discrete objects that are indexed by a sequence of non-negative integers $s$. In this first paper, we concentrate…
This thesis comes within the scope of algebraic combinatorics and studies problems related to three orders on permutations: the two said weak orders (right and left) and the strong order or Bruhat order. The first part deals with bases of…
Ordering permutations by containment of inversion sets yields a fascinating partial order on the symmetric group: the weak order. This partial order is, among other things, a semidistributive lattice. As a consequence, every permutation has…
In this article we define an encoding for parabolic permutations that distinguishes between parabolic $231$-avoiding permutations. We prove that the componentwise order on these codes realizes the parabolic Tamari lattice, and conclude a…
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…
We generalize the Tamari lattice by extending the notions of $231$-avoiding permutations, noncrossing set partitions, and nonnesting set partitions to parabolic quotients of the symmetric group $\mathfrak{S}_{n}$. We show bijectively that…
For positive integers $m$ and $k$, we introduce a family of lattices $\mathcal{C}_{k}^{(m)}$ associated to the Cambrian lattice $\mathcal{C}_{k}$ of the dihedral group $I_{2}(k)$. We show that $\mathcal{C}_{k}^{(m)}$ satisfies some basic…
In this paper, we explain how the classical Catalan families of objects involving paths, tableaux, triangulations, parentheses configurations and more generalize canonically to a three-dimensional version. In particular, we present…
Three families of posets depending on a nonnegative integer parameter $m$ are introduced. The underlying sets of these posets are enumerated by the $m$-Fuss Catalan numbers. Among these, one is a generalization of Stanley lattices and…
We study the poset topology of lattices arising from orientations of 1-skeleta of directionally simple polytopes, with Bruhat interval polytopes $Q_{e,w}$ as our main example. We show that the order complex $\Delta ((u,v)_w)$ of an interval…
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…
The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets of maximal tubings for the complete graph and the path…
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…
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…
We enumerate the intervals in the Tamari lattices. For this, we introduce an inductive description of the intervals. Then a notion of "new interval" is defined and these are also enumerated. A a side result, the inverse of two special…
The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…
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…