- 1512.03959
**Rights statement:**The final publication is available at Springer via http://dx.doi.org/10.1007/s00208-017-1552-0Accepted author manuscript, 419 KB, PDF document

Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

- https://link.springer.com/article/10.1007/s00208-017-1552-0
Final published version

- https://arxiv.org/pdf/1512.03959.pdf
Other version

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

In: Mathematische Annalen, Vol. 369, No. 1-2, 10.2017, p. 397-439.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Elek, G 2017, 'Infinite dimensional representations of finite dimensional algebras and amenability', *Mathematische Annalen*, vol. 369, no. 1-2, pp. 397-439. https://doi.org/10.1007/s00208-017-1552-0

Elek, G. (2017). Infinite dimensional representations of finite dimensional algebras and amenability. *Mathematische Annalen*, *369*(1-2), 397-439. https://doi.org/10.1007/s00208-017-1552-0

Elek G. Infinite dimensional representations of finite dimensional algebras and amenability. Mathematische Annalen. 2017 Oct;369(1-2):397-439. Epub 2017 May 13. doi: 10.1007/s00208-017-1552-0

@article{8a75718d5f1b4b6aa8ef1402e0da7814,

title = "Infinite dimensional representations of finite dimensional algebras and amenability",

abstract = "We present a novel quantitative approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra R over a countable field. The elements of the rank spectrum are representations of the algebra into von Neumann regular rank algebras, and two representations are considered to be equivalent if they induce the same Sylvester rank functions on R-matrices. Based on this approach, we can divide the finite dimensional algebras into three types: finite, amenable and non-amenable representation types. We prove that string algebras are of amenable representation type, but the wild Kronecker algebras are not. Here, the amenability of the rank algebras associated to the limit points in the rank spectrum plays a very important part. We also show that the limit points of finite dimensional representations of algebras of amenable representation type can always be viewed as representations of the algebra in the continuous ring invented by John von Neumann in the 1930{\textquoteright}s. As an application in algorithm theory, we introduce and study the notion of parameter testing of modules over finite dimensional algebras, that is analogous to the testing of bounded degree graphs introduced by Goldreich and Ron. We shall see that for string algebras all the reasonable (stable) parameters are testable.",

author = "Gabor Elek",

note = "The final publication is available at Springer via http://dx.doi.org/10.1007/s00208-017-1552-0",

year = "2017",

month = oct,

doi = "10.1007/s00208-017-1552-0",

language = "English",

volume = "369",

pages = "397--439",

journal = "Mathematische Annalen",

issn = "0025-5831",

publisher = "Springer New York",

number = "1-2",

}

TY - JOUR

T1 - Infinite dimensional representations of finite dimensional algebras and amenability

AU - Elek, Gabor

N1 - The final publication is available at Springer via http://dx.doi.org/10.1007/s00208-017-1552-0

PY - 2017/10

Y1 - 2017/10

N2 - We present a novel quantitative approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra R over a countable field. The elements of the rank spectrum are representations of the algebra into von Neumann regular rank algebras, and two representations are considered to be equivalent if they induce the same Sylvester rank functions on R-matrices. Based on this approach, we can divide the finite dimensional algebras into three types: finite, amenable and non-amenable representation types. We prove that string algebras are of amenable representation type, but the wild Kronecker algebras are not. Here, the amenability of the rank algebras associated to the limit points in the rank spectrum plays a very important part. We also show that the limit points of finite dimensional representations of algebras of amenable representation type can always be viewed as representations of the algebra in the continuous ring invented by John von Neumann in the 1930’s. As an application in algorithm theory, we introduce and study the notion of parameter testing of modules over finite dimensional algebras, that is analogous to the testing of bounded degree graphs introduced by Goldreich and Ron. We shall see that for string algebras all the reasonable (stable) parameters are testable.

AB - We present a novel quantitative approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra R over a countable field. The elements of the rank spectrum are representations of the algebra into von Neumann regular rank algebras, and two representations are considered to be equivalent if they induce the same Sylvester rank functions on R-matrices. Based on this approach, we can divide the finite dimensional algebras into three types: finite, amenable and non-amenable representation types. We prove that string algebras are of amenable representation type, but the wild Kronecker algebras are not. Here, the amenability of the rank algebras associated to the limit points in the rank spectrum plays a very important part. We also show that the limit points of finite dimensional representations of algebras of amenable representation type can always be viewed as representations of the algebra in the continuous ring invented by John von Neumann in the 1930’s. As an application in algorithm theory, we introduce and study the notion of parameter testing of modules over finite dimensional algebras, that is analogous to the testing of bounded degree graphs introduced by Goldreich and Ron. We shall see that for string algebras all the reasonable (stable) parameters are testable.

U2 - 10.1007/s00208-017-1552-0

DO - 10.1007/s00208-017-1552-0

M3 - Journal article

VL - 369

SP - 397

EP - 439

JO - Mathematische Annalen

JF - Mathematische Annalen

SN - 0025-5831

IS - 1-2

ER -