Document Open Access Logo

Algorithmic Aspects of Semistability of Quiver Representations

Authors Yuni Iwamasa , Taihei Oki , Tasuku Soma

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.99.pdf
  • Filesize: 0.8 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Computing methodologies → Algebraic algorithms
  • Mathematics of computing → Submodular optimization and polymatroids
Keywords
  • quivers
  • σ-semistability
  • King’s criterion
  • operator scaling
  • submodular flow

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

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.

Cite As Get BibTex

Yuni Iwamasa, Taihei Oki, and Tasuku Soma. Algorithmic Aspects of Semistability of Quiver Representations. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 99:1-99:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.99

Author Details

Yuni Iwamasa
  • Graduate School of Informatics, Kyoto University, Japan
Taihei Oki
  • Institute for Chemical Reaction Design and Discovery (ICReDD), Hokkaido University, Sapporo, Japan
  • Center for Advanced Intelligence Project, RIKEN, Tokyo, Japan
Tasuku Soma
  • The Institute of Statistical Mathematics, Tokyo, Japan
  • Center for Advanced Intelligence Project, RIKEN, Tokyo, Japan

Funding

This work was supported by JSPS KAKENHI Grant Number JP24K21315, Japan.
  • Iwamasa, Yuni: Supported by JSPS KAKENHI Grant Numbers JP22K17854, JP24K02901, Japan.
  • Oki, Taihei: Supported by JST ERATO Grant Number JPMJER1903, JST CREST Grant Number JPMJCR24Q2, JST FOREST Grant Number JPMJFR232L, JSPS KAKENHI Grant Number JP22K17853, and Start-up Research Funds in ICReDD, Hokkaido University.
  • Soma, Tasuku: Supported by JPSP KAKENHI Grant Number JP19K20212 and JST, PRESTO Grant Number JPMJPR24K5, Japan.

Acknowledgements

The authors thank Hiroshi Hirai and Keiya Sakabe for their valuable comments on an earlier version of this paper. The last author thanks Cole Franks for bringing the submodularity of quiver representations to his attention. The authors thank an anonymous reviewer for pointing out the reference [Mulmuley, 2017].

References

  1. Carlos Améndola, Kathlén Kohn, Philipp Reichenbach, and Anna Seigal. Invariant theory and scaling algorithms for maximum likelihood estimation. SIAM Journal on Applied Algebra and Geometry, 5(2):304-337, 2021. URL: https://doi.org/10.1137/20M1328932.
  2. Franck Barthe. On a reverse form of the Brascamp-Lieb inequality. Inventiones Mathematicae, 134(2):335-361, 1998. URL: https://doi.org/10.1007/s002220050267.
  3. Jonathan Bennett, Anthony Carbery, Michael Christ, and Terence Tao. The Brascamp-Lieb inequalities: Finiteness, structure and extremals. Geometric and Functional Analysis, 17(5):1343-1415, 2008. URL: https://doi.org/10.1007/s00039-007-0619-6.
  4. Lieven Le Bruyn and Claudio Procesi. Semisimple representations of quivers. Transactions of the American Mathematical Society, 317(2):585, 1990. URL: https://doi.org/10.2307/2001477.
  5. Peter Burgisser, Cole Franks, Ankit Garg, Rafael Oliveira, Michael Walter, and Avi Wigderson. Efficient algorithms for tensor scaling, quantum marginals, and moment polytopes. In Proceedings of the IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 883-897, 2018. URL: https://doi.org/10.1109/FOCS.2018.00088.
  6. Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Oliveira, Michael Walter, and Avi Wigderson. Towards a theory of non-commutative optimization: Geodesic 1st and 2nd order methods for moment maps and polytopes. In Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 845-861, 2019. URL: https://doi.org/10.1109/FOCS.2019.00055.
  7. Chi-Yu Cheng. A deterministic algorithm for Harder-Narasimhan filtrations for representations of acyclic quivers. Algebra & Number Theory, 18(2):319-347, 2024. URL: https://doi.org/10.2140/ant.2024.18.319.
  8. Calin Chindris, Brett Collins, and Daniel Kline. Membership in moment cones and quiver semi-invariants for bipartite quivers. arXiv, 2022. Google Scholar
  9. Calin Chindris and Harm Derksen. The capacity of quiver representations and Brascamp-Lieb constants. International Mathematics Research Notices, 2022(24):19399-19430, 2021. URL: https://doi.org/10.1093/imrn/rnab064.
  10. Calin Chindris and Jasim Ismaeel. A quiver invariant theoretic approach to radial isotropy and the paulsen problem for matrix frames. SIAM Journal on Applied Algebra and Geometry, 6(4):536-562, 2022. URL: https://doi.org/10.1137/21M141470X.
  11. Calin Chindris and Daniel Kline. Simultaneous robust subspace recovery and semi-stability of quiver representations. Journal of Algebra, 577:210-236, 2021. URL: https://doi.org/10.1016/j.jalgebra.2021.03.005.
  12. P. M. Cohn. Skew Fields: Theory of General Division Rings. Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1995. Google Scholar
  13. Harm Derksen and Visu Makam. Polynomial degree bounds for matrix semi-invariants. Advances in Mathematics, 310:44-63, 2017. URL: https://doi.org/10.1016/j.aim.2017.01.018.
  14. Harm Derksen and Jerzy Weyman. An Introduction to Quiver Representations, volume 184. American Mathematical Soc., 2017. Google Scholar
  15. Marc Fortin and Christophe Reutenauer. Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank. Séminaire Lotharingien de Combinatoire [electronic only], 52:B52f-12, 2004. Google Scholar
  16. András Frank. Finding feasible vectors of Edmonds-Giles polyhedra. Journal of Combinatorial Theory, Series B, 36(3):221-239, 1984. URL: https://doi.org/10.1016/0095-8956(84)90029-7.
  17. Cole Franks. Operator scaling with specified marginals. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 190-203, 2018. URL: https://doi.org/10.1145/3188745.3188932.
  18. Cole Franks and Visu Makam. iPCA and stability of star quivers. arXiv, 2023. URL: https://doi.org/10.48550/arXiv.2302.09658.
  19. Cole Franks, Tasuku Soma, and Michel X Goemans. Shrunk subspaces via operator sinkhorn iteration. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1655-1668, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH62.
  20. William Cole Franks and Ankur Moitra. Rigorous guarantees for Tyler’s M-estimator via quantum expansion. In Proceedings of the 33rd Conference on Learning Theory (COLT), volume 125, pages 1601-1632. PMLR, 2020. URL: http://proceedings.mlr.press/v125/franks20a.html.
  21. Satoru Fujishige. Theory of Principal Partitions Revisited, pages 127-162. Springer Berlin Heidelberg, 2009. URL: https://doi.org/10.1007/978-3-540-76796-1_7.
  22. David Gale. A theorem on flows in networks. Pacific Journal of Mathematics, 7(2):1073-1082, 1957. Google Scholar
  23. Ankit Garg, Leonid Gurvits, Rafael Oliveira, and Avi Wigderson. Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling. Geometric and Functional Analysis, 28(1):100-145, 2018. URL: https://doi.org/10.1007/s00039-018-0434-2.
  24. Ankit Garg, Leonid Gurvits, Rafael Oliveira, and Avi Wigderson. Operator scaling: Theory and applications. Foundations of Computational Mathematics, 2019. URL: https://doi.org/10.1007/s10208-019-09417-z.
  25. Leonid Gurvits. Classical complexity and quantum entanglement. Journal of Computer and System Sciences, 69(3):448-484, 2004. URL: https://doi.org/10.1016/j.jcss.2004.06.003.
  26. Masaki Hamada and Hiroshi Hirai. Computing the nc-rank via discrete convex optimization on CAT(0) spaces. SIAM Journal on Applied Algebra and Geometry, 5(3):455-478, 2021. URL: https://doi.org/10.1137/20M138836X.
  27. G Harder and M S Narasimhan. On the cohomology groups of moduli spaces of vector bundles on curves. Mathematische Annalen, 212(3):215-248, 1975. Google Scholar
  28. Lutz Hille and José Antonio de la Peña. Stable representations of quivers. Journal of Pure and Applied Algebra, 172(2):205-224, 2002. URL: https://doi.org/10.1016/S0022-4049(01)00167-0.
  29. Hiroshi Hirai and Keiya Sakabe. Gradient descent for unbounded convex functions on hadamard manifolds and its applications to scaling problems. In Proceedings of the IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pages 2387-2402, 2024. URL: https://doi.org/10.1109/FOCS61266.2024.00139.
  30. Alana Huszar. Non-commutative rank and semi-stability of quiver representations. arXiv, 2021. URL: https://doi.org/10.48550/arXiv.2111.00039.
  31. Gábor Ivanyos, Youming Qiao, and K V Subrahmanyam. Constructive non-commutative rank computation is in deterministic polynomial time. Computational Complexity, 27(4):561-593, 2018. URL: https://doi.org/10.1007/s00037-018-0165-7.
  32. Alastair D King. Moduli of representations of finite dimensional algebras. The Quarterly Journal of Mathematics, 45(4):515-530, 1994. Google Scholar
  33. Bernhard Korte and Jens Vygen. Combinatorial Optimization: Theory and Algorithms. Springer-Verlag, Berlin, 6 edition, 2018. URL: https://doi.org/10.1007/978-3-662-56039-6.
  34. László Lovász. Singular spaces of matrices and their application in combinatorics. Bulletin of the Brazilian Mathematical Society, 20:87-99, 1989. Google Scholar
  35. Ketan Mulmuley. Geometric complexity theory V: Efficient algorithms for Noether normalization. Journal of the American Mathematical Society, 30(1):225-309, 2017. Google Scholar
  36. Ran Raz and Amir Shpilka. Deterministic polynomial identity testing in non-commutative models. Computational Complexity, 14(1):1-19, 2005. URL: https://doi.org/10.1007/s00037-005-0188-8.
  37. Michèle Vergne and Michael Walter. Moment cone membership for quivers in strongly polynomial time. arXiv, 2023. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact