Coassociativity breaking and oriented graphs

2002/04/29 by Philippe Leroux, Leroux, Philippe
Mathematics · #05C20 #16A24 #60J15 #Advanced Operator Algebra Research #Advanced Topics in Algebra #Algebraic structures and combinatorial models #FOS: Mathematics #Probability (math.PR) #Quantum Algebra (math.QA) #math.PR #math.QA #msc:05C20 #msc:16A24 #msc:60J15

paper · pdf · doi:10.48550/arxiv.math/0204342

arxiv created 2002/04/29 · openalex publication_date 2002/04/29 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper is an attempt to unify coassociative coalgebra theory and random walks on oriented graphs.

Citations

• A class ofC *-algebras and topological Markov chains

Related

• Shattering, Graph Orientations, and Connectivity
• A note on directed analogues of the Sidorenko and forcing conjectures
• Dismantlability, connectedness, and mixing in relational structures
• The Collatz function as an automorphic Cayley colour graph:decidability of an+b conjectures, proof of the 3n + 1 conjecture
• Random nearest neighbor graphs: the translation invariant case