Algebraic entropy and a complete classification of path algebras over finite graphs by growth
Preprint
Abstract
The Gelfand-Kirillov dimension is a well established quantity to classify the growth of infinite dimensional algebras. In this article we introduce the algebraic entropy for path algebras. For the path algebras, Leavitt path algebras and the path algebra of the extended (double) graph, we compare the Gelfand-Kirillov dimension and the entropy. We give a complete classification of path algebras over finite graphs by dimension, Gelfand-Kirillov dimension and algebraic entropy. We show indeed how these three quantities are dependent on cycles inside the graph. Moreover we show that the algebraic entropy is conserved under Morita equivalence. In addition we give several examples of the entropy in path algebras and Leavitt path algebras.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- An adjacency matrix perspective of talented monoids and Leavitt path algebrasLinear Algebra and its Applications, 2023
- Graphs with disjoint cycles classification via the talented monoidJournal of Algebra, 2022
- Leavitt path algebras: the first decadeBulletin of Mathematical Sciences, 2014
- Growth, entropy and commutativity of algebras satisfying prescribed relationsSelecta Mathematica, 2014
- The graded structure of Leavitt path algebrasIsrael Journal of Mathematics, 2012
- The connection between topological and algebraic entropyTopology and its Applications, 2012
- Uniqueness theorems and ideal structure for Leavitt path algebrasJournal of Algebra, 2007
- Nonstable K-theory for Graph AlgebrasAlgebras and Representation Theory, 2006
- The Leavitt path algebra of a graphJournal of Algebra, 2005
- The Entropy of Graded AlgebrasJournal of Algebra, 2000