Skip to main content
Clarified according to two comments; added 25 characters in body
Source Link
Christian Stump
  • 3.3k
  • 1
  • 20
  • 29

We would like to decomposehave a quiverfinite dimensional representation into its irreducible componentsof a finite quiver over, say, the rationals. Is there an algorithm known to do thatdecompose this representation into its irreducible components?

A related question: we have two (finite-dimensional) representations of a finite quiver. Is there a wayan algorithm to check if one is a summand of the other?

Thanks a lot for hints and pointers!

We would like to decompose a quiver representation into its irreducible components. Is there an algorithm known to do that?

A related question: we have two representations of a quiver. Is there a way to check if one is a summand of the other?

Thanks a lot!

We have a finite dimensional representation of a finite quiver over, say, the rationals. Is there an algorithm known to decompose this representation into its irreducible components?

A related question: we have two (finite-dimensional) representations of a finite quiver. Is there an algorithm to check if one is a summand of the other?

Thanks a lot for hints and pointers!

Source Link
Christian Stump
  • 3.3k
  • 1
  • 20
  • 29

Is there an algorithm known to decompose quiver representation?

We would like to decompose a quiver representation into its irreducible components. Is there an algorithm known to do that?

A related question: we have two representations of a quiver. Is there a way to check if one is a summand of the other?

Thanks a lot!