On complexity of representations of quivers
Name
1908.10157.pdf
Description
Submitted version
Size
125.08 KB
Format
Unknown
Checksum (MD5)
ad12194b6c96c875ffd6f2a3a1f68532
Author(s)
Kac, Victor
Date Issued
2019
Journal
Comptes Rendus Mathematique
Publisher
Elsevier BV
Citation
Kac, Victor G. 2019. "On complexity of representations of quivers." Comptes Rendus Mathematique, 357 (11-12).
Version
Original manuscript
Abstract
© 2019 Académie des sciences It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/J.CRMA.2019.10.013
