Related papers: Algebraic characterisations of path algebras

A general theory of the Frolicher-Nijenhuis and Schouten-Nijenhuis brackets in the category of modules over a commutative algebra is described. Some related structures and (co)homology invariants are discussed, as well as applications to…

We prove a characterization of profinite algebras, i.e., topological algebras that are isomorphic to a projective limit of finite discrete algebras. In general profiniteness concerns both the topological and algebraic characteristics of a…

To a semisimple and cosemisimple Hopf algebra over an algebraically closed field, we associate a planar algebra defined by generators and relations and show that it is a connected, irreducible, spherical, non-degenerate planar algebra with…

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (1)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

We investigate the ideal structures of the C^*-algebras arising from topological graphs. We give the complete description of ideals of such C^*-algebras which are invariant under the so-called gauge action, and give the condition on…

A multi-relational graph maintains two or more relations over a vertex set. This article defines an algebra for traversing such graphs that is based on an $n$-ary relational algebra, a concatenative single-relational path algebra, and a…

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 address the question of finding algebraic properties that are respectively equivalent, for a morphism between algebraic varieties over an algebraically closed field of characteristic zero, to be an homeomorphism for the Zariski topology…

Let $Q$ be a finite quiver without oriented cycles and $k$ an algebraically closed field.In this paper we establish a connection between cluster algebras and the representation theory of the path algebra $kQ$, in terms of the spectral…

Refining an idea of Rosenmann and Rosset we show that the now widely studied classical Leavitt algebra $L_K(1,n)$ over a field $K$ is a ring of right quotients of the unital free associative algebra of rank $n$ with respect to the perfect…

We prove an algebraic version of the Gauge-Invariant Uniqueness Theorem, a result which gives information about the injectivity of certain homomorphisms between ${\mathbb Z}$-graded algebras. As our main application of this theorem, we…

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…

Classification, up to isomorphism, of algebras from a non-empty subset of the variety of $n$- dimensional algebras is presented. It is shown that these algebras have only trivial automorphism and if the basic field is algebraically closed…

The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it is completely symmetric. We…

In the authors book, Associative Algebraic Geometry, 2023, and the following article Shemes of Associative Algebras,\\ https://doi.org/10.48550/arXiv.2410.17703,2024, we use an algebraization of the semi-local formal moduli of simple…

Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141--181]…

We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect the…

We define a class of algebras describing links of binary semi-isolating formulas on a set of realizations for a family of 1-types of a complete theory. These algebras include algebras of isolating formulas considered before. We prove that a…

Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…

For a connected graph, a path containing all vertices is known as \emph{Hamiltonian path}. For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a…