On the Representations of Leavitt path algebras
D. Gon\c{c}alves, D.Royer

TL;DR
This paper introduces E-algebraic branching systems for graphs, demonstrating their existence and how they induce representations of Leavitt path algebras, with conditions for faithfulness and equivalence of these representations.
Contribution
It defines E-algebraic branching systems and establishes their role in constructing and analyzing representations of Leavitt path algebras, including criteria for faithfulness and equivalence.
Findings
Existence of E-algebraic branching systems for any graph
Conditions for faithfulness of induced representations
Criteria for equivalence of representations
Abstract
Given a graph E we define E-algebraic branching systems, show their existence and how they induce representations of the associated Leavitt path algebra. We also give sufficient conditions to guarantee faithfulness of the representations associated to E-algebraic branching systems and to guarantee equivalence of a given representation (or a restriction of it) to a representation arising from an E-algebraic branching system.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Operator Algebra Research · Advanced Topics in Algebra · Algebraic structures and combinatorial models
