Algorithmic aspects of semistability of quiver representations
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915281113186304 |
|---|---|
| author | Iwamasa, Yuni Oki, Taihei Soma, Tasuku |
| author_facet | Iwamasa, Yuni Oki, Taihei Soma, Tasuku |
| contents | We study the semistability of quiver representations from an algorithmic perspective. We present efficient algorithms for several fundamental computational problems on the semistability of quiver representations: deciding the semistability and $σ$-semistability, finding the maximizers of King's criterion, and computing the Harder--Narasimhan filtration. We also investigate a class of polyhedral cones defined by the linear system in King's criterion, which we refer to as King cones. For rank-one representations, we demonstrate that these King cones can be encoded by submodular flow polytopes, enabling us to decide the $σ$-semistability in strongly polynomial time. Our approach employs submodularity in quiver representations, which may be of independent interest. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_06493 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Algorithmic aspects of semistability of quiver representations Iwamasa, Yuni Oki, Taihei Soma, Tasuku Optimization and Control Discrete Mathematics Data Structures and Algorithms Combinatorics Representation Theory We study the semistability of quiver representations from an algorithmic perspective. We present efficient algorithms for several fundamental computational problems on the semistability of quiver representations: deciding the semistability and $σ$-semistability, finding the maximizers of King's criterion, and computing the Harder--Narasimhan filtration. We also investigate a class of polyhedral cones defined by the linear system in King's criterion, which we refer to as King cones. For rank-one representations, we demonstrate that these King cones can be encoded by submodular flow polytopes, enabling us to decide the $σ$-semistability in strongly polynomial time. Our approach employs submodularity in quiver representations, which may be of independent interest. |
| title | Algorithmic aspects of semistability of quiver representations |
| topic | Optimization and Control Discrete Mathematics Data Structures and Algorithms Combinatorics Representation Theory |
| url | https://arxiv.org/abs/2407.06493 |