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

From MaRDI portal
Publication:6154492




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.









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)