Timeline for Is there an algorithm known to decompose quiver representation?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 12, 2017 at 14:10 | comment | added | Mare | The GAP package QPA ( math.ntnu.no/~oyvinso/QPA) can actually do this (decomposition into indecomposables and testing isomorphism) for finite fields at the moment and it is planned to extent this to finite field extensions over Q. | |
| Nov 13, 2015 at 10:11 | vote | accept | Christian Stump | ||
| Aug 6, 2012 at 22:14 | answer | added | Joshua Grochow | timeline score: 8 | |
| Feb 11, 2012 at 11:20 | comment | added | Christian Stump | Thanks for the comments. I was thinking of the case where everything is finite and we are in characteristic 0. | |
| Feb 11, 2012 at 11:18 | history | edited | Christian Stump | CC BY-SA 3.0 |
Clarified according to two comments; added 25 characters in body
|
| Feb 10, 2012 at 19:34 | comment | added | Bruce Westbury | The first question is ambiguous. Do you want to find to find the composition facors of a representation or the decomposition into indecomposables. In any case, if you are working with finite dimensional representations over a field then the answer to all these questions is: Yes, an algorithm exists. | |
| Feb 10, 2012 at 17:28 | comment | added | Florian Eisele | Well, unless you make some restriction on the shape of the quiver, the term "quiver representation" is just as general as "representation of an associative algebra". If you work over a finite field, your quiver is finite (resp. your algebra is finitely generated) and your modules are of finite dimension, then MAGMA can do a lot of those computations (e.g. indecomposable direct summands, composition series, isomorphism checking...). | |
| Feb 10, 2012 at 15:06 | history | asked | Christian Stump | CC BY-SA 3.0 |