A deterministic Algorithm for Harder-Narasimhan filtrations for representations of acyclic quivers

From MaRDI portal
Publication:6154492

DOI10.2140/ANT.2024.18.319arXiv2111.06428OpenAlexW4391567096WikidataQ128534321 ScholiaQ128534321MaRDI QIDQ6154492FDOQ6154492


Authors: Chi-yu Cheng Edit this on Wikidata


Publication date: 15 February 2024

Published in: Algebra \& Number Theory (Search for Journal in Brave)

Abstract: Let M be a representation of an acyclic quiver Q over an infinite field k. We establish a deterministic algorithm for computing the Harder-Narasimhan filtration of M. The algorithm is polynomial in the dimensions of M, the weights that induce the Harder-Narasimhan filtration of M, and the number of paths in Q. As a direct application, we also show that when k is algebraically closed and when M is unstable, the same algorithm produces Kempf's maximally destabilizing one parameter subgroups for M.


Full work available at URL: https://arxiv.org/abs/2111.06428







Cites Work


Cited In (1)





This page was built for publication: A deterministic Algorithm for Harder-Narasimhan filtrations for representations of acyclic quivers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154492)