Re: Symbolic computations with NONcommutative variables
From: Maarten Bergvelt (bergv_at_math.uiuc.edu)
Date: 07/23/04
- Next message: Dave Rusin: "Re: High Precision Approximate GCD"
- Previous message: Anika: "help needed badly"
- In reply to: Alex: "Symbolic computations with NONcommutative variables"
- Messages sorted by: [ date ] [ thread ]
Date: Fri, 23 Jul 2004 18:47:34 +0000 (UTC)
In article <p4telalrqfr2@legacy>, Alex wrote:
> Can somebody recommend me the computer program,
> which can do things like that:
> let p,q be such: [p,q]=1
> compute [p^2,q]
>
> (We are assuming tha multiplication of p,q is associative and
> distributive, but NONcommutative)
>
> More precisely we have [p_i,q_j]=\delta_{ij}
> and we need to check whether
> [F(p,q),G(p,q)]=0, for some given F,G.
Try Macaulay, which has facilities for calculations with Weyl algebras.
See:
http://www.math.uiuc.edu/Macaulay2/
-- Maarten Bergvelt
- Next message: Dave Rusin: "Re: High Precision Approximate GCD"
- Previous message: Anika: "help needed badly"
- In reply to: Alex: "Symbolic computations with NONcommutative variables"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
