arXiv · 1908.10157
On complexity of representations of quivers
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Victor G. Kac. 2019-09-30. On complexity of representations of quivers. https://arxiv.org/abs/1908.10157
Cite the original work for its findings. Save a collection to share your selection of sources.