Non-commutative Rank and Semi-stability of Quiver Representations
Alana Huszar

TL;DR
This paper extends the concept of non-commutative rank to quiver representations, connecting it with stability criteria and providing polynomial-time algorithms for computing related invariants.
Contribution
It introduces non-commutative Hom and Ext spaces for quiver representations and relates them to stability conditions, offering efficient algorithms for their computation.
Findings
Defined non-commutative Hom and Ext spaces for quivers
Connected these notions to King's stability criterion
Developed polynomial-time algorithms for stability verification
Abstract
Fortin and Reutenauer defined the non-commutative rank for a matrix with entries that are linear functions. The non-commutative rank is related to stability in invariant theory, non-commutative arithmetic circuits, and Edmonds' problem. We will generalize the non-commutative rank to the representation theory of quivers and define non-commutative Hom and Ext spaces. We will relate these new notions to King's criterion for -stability of quiver representations, and the general Hom and Ext spaces studied by Schofield. We discuss polynomial time algorithms that compute the non-commutative Homs and Exts and find an optimal witness for the -semi-stability of a quiver representation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Complexity and Algorithms in Graphs · Commutative Algebra and Its Applications
