Related papers: Combinatorics of the Permutahedra, Associahedra, a…
This paper introduces the geometric foundations for the study of the $s$-permutahedron and the $s$-associahedron, two objects that encode the underlying geometric structure of the $s$-weak order and the $s$-Tamari lattice. We introduce the…
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 finds its place in the interplay between algebraic and geometric combinatorics. We focus on studying two different families of lattices in relation to the weak order: the permutree lattices and the $s$-weak order. The first part…
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…
We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary sequences. On the combinatorial side, we study the rotation lattices on permutrees and their lattice homomorphisms, unifying the weak order,…
The Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other families of lattice paths. In this article, we fathom such a…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
In this paper, we exploit the combinatorics and geometry of triangulations of products of simplices to derive new results in the context of Catalan combinatorics of $\nu$-Tamari lattices. In our framework, the main role of "Catalan objects"…
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…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
We use a recently introduced combinatorial object, the interval-poset, to describe two bijections on intervals of the Tamari lattice. Both bijections give a combinatorial proof of some previously known results. The first one is an inner…
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…
We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we…
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…
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…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
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…
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…
The main ideas developed in this habilitation thesis consist in endowing combinatorial objects (words, permutations, trees, Young tableaux, etc.) with operations in order to construct algebraic structures. This process allows, by studying…
The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of…