Skip to main content
Log in
(current)
MIT Open Scholarship
DSpace@MIT
Search
Home
MIT Open Access Articles
MIT Open Access Articles
On complexity of representations of quivers
This is not the latest version of this item. The latest version can be found
here
.
On complexity of representations of quivers
Download
Name
1908.10157.pdf
Description
Submitted version
Show more
Size
125.08 KB
Format
Adobe PDF
Checksum
(MD5)
ad12194b6c96c875ffd6f2a3a1f68532
Show more
sword-2021-05-20T18:05:22.original.xml (130 B)
Original SWORD entry document
Show more
Author(s)
Kac, Victor G
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.
Show more
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
http://creativecommons.org/licenses/by-nc-nd/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/137515
DOI of Published Version
10.1016/J.CRMA.2019.10.013
