Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The Cambrian Hopf Al ...
Conference paper

The Cambrian Hopf Algebra

Grégory Chatel, Vincent Pilaud
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2014
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Proceedings
DOI
10.46298/dmtcs.2533
License
Attribution 4.0 International (CC BY 4.0)
Indicators
770
Views
555
Downloads

The Cambrian Hopf Algebra

Grégory Chatel, Vincent Pilaud
Abstract
English
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 Cambrian trees, we define the Cambrian Hopf algebra generalizing J.-L. Loday and M. Ronco’s algebra on binary trees. We describe combinatorially the products and coproducts of both the Cambrian algebra and its dual in terms of operations on Cambrian trees. Finally, we define multiplicative bases of the Cambrian algebra and study structural and combinatorial properties of their indecomposable elements.
French
Les arbres Cambriens sont des arbres orientés et étiquetés qui satisfont des conditions locales autour de leurs nœuds généralisant les conditions des arbres binaires de recherche classiques. A partir de la correspondence bijective entre permutations signées et arbres Cambriens à niveau, nous définissons l’algèbre Cambrienne qui généralise l’algèbre sur les arbres binaires de J.-L. Loday et M. Ronco. Nous donnons une description combinatoire du produit et du coproduit aussi bien dans l’algèbre Cambrienne que dans sa duale en termes d’opérations sur les arbres Cambriens. Enfin, nous définissons des bases multiplicatives de l’algèbre Cambrienne et étudions les propriétés structurelles et énumératives de leurs éléments indécomposables.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Combinatorial Hopf algebras
  • Cambrian trees
  • Cambrian lattices
Preview
Loading PDF preview...