Algebraic entropy and a complete classification of path algebras over finite graphs by growth

2022/12/21 by Wolfgang Böck, Cristóbal Gil Canto, Bock, Wolfgang +9
Mathematics · #Advanced Operator Algebra Research #Advanced Topics in Algebra #Algebraic structures and combinatorial models

paper · pdf · doi:10.48550/arxiv.2212.10912

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.

Related

• The algebraic entropies of the Leavitt path algebra and the graph algebras agree
• Leavitt path algebras satisfying a polynomial identity
• Classification of Leavitt Path Algebras with Gelfand-Kirillov Dimension <4 up to Morita Equivalence
• Topological entropy and AF subalgebras of graph C*-algebras
• Leavitt path algebras of hypergraphs