Algebraic entropy of path algebras and Leavitt path algebras of finite graphs.

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 show that path algebras over finite graphs can be classified to be of finite dimension, finite Gelfand–Kirillov dimension or finite 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 but perhaps for a different filtration. In addition we give several examples of the entropy in path algebras and Leavitt path algebras.