Related papers: Exchange Leavitt path algebras and stable rank

We relate two conjectures which have been raised for classification of Leavitt path algebras. For purely infinite simple unital Leavitt path algebras, it is conjectured that K_0 classifies them completely. For arbitrary Leavitt path…

Let $E$ be a directed graph, $K$ any field, and let $L_K(E)$ denote the Leavitt path algebra of $E$ with coefficients in $K$. We show that $L_K(E)$ is a B\'{e}zout ring, i.e., that every finitely generated one-sided ideal of $L_K(E)$ is…

Ideals in Leavitt path algebras have been shown to share many properties with those of integral domains. Since studying factorizations of ideals in integral domains into special types of ideals (particularly, prime, prime-power, primary,…

Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…

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…

We explicitly describe two-sided ideals in Leavitt path algebras associated with a row-finite graph. Our main result is that any two-sided ideal $I$ of a Leavitt path algebra associated with a row-finite graph is generated by elements of…

In this paper we introduce a new technique to analyze families of rankings focused on the study of structural properties of a new type of graphs. Given a finite number of elements and a family of rankings of those elements, we say that two…

In this paper we propose a graph superalgebra which is the supersymmetric analogue of Leavitt path algebras. We find a basis for these superalgebras and characterize when they have polynomial growth.

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,…

Let $E$ be a finite directed graph, and let $I$ be the poset obtained as the antisymmetrization of its set of vertices with respect to a pre-order $\le$ that satisfies $v\le w$ whenever there exists a directed path from $w$ to $v$. Assuming…

We associate in a natural way to any partially ordered set $(P,\leq)$ a directed graph $E_P$ (where the vertices of $E_P$ correspond to the elements of $P$, and the edges of $E_P$ correspond to related pairs of elements of $P$), and then…

Let $E$ be an arbitrary directed graph and let $L$ be the Leavitt path algebra of the graph $E$ over a field $K$. It is shown that every ideal of $L$ is an intersection of primitive/prime ideals in $L$ if and only if the graph $E$ satisfies…

Using the E-algebraic systems, various graded irreducible representations of a Leavitt path algebra L of a graph E over a field K are constructed. The concept of a Laurent vertex is introduced and it is shown that the minimal graded left…

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

A lower bound for the interleaving distance on persistence vector spaces is given in terms of rank invariants. This offers an alternative proof of the stability of rank invariants.

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 characterize positive definiteness for some family of matrices. As an application we derive explicit value of the quadratic embedding constants of the path graphs.

The Seat Arrangement Problem is a problem of finding a desirable seat arrangement for given preferences of agents and a seat graph that represents a configuration of seats. In this paper, we consider decision problems of determining if an…

Given a directed graph $E$ and an associative unital ring $R$ one may define the Leavitt path algebra with coefficients in $R$, denoted by $L_R(E)$. For an arbitrary group $G$, $L_R(E)$ can be viewed as a $G$-graded ring. In this article,…

Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data. In this work we develop an alternative parameterization for a large class of exchangeable random graphs, where the nodes…