]>
Book Contents Previous Section 9.30 GeneralSparseTable Next Section 9.32 Heap Book Index

## 9.31 GroebnerFactorizationPackage

Solving systems of polynomial equations with the Gröbner basis algorithm can often be very time consuming because, in general, the algorithm has exponential run-time. These systems, which often come from concrete applications, frequently have symmetries which are not taken advantage of by the algorithm. However, it often happens in this case that the polynomials which occur during the Gröbner calculations are reducible. Since Axiom has an excellent polynomial factorization algorithm, it is very natural to combine the Gröbner and factorization algorithms.

GroebnerFactorizationPackage exports the groebnerFactorize groebnerFactorize GroebnerFactorizationPackage operation which implements a modified Gröbner basis algorithm. In this algorithm, each polynomial that is to be put into the partial list of the basis is first factored. The remaining calculation is split into as many parts as there are irreducible factors. Call these factors p 1,…,p n. In the branches corresponding to p 2,…,p n, the factor p 1 can be divided out, and so on. This package also contains operations that allow you to specify the polynomials that are not zero on the common roots of the final Gröbner basis.

Here is an example from chemistry. In a theoretical model of cyclohexane, C 6 H 12, the six carbon atoms each sit in the center of gravity of a tetrahedron that has two hydrogen atoms and two carbon atoms at its corners. We first normalize and set the length of each edge to 1. Hence, the distances of one fixed carbon atom to each of its immediate neighbours is 1. We will denote the distances to the other three carbon atoms by x, y and z.

A. Dress developed a theory to decide whether a set of points and distances between them can be realized in an n-dimensional space. Here, of course, we have n=3.

mfzn : SQMATRIX(6,DMP([x,y,z],Fraction INT)) := [ [0,1,1,1,1,1], [1,0,1,8/3,x,8/3], [1,1,0,1,8/3,y], [1,8/3,1,0,1,8/3], [1,x,8/3,1,0,1], [1,8/3,y,8/3,1,0] ]

[0 1 1 1 1 1 1 0 1 8 3 x 8 3 1 1 0 1 8 3 y 1 8 3 1 0 1 8 3 1 x 8 3 1 0 1 1 8 3 y 8 3 1 0]

Type: SquareMatrix(6,DistributedMultivariatePolynomial([x,y,z],Fraction Integer))

For cyclohexane the distances have to satisfy this equation.

eq := determinant mfzn

-x 2 y 2+22 3 x 2 y-25 9 x 2+22 3 x y 2-388 9 x y-250 27 x-25 9 y 2-250 27 y+14575 81

Type: DistributedMultivariatePolynomial([x,y,z],Fraction Integer)

They also must satisfy the equations given by cyclic shifts of the indeterminates.

groebnerFactorize [eq, eval(eq, [x,y,z], [y,z,x]), eval(eq, [x,y,z], [z,x,y])]

[[x y+x z-22 3 x+y z-22 3 y-22 3 z+121 3,x z 2-22 3 x z+25 9 x+y z 2-22 3 y z+25 9 y-22 3 z 2+388 9 z+250 27,y 2 z 2-22 3 y 2 z+25 9 y 2-22 3 y z 2+388 9 y z+250 27 y+25 9 z 2+250 27 z-14575 81],[x+y-21994 5625,y 2-21994 5625 y+4427 675,z-463 87],[x 2-1 2 x z-11 2 x-5 6 z+265 18,y-z,z 2-38 3 z+265 9],[x-25 9,y-11 3,z-11 3],[x-11 3,y-11 3,z-11 3],[x+5 3,y+5 3,z+5 3],[x-19 3,y+5 3,z+5 3]]

Type: List List DistributedMultivariatePolynomial([x,y,z],Fraction Integer)

The union of the solutions of this list is the solution of our original problem. If we impose positivity conditions, we get two relevant ideals. One ideal is zero-dimensional, namely x=y=z=11/3, and this determines the ``boat'' form of cyclohexane. The other ideal is one-dimensional, which means that we have a solution space given by one parameter. This gives the ``chair'' form of cyclohexane. The parameter describes the angle of the ``back of the chair.''

groebnerFactorize groebnerFactorize GroebnerFactorizationPackage has an optional Boolean-valued second argument. When it is true partial results are displayed, since it may happen that the calculation does not terminate in a reasonable time. See the source code for GroebnerFactorizationPackage in groebf.input for more details about the algorithms used.

Book Contents Previous Section 9.30 GeneralSparseTable Next Section 9.32 Heap Book Index