Related papers: Geometric combinatorial algebras: cyclohedron and …
Generalized permutahedra are a family of polytopes with a rich combinatorial structure and strong connections to optimization. We prove that they are the universal family of polyhedra with a certain Hopf algebraic structure. Their antipode…
We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…
The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…
We prove that the structure algebra of a Bruhat moment graph of a finite real root system is a Hopf algebroid with respect to the Hecke and the Weyl actions. We introduce new techniques (reconstruction and push-forward formula of a product,…
This paper is motivated by the interplay between the Tamari lattice, J.-L. Loday's realization of the associahedron, and J.-L. Loday and M. Ronco's Hopf algebra on binary trees. We show that these constructions extend in the world of…
The polytope subalgebra of deformations of a zonotope can be endowed with the structure of a module over the Tits algebra of the corresponding hyperplane arrangement. We explore this construction and find relations between statistics on…
In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattice structure on those combinatorial Hopf algebras. As an…
We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…
Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees. Based on the bijective correspondence between signed permutations and leveled…
These notes -- originating from a one-semester class by their second author at the University of Minnesota -- survey some of the most important Hopf algebras appearing in combinatorics. After introducing coalgebras, bialgebras and Hopf…
Typed decorated trees are used by Bruned, Hairer and Zambotti to give a description of a renormalisation processon stochastic PDEs. We here study the algebraic structures on these objects: multiple prelie algebrasand related operads…
We introduce a monoid structure on the set of binary search trees, by a process very similar to the construction of the plactic monoid, the Robinson-Schensted insertion being replaced by the binary search tree insertion. This leads to a new…
In a recent series of communications we have shown that the reordering problem of bosons leads to certain combinatorial structures. These structures may be associated with a certain graphical description. In this paper, we show that there…
We use the differential algebra of polytopes to explain the known remarkable relation of the combinatorics of the associahedra and permutohedra with the universal compositional and multiplicative inversion formulas for the formal power…
This manuscript introduces a finite collection of generalized permutohedra associated to a simple graph. The first polytope of this collection is the graphical zonotope of the graph and the last is the graph-associahedron associated to it.…
Recent advances in stochastic PDEs, Hopf algebras of typed trees and integral equations have inspired the study of algebraic structures with replicating operations. To understand their algebraic and combinatorial nature, we first use rooted…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
Motivated by work of Buch on set-valued tableaux in relation to the K-theory of the Grassmannian, we study six combinatorial Hopf algebras. These Hopf algebras can be thought of as K-theoretic analogues of the by now classical ``square'' of…
The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the…
The Grothendieck group of the tower of symmetric group algebras has a self-dual graded Hopf algebra structure. Inspired by this, we introduce by way of axioms, a general notion of a tower of algebras and study two Grothendieck groups on…