On complexity of representations of quivers

2019/08/27 by Kac, Victor G.
#FOS: Mathematics #Representation Theory (math.RT)

paper · doi:10.48550/arxiv.1908.10157

Abstract

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.

Related

• Counting Representations of Quivers Respecting Nilpotent Relations over Finite Fields
• Rational quiver representations: tame and wild
• Über erreichbare und baumartige unzerlegbare Darstellungen von Köchern
• Counting Semistable Representations of Quivers over Finite Fields
• The representations of quivers of type A_n. A fast approach