On complexity of representations of quivers

© 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.

Bibliographic Details
Main Author: Kac, Victor G (Author)
Format: Article
Language:English
Published: Elsevier BV, 2021-11-05T15:14:50Z.
Subjects:
Online Access:Get fulltext
LEADER 00608 am a22001573u 4500
001 137515
042 |a dc 
100 1 0 |a Kac, Victor G  |e author 
245 0 0 |a On complexity of representations of quivers 
260 |b Elsevier BV,   |c 2021-11-05T15:14:50Z. 
856 |z Get fulltext  |u https://hdl.handle.net/1721.1/137515 
520 |a © 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. 
546 |a en 
655 7 |a Article 
773 |t 10.1016/J.CRMA.2019.10.013 
773 |t Comptes Rendus Mathematique