The algebraic entropies of the Leavitt path algebra and the graph algebra agree (Q6635280)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The algebraic entropies of the Leavitt path algebra and the graph algebra agree |
scientific article; zbMATH DE number 7941062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The algebraic entropies of the Leavitt path algebra and the graph algebra agree |
scientific article; zbMATH DE number 7941062 |
Statements
The algebraic entropies of the Leavitt path algebra and the graph algebra agree (English)
0 references
9 November 2024
0 references
The authors recall the standard filtrations on the path algebra \(KE\) as well as in the Cohn path algebra \(C_K(E)\) and the Leavitt path algebra \(L_K(E)\). They give an expression of entropy in terms of norms of powers of adjacency matrices. Applying the fundamental formula in holomorphic functional calculus to matrices, the authors relate the algebraic entropies of \(C_K(E)\) and \(L_K(E)\) and prove that the algebras \(L_K(E)\) and \(KE\) have the same entropy.
0 references
graph algebra
0 references
path algebra
0 references
Leavitt path algebra
0 references
Gelfand-Kirillov dimension
0 references
algebraic entropy
0 references
0.7273060083389282
0 references
0.7195762991905212
0 references
0.7189278602600098
0 references