L-algebras, triplicial-algebras, within an equivalence of categories motivated by graphs

Abstract

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, M verifying, (M id)M =(id M)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 (\`a 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…