Permutrees (Q5915636)

The aim of this article is to provide a unification of several combinatorial objects (binary trees, Cambrian trees, binary sequences, permutations), respecting their poset structures (Tamari, Cambrian, Boolean and weak Bruhat lattices), their geometrical structures (associahedron, permutohedron\dots) and their algebraic structures (Loday-Ronco Hopf algebra, Malvenuto-Reutenauer Hopf algebras\dots). Permutrees are directed trees with labeled vertices respecting specific restrictions. A notion of decoration allows to give back the objects listed above. Permutrees are given a lattice structure. A morphism from the weak Bruhat lattice of decorated permutations to permutrees is defined. It specialized to the Tamari lattice, Cambrian lattice and Boolean lattice. The Hasse graph of this lattice is given a polytope structure, called permutreehedron, obtained by deleting facted of the permutohedron. It specialized to associahedron. A Hopf algebra structure on permutrees is defined. It contains the Malvenuto-Reutenauer and Loday-Ronco Hopf algebras, as well as the Hopf algebra on Cambrian trees defined by \textit{G. Chatel} and \textit{V. Pilaud} [Adv. Math. 311, 598--633 (2017; Zbl 1369.05211)] and the Hopf algebra of binary sequences defined by \textit{I. M. Gelfand} et al. [Adv. Math. 112, No. 2, 218--348 (1995; Zbl 0831.05063)].