Typed binary trees and generalized dendrifom algebras - Archive ouverte HAL Access content directly
Journal Articles Journal of Algebra Year : 2021

Typed binary trees and generalized dendrifom algebras

Abstract

We here both unify and generalize nonassociative structures on typed binary trees, that is to say plane binary trees which edges are decorated by elements of a set Ω. We prove that we obtain such a structure, called a Ω-dendriform structure, if Ω has four products satisfying certain axioms (EDS axioms), including the axioms of a diassociative semigroup. This includes matching dendriform algebras introduced by Gao, Guo and Zhang and family dendriform algebras associated to a semigroup introduced by Zhang, Gao and Manchon , and of course dendriform algebras when Ω is reduced to a single element. We also give examples of EDS, including all the EDS of cardinality two; a combinatorial description of the products of such a structure on typed binary trees, but also on words; a study of the Koszul dual of the associated operads; and considerations on the existence of a coproduct, in order to obtain dendriform bialgebras.
Fichier principal
Vignette du fichier
dendriform.pdf (726.08 Ko) Télécharger le fichier
dendriform.toc (2.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02483607 , version 1 (18-02-2020)

Identifiers

Cite

Loïc Foissy. Typed binary trees and generalized dendrifom algebras. Journal of Algebra, 2021, 586, pp.1-61. ⟨10.1016/j.jalgebra.2021.06.025⟩. ⟨hal-02483607⟩
49 View
66 Download

Altmetric

Share

Gmail Facebook X LinkedIn More