Some algorithms for semi-invariants of quivers
D. A. Shmelkin
TL;DR
This paper introduces new theorems and algorithms for computing semi-invariants of quivers, along with a software implementation to facilitate their practical use.
Contribution
It provides novel algorithms and a software tool for calculating semi-invariants and decompositions of quivers, advancing computational methods in representation theory.
Findings
Algorithms for perpendicular categories and semi-simple decompositions
Implementation of the TETIVA software for practical computations
Accessible tool for researchers in quiver theory
Abstract
We present some theorems and algorithms for calculating perpendicular categories and locally semi-simple decompositions. We implemented a computer program {\sc TETIVA} based on these algorithms and we offer this program for everybody's use.
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 · Homotopy and Cohomology in Algebraic Topology · Commutative Algebra and Its Applications