[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

RE: [Axiom-math] How to make symbolic computations?

From: Fabio Stumbo
Subject: RE: [Axiom-math] How to make symbolic computations?
Date: Mon, 3 Apr 2006 13:24:22 +0200 (CEST)

Hi all,
I am back again to ask for some help on symbolic computation.
The setting was:

I would like to build the non-commutative algebra h=k[x,y] and
then I would like to make computations in h using some predefined
rules for x and y. As an example, take the three equations


where a and b are (generic, if possible) elements of k.

Then, I would like to be able to reduce polynomials in x and
y according to the previous rules. For example,

(x+y)^2 (=x^2+x*y+y*x+y^2)

should reduce to





should reduce to


Look at the example at:


I made many computations and I am quite satisfied with the results.
I had no difficult to modify the functions defined on the wiki page to change the settings (variable number, minimal polinomial). About this, I have just a couple of simple questions:

1) Is it possible to define the functions so that the number of variable is itself a variable and the function generates "on the fly" the required variables (all with the same minimal polinomial)? I am meaning the following: instead of
I would like to define
so that t is a polinomial in the variables x_1,...,x_n the relations are, for example, x_i^2=ax_i+b for each i. So, we should generate the array of the variables, then an array with all the relations and then we should try div for each relation in this last array...

I am asking this beacuse I had to make may examples changing the number of variables and I had to rewrite the same file each time with minor (and uniform) changes.

2) Is it possible to get rid of all the declarations ::V in p1:=(x::V+y::V)$H^2 ?

I want to add a remark: as noted on the wiki, the reduction should be carried over as many time as possible, so I use the auxiliary function

reduce(p:H):H ==
 p2 := newpoly(p)
 p3 := newpoly(p2)
 while p3 ~= p2 repeat
  p2 := p3
  p3 := newpoly(p2)

Now, if you try to reduce the successive powers of x+y, the functions slows down very quicly and you can't go further than (x+y)^10 or little more. In this particular case, it is much more efficient to do it in the following way:

power(q:H,n:INT):H ==
  for i in 1..n repeat

This way, I have no difficulties in calculating (x+y)^100 or even much more. Is there another way to obtain this same efficency?

All of this is, anyway, simply a matter of making working better what already is done.
I also have another problem, more important to me.

The above setting is:

with relations


I would like to write the element
of H like a polinomial in u=x+y

In mathematics, if I is the ideal
I=(xyx-yxy,xx-ax-b,yy-ay-b) and L=H/I,
then I would like to see if s belongs to the subring L[u].

I guess that one way should be to use Groebner basis, but H is noncommutative. Is there a noncommutative groebner basis package in axiom?

In any case, it is not exactly this: I do not want to see if s belongs to I, but I want to write it as a polynomial in u.

Thank you and best regards


reply via email to

[Prev in Thread] Current Thread [Next in Thread]