A deterministic Algorithm for Harder-Narasimhan filtrations for representations of acyclic quivers
From MaRDI portal
Publication:6154492
Abstract: Let be a representation of an acyclic quiver over an infinite field . We establish a deterministic algorithm for computing the Harder-Narasimhan filtration of . The algorithm is polynomial in the dimensions of , the weights that induce the Harder-Narasimhan filtration of , and the number of paths in . As a direct application, we also show that when is algebraically closed and when is unstable, the same algorithm produces Kempf's maximally destabilizing one parameter subgroups for .
Cites work
- Constructive non-commutative rank computation is in deterministic polynomial time
- Generalized Wong sequences and their applications to Edmonds' problems
- Geometric Invariant Theory
- Instability in invariant theory
- MODULI OF REPRESENTATIONS OF FINITE DIMENSIONAL ALGEBRAS
- On the Harder-Narasimhan filtration for finite dimensional representations of quivers
- Simultaneous robust subspace recovery and semi-stability of quiver representations
- Stable representations of quivers.
- Stratifications associated to reductive group actions on affine spaces
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)