Related papers: Leavitt path algebras having Graded Invariant Basi…

There is an extensive recent literature on the graded, non-graded, prime, primitive, maximal ideals of Leavitt path algebras. In this introductory level survey, we will be giving an overview of different types of ideals and the…

This paper is an attempt to show that, parallel to Elliott's classification of AF $C^*$-algebras by means of $K$-theory, the graded $K_0$-group classifies Leavitt path algebras completely. In this direction, we prove this claim at two…

In this work we realize Leavitt path algebras as partial skew groupoid rings. This yields a free path groupoid grading on Leavitt path algebras. Using this grading we characterize free path groupoid graded isomorphisms of Leavitt path…

We characterize Leavitt path algebras which are Rickart, Baer, and Baer $*$-rings in terms of the properties of the underlying graph. In order to treat non-unital Leavitt path algebras as well, we generalize these annihilator-related…

We show the reduced $C^*$-algebra of a graded ample groupoid is a strongly graded $C^*$-algebra if and only if the corresponding Steinberg algebra is a strongly graded ring. We apply this result to get a theorem about the Leavitt path…

We characterize Leavitt path algebras which are exchange rings in terms of intrinsic properties of the graph and show that the values of the stable rank for these algebras are 1, 2 or $\infty$. Concrete criteria in terms of properties of…

We achieve an extremely useful description (up to isomorphism) of the Leavitt path algebra $L_K(E)$ of a finite graph $E$ with coefficients in a field $K$ as a direct sum of matrix rings over $K$, direct sum with a corner of the Leavitt…

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…

In this article we establish relationships between Leavitt path algebras, talented monoids and the adjacency matrices of the underlying graphs. We show that indeed the adjacency matrix generates in some sense the group action on the…

This survey of the recent developments in the investigations of a Leavitt path algebra L of an arbitrary graph E over a field K consists of two parts. In the first part describes how very often a single graph property of E implies multiple…

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…

In this paper, we provide the structure of Hopf graphs associated to pairs $(G, \mathfrak{r})$ consisting of groups $G$ together with ramification datas $\mathfrak{r}$ and their Leavitt path algebras. Consequently, we characterize the…

Two unanswered questions in the heart of the theory of Leavitt path algebras are whether Grothendieck group $K_0$ is a complete invariant for the class of unital purely infinite simple algebras and, a weaker question, whether $L_2$ (the…

Let $K$ be a field. We characterise the row-finite weighted graphs $(E,w)$ such that the weighted Leavitt path algebra $L_K(E,w)$ is isomorphic to an unweighted Leavitt path algebra. Moreover, we prove that if $L_K(E,w)$ is locally finite,…

Although theoretical properties such as expressive power and over-smoothing of graph neural networks (GNN) have been extensively studied recently, its convergence property is a relatively new direction. In this paper, we investigate the…

For any row-finite graph $E$ and any field $K$ we construct the {\its Leavitt path algebra} $L(E)$ having coefficients in $K$. When $K$ is the field of complex numbers, then $L(E)$ is the algebraic analog of the Cuntz Krieger algebra…

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…

Graph prediction problems prevail in data analysis and machine learning. The inverse prediction problem, namely to infer input data from given output labels, is of emerging interest in various applications. In this work, we develop…

We characterize the values of the stable rank for Leavitt path algebras, by giving concrete criteria in terms of properties of the underlying graph.

Let $R$ be a unital ring, let $E$ be a directed graph and recall that the Leavitt path algebra $L_R(E)$ carries a natural $\mathbb{Z}$-gradation. We show that $L_R(E)$ is strongly $\mathbb{Z}$-graded if and only if $E$ is row-finite, has no…