Related papers: Monoids, dynamics and Leavitt path algebras
Given a directed graph E we describe a method for constructing a Leavitt path algebra $L_R(E)$ whose coefficients are in a commutative unital ring R. We prove versions of the Graded Uniqueness Theorem and Cuntz-Krieger Uniqueness Theorem…
We show that, for an arbitrary graph, a regular ideal of the associated Leavitt path algebra is also graded. As a consequence, for a row-finite graph, we obtain that the quotient of the associated Leavitt path by a regular ideal is again a…
We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…
In this note we study a family of algebras with one parameter defined by generators and relations. The set of generators contains the generators of the usual braids algebra, and another set of generators which is interpreted as ties between…
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…
This is a survey of recently published results. We introduce and study a wide class algebras associated to directed graphs and related to factorizations of noncommutative polynomials. In particular, we show that for many well-known graphs…
A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition…
In the last quarter of a century, algebraic statistics has established itself as an expanding field which uses multilinear algebra, commutative algebra, computational algebra, geometry, and combinatorics to tackle problems in mathematical…
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…
While every matrix algebra over a field $K$ can be realized as a Leavitt path algebra, this is not the case for every graded matrix algebra over a graded field. We provide a complete description of graded matrix algebras over a field,…
The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…
For a representation of a Lie algebra, one can construct a diagram of the representation, i. e. a directed graph with edges labeled by matrix elements of the representation. This article explains how to use these diagrams to describe normal…
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static…
We develop some aspects of a general theory of presentations of subshifts by labelled directed graphs, in particular by compact graphs. Also considered are synchronization properties of subshifts that lead to presentations by countable…
We study Lie-Rinehart algebra structures in the framework provided by a duality pairing of modules over a unital commutative associative algebra. Thus, we construct examples of Lie brackets corresponding to a fixed anchor map whose image is…
Leavitt path algebras L of an arbitrary graph E over a field K satisfying a polynomial identity are completely characterized both in graph-theoretic and algebraic terms. When E is a finite graph, L satisfying a polynomial identity is shown…
We introduce a class of topologies on the Leavitt path algebra $L(\Gamma)$ of a finite directed graph and decompose a graded completion $\widehat{L}(\Gamma)$ as a direct sum of minimal ideals.
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
In this paper, we introduce the notion of relative ultragraph algebras and extend classical injectivity criteria for representations, particularly those arising from branching systems,to this relative setting. This new concept is closely…
In this paper, we initiate the study of Leavitt path algebra over Kronecker square of a quiver and show the similarities and contrasts in the properties of Leavitt path algebra over a quiver and its Kronecker square. Furthermore, we discuss…