Related papers: An Adjacency Matrix Perspective of Talented Monoid…
There is a tight relation between the geometry of a directed graph and the algebraic structure of a Leavitt path algebra associated to it. In this note, we show a similar connection between the geometry of the graph and the structure of a…
It is a conjecture that for the class of Leavitt path algebras associated to finite directed graphs, their graded Grothendieck groups $K_0^{\mathrm{gr}}$ are a complete invariant. For a Leavitt path algebra $L_{\mathsf k}(E)$, with…
The construction of the Leavitt path algebra associated to a directed graph $E$ is extended to incorporate a family $C$ consisting of partitions of the sets of edges emanating from the vertices of $E$. The new algebras, $L_K(E,C)$, are…
We characterise directed graphs consisting of disjoint cycles via their talented monoids. We show that a graph $E$ consists of disjoint cycles precisely when its talented monoid $T_E$ has a certain Jordan-H\"older composition series. These…
In this article, we study properties as simplicity, solvability and nilpotency for Lie bracket algebras arising from Leavitt path algebras, based on the talented monoid of the underlying graph. We show that graded simplicity and simplicity…
Leavitt path algebras, which are algebras associated to directed graphs, were first introduced about 20 years ago. They have strong connections to such topics as symbolic dynamics, operator algebras, non-commutative geometry, representation…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
An introduction to Leavitt path algebras of arbitrary directed graphs is presented, and direct limit techniques are developed, with which many results that had previously been proved for countable graphs can be extended to uncountable ones.…
Leavitt path algebras are free algebras subject to relations induced by directed graphs. This paper investigates the ideals of Leavitt path algebras, with an emphasis on the relationship between graph-theoretic properties of a directed…
In this paper, the Grothendieck group of the Leavitt path algebra over the power graphs of all prime-power cyclic groups is studied by using a well-known computation from linear algebra. More precisely, the Smith normal form of the matrix…
We introduce ring theoretic constructions that are similar to the construction of wreath product of groups. In particular, for a given graph $\Gamma=(V,E)$ and an associate algebra $A,$ we construct an algebra $B=A\, wr\, L(\Gamma)$ with…
The main aim of the paper is to give a socle theory for Leavitt path algebras of arbitrary graphs. We use both the desingularization process and combinatorial methods to study Morita invariant properties concerning the socle and to…
When the theory of Leavitt path algebras was already quite advanced, it was discovered that some of the more difficult questions were susceptible to a new approach using topological groupoids. The main result that makes this possible is…
Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…
Leavitt path algebras associate to directed graphs a $\mathbb Z$-graded algebra and in their simplest form recover the Leavitt algebras $L(1,k)$. In this note, we first study this $\mathbb Z$-grading and characterize the ($\mathbb…
We present an exact formula for the ordinary generating series of the simple paths between any two vertices of a graph. Our formula involves the adjacency matrix of the connected induced subgraphs and remains valid on weighted and directed…
Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the…
The Longest Path Problem is a question of finding the maximum length between pairs of vertices of a graph. In the general case, the problem is NP-complete. However, there is a small collection of graph classes for which there exists an…
We study two classes of inverse semigroups built from directed graphs, namely graph inverse semigroups and a new class of semigroups that we refer to as Leavitt inverse semigroups. These semigroups are closely related to graph…
The adjacency-diametrical matrix (AD matrix) of a connected graph $G$ with diameter $d$, denoted by $AD(G)$, is the matrix indexed by the vertices of $G$ in which the $(i,j)$-entry of $AD(G)$ is $1$ if $d_G(v_i,v_j)=1$, is $d$ if…