Algebraic entropy and a complete classification of path algebras over finite graphs by growth (2212.10912v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.