A co-preLie structure from chronological loop erasure in graph walks

Abstract

We show that the chronological removal of cycles from a walk on a graph, known as Lawler's loop-erasing procedure, generates a preLie co-algebra on the vector space spanned by the walks. In addition, we prove that the tensor and symmetric algebras of graph walks are graded Hopf algebras, provide their antipodes explicitly and recover the preLie co-algebra from a brace coalgebra on the tensor algebra of graph walks. Finally we exhibit sub-Hopf algebras associated to particular types of walks.

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…