Jean-Baptiste Priez - Lattice of combinatorial Hopf algebras: binary trees with multiplicities

dmtcs:2372 - Discrete Mathematics & Theoretical Computer Science, January 1, 2013, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) - https://doi.org/10.46298/dmtcs.2372
Lattice of combinatorial Hopf algebras: binary trees with multiplicitiesConference paper

Authors: Jean-Baptiste Priez 1

  • 1 Laboratoire de Recherche en Informatique

[en]
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 application, we construct a new combinatorial Hopf algebra on binary trees with multiplicities and use it to prove a hook length formula for those trees.

[fr]
Dans une première partie, nous formalisons la construction d’algèbres de Hopf combinatoires à partir d’une réalisation polynomiale et de monoïdes de type monoïde plaxique. Grâce à cette construction, nous mettons à jour une structure de treillis sur ces algèbres de Hopf combinatoires. Comme application, nous construisons une nouvelle algèbre de Hopf sur des arbres binaires à multiplicités et on l’utilise pour démontrer une formule des équerressur ces arbres.


Volume: DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Section: Proceedings
Published on: January 1, 2013
Imported on: November 21, 2016
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] polynomial realization, hook length formula, generating series, binary trees, Combinatorial Hopf algebras, monoids

8 Documents citing this article

Consultation statistics

This page has been seen 447 times.
This article's PDF has been downloaded 779 times.