I'm interested in doing computations with certain non-commutative rings, most of which involve taking derived tensor products. Does anyone know of a computer algebra package which will find projective resolutions of complexes of modules over a finite-dimensional non-commutative ring, tensor with a bimodule, and do it all over again?
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
7
1
|
|
|
|
|
5
|
I don't know whether Magma can handle all you ask for, but if I remember my coding for Magma correctly, at least the projective resolutions of modules over a non-commutative ring should be covered by that - for nice enough non-commutative rings. It's all been developed there as part of Jon F. Carlson's work on computing group cohomology rings. If there is a system that does all you ask for, and does it efficiently, it is probably been written in connection to a group cohomology computation effort - which narrows the candidates down significantly: Magma and GAP do group cohomology rings, and SAGE now with the work of Simon King and David Green. In contrast, I'm reasonably certain that Macaulay only does commutative things, and Singular doesn't have resolutions as a naturally occuring object at all. Bergman might be able to deal with what you ask for, though. To conclude: I'd recommend you to take a look at the homological algebra modules in Magma, GAP, SAGE and Bergman - I'd be highly surprised to see any other packages deal with the case you describe, and I'm not entirely convinced either of these do it well either. |
|||
|
You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.
|
0
|
Which non-commutative rings are you interested in? Tensor product over non-commutative rings is computationally a delicate issue, since the resulting module is in general only an Abelian group, which is very often infinitely generated. So could you please be more specific. |
|||
|

