Related papers: Exchange Leavitt path algebras and stable rank
We prove that strongly homotopy algebras (such as $A_\infty$, $C_\infty$, sh Lie, $B_\infty$, $G_\infty$,...) are homotopically invariant in the category of chain complexes. An important consequence is a rigorous proof that `strongly…
In this paper, we give sharp bounds for the homological dimensions of the Leavitt path algebra $L_K(E)$ of a finite graph $E$ with coefficients in a commutative ring $K$, as well as establish a formula for calculating the homological…
A connected graph can be associated with two distinct evolution algebras. In the first case, the structural matrix is the adjacency matrix of the graph itself. In the second case, the structural matrix is the transition probabilities matrix…
For a field K and directed graph E, we analyze those elements of the Leavitt path algebra L_K(E) which lie in the commutator subspace [L_K(E), L_K(E)]. This analysis allows us to give easily computable necessary and sufficient conditions to…
We study the problem of assigning agents to the vertices of a graph such that no pair of neighbors can benefit from swapping assignments -- a property we term neighborhood stability. We further assume that agents' utilities are based solely…
Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…
We demonstrate that a large class of one-dimensional quantum and classical exchange models can be described by the same type of graphs, namely Cayley graphs of the permutation group. Their well-studied spectral properties allow us to derive…
Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce \textit{steady} and…
Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the…
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
We give an introduction to the "stable algebra of matrices" as related to certain problems in symbolic dynamics. We consider this stable algebra (especially, shift equivalence and strong shift equivalence) for matrices over general rings as…
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k,L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and…
We define the notion of dextral symmetric algebras (not necessarily associative), motivated by the idea of symmetric rings. We derive a complete classification of dextral symmetric algebras of Leavitt path algebras, and right Leibniz…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
The quest for optimal/stable paths in graphs has gained attention in a few practical or theoretical areas. To take part in this quest this chapter adopts an equilibrium-oriented approach that is abstract and general: it works with…
Let $E$ be an arbitrary directed graph and let $L$ be the Leavitt path algebra of the graph $E$ over a field $K$. The necessary and sufficient con- ditions are given to assure the existence of a maximal ideal in $L$ and also the necessary…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
Component graphs $\Gamma_{0}(F)$ are defined for arrays of sets $F$, and in particular for arrays of path components for Vietoris-Rips complexes and Lesnick complexes. The path components of $\Gamma_{0}(F)$ are the {\it stable components}…
We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…