Related papers: Monoids, dynamics and Leavitt path algebras
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…
We show that every subset of vertices of a directed graph E gives a Morita equivalence between a subalgebra and an ideal of the associated Leavitt path algebra. We use this observation to prove an algebraic version of a theorem of Crisp and…
Weighted Leavitt path algebras (wLpas) are a generalisation of Leavitt path algebras (with graphs of weight 1) and cover the algebras $L_K(n, n + k)$ constructed by Leavitt. Using Bergman's Diamond lemma, we give normal forms for elements…
A categorical formalism for directed graphs is introduced, featuring natural notions of morphisms and subgraphs, and leading to two elementary descriptions of the free-properad monad, first in terms of presheaves on elementary graphs,…
When $\Gamma$ is a row-finite di(rected )graph we classify all finite dimensional modules of the Leavitt path algebra $L(\Gamma)$ via an explicit Morita equivalence given by an effective combinatorial (reduction) algorithm on the digraph…
We study the center of several types of path algebras. We start with the path algebra $KE$ and prove that if the number of vertices is infinite then the center is zero. Otherwise, it coincides with the field $K$ except when the graph $E$ is…
Leibniz algebras are a non-anticommutative version of Lie algebras. They play an important role in different areas of mathematics and physics and have attracted much attention over the last thirty years. In this paper we investigate whether…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
In [8, 9] M. G. Corrales Garcia, D. M. Barquero, C. Martin Gonzalez, M. Siles Molina, J. F Solanilla Hernandez described the center of a Leavitt path algebra and characterized it in terms of the underlying graph. We offer a different…
We introduce M\"obius strip diagram algebras (and their monoid and categorical versions) as subalgebras of a partition-style diagram calculus in which strands may carry handles and M\"obius strip features. We identify the resulting diagram…
In this paper, we develop structure theory for graded regular graded self-injective rings and apply it in the context of Leavitt path algebras. We show that for a finite graph, graded regular graded self-injective Leavitt path algebras are…
We study Steinberg algebras constructed from ample Hausdorff groupoids over commutative integral domains with identity. We reconstruct (graded) groupoids from (graded) Steinberg algebras and use this to characterise when there is a…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
This is a short note on how a particular graph construction on a subset of edges that lead to a subalgebra construction, provided a tool in proving some ring theoretical properties of Leavitt path algebras.
The aim of these notes is to provide a reasonably short and "hands-on" introduction to the differential calculus on associative algebras over a field of characteristic zero. Following a suggestion of Ginzburg's we call the resulting theory…
We construct large classes of maximal commutative subalgebras in prime Steinberg algebras, generalizing a known result for Leavitt path algebras.
Let E be an arbitrary directed graph and let K be any field. It is shown that the Leavitt path algebra A of the graph E over the field K is a Zorn ring if and only if the graph E satisfies the Condition (L), that is, every cycle in E has an…
We present a construction of 2-step nilpotent Lie algebras using labeled directed simple graphs, which allows us to give a criterion to detect certain ideals and subalgebras by finding special subgraphs. We prove that if a label occurs only…
In many ways, graphs are the main modality of data we receive from nature. This is due to the fact that most of the patterns we see, both in natural and artificial systems, are elegantly representable using the language of graph structures.…
This paper studies simplicity, primitivity and semiprimitivity of algebras associated to \'etale groupoids. Applications to inverse semigroup algebras are presented. The results also recover the semiprimitivity of Leavitt path algebras and…