L-algebras, triplicial-algebras, within an equivalence of categories motivated by graphs
| dc.creator | Philippe, Leroux | |
| dc.date | 2007-09-21 | |
| dc.date | 2008-04-16 | |
| dc.date.accessioned | 2026-07-07T09:32:34Z | |
| dc.date.available | 2026-07-07T09:32:34Z | |
| dc.description | In a previous work, we gave a coalgebraic framework of directed graphs equipped with weights (or probability vectors) in terms of (Markov) L-coalgebras. They are K-vector spaces equipped with two co-operations, Δ_M, \tildeΔ_M verifying, (\tildeΔ_M \otimes id)Δ_M =(id \otimes Δ_M)\tildeΔ_M. In this paper, we study the category of L-algebras (dual of L-coalgebras), prove that the free L-algebra on one generator is constructed over rooted planar symmetric ternary trees with odd numbers of nodes and the L-operad is Koszul. We then introduce triplicial-algebras: vector spaces equipped with three associative operations verifying three entanglement relations. The free triplicial-algebra is computed and turns out to be related to even trees. Via a general structure theorem (à la Cartier-Milnor-Moore), we obtain that the category of L-algebras is equivalent to a much more structured category called connected coassociative triplicial-bialgebras (coproduct linked to operations via infinitesimal relations), that is the triple of operads (As, Trip, L) is good. Bidirected graphs, related to NAP-algebras, are briefly evoked and postponed to another paper. | |
| dc.description | 34 pages, 5 figures. A new presentation of the free triplicial-algebra has been added (Subsection 5.5) + modification of the proof of Thm 5.1. The title has been changed too | |
| dc.identifier | https://arxiv.org/abs/0709.3453 | |
| dc.identifier | http://arxiv.org/abs/0709.3453 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/158826 | |
| dc.subject | Mathematical Physics | |
| dc.subject | 05E99, 05C20, 05C05, 16W10, 16W30, 17A30, 17A50, 18D50, 60J99. | |
| dc.title | L-algebras, triplicial-algebras, within an equivalence of categories motivated by graphs | |
| dc.type | text |