Changeset 839b04d in git for Singular/LIB/finvar.lib

Timestamp:

Aug 4, 1997, 4:46:51 PM (26 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'a719bcf0b8dbc648b128303a49777a094b57592c')

Children:

2d18815165593b7beda491c982a1f635a1b4048e

Parents:

bb0968599ad062a86ceb2420fea0c6cac6244052

Message:

* hannes: moved rad_con from finvar.lib/prim_dec.lib to poly.lib
          removed lcm from prim_dec.lib (also in primdec.lib)


git-svn-id: file:///usr/local/Singular/svn/trunk@598 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/finvar.lib (modified) (4 diffs)

Singular/LIB/finvar.lib

@@ -1 @@
-// $Header: /exports/cvsroot-2/cvsroot/Singular/LIB/finvar.lib,v 1.2 1997-07-03 15:49:54 Singular Exp $
+// $Header: /exports/cvsroot-2/cvsroot/Singular/LIB/finvar.lib,v 1.3 1997-08-04 14:46:49 Singular Exp $
 ////////////////////////////////////////////////////////////////////////////////
 // send bugs and comments to agnes@math.uni-sb.de
@@ -10 +10 @@
   part_mol(M,n[,p]);             n terms of partial expansion of Molien series M
   eval_rey(RO,p);                evaluate poly p under Reynolds operator RO
-  rad_con(p,I);                  check radical containment of poly p in ideal I
   inv_basis(deg,G1,G2,...);      basis of space of homogeneous invariants of
                                  degree deg under the finite matrix group
@@ -40 +39 @@
 LIB "elim.lib";
 LIB "general.lib";
+LIB "poly.lib";
 ////////////////////////////////////////////////////////////////////////////////
 
@@ -681 +681 @@
 
 ////////////////////////////////////////////////////////////////////////////////
-// Input: <ideal>=<f1,f2,...,fm> and <polynomial> g
-// Question: Does g lie in the radical of <ideal>?
-// Solution: Compute a standard basis G for <f1,f2,...,fm,gz-1> where z is a new
-//           variable. Then g is contained in the radical of <ideal> <=> 1 is
-//           generator in G.
-////////////////////////////////////////////////////////////////////////////////
-proc rad_con (poly g,ideal I)
-  USAGE:   rad_con(<poly>,<ideal>);
-  RETURNS: 1 (TRUE) (type <int>) if <poly> is contained in the radical of
-           <ideal>, 0 (FALSE) (type <int>) otherwise
-  EXAMPLE: example rad_con; shows an example
-{ def br=basering;
-  int n=nvars(br);
-  int dB=degBound;
-  degBound=0;
-  string mp=string(minpoly);
-  execute "ring R=("+charstr(br)+"),(x(1..n),z),dp;";
-  execute "minpoly=number("+mp+");";
-  ideal irrel=x(1..n);
-  map f=br,irrel;
-  poly p=f(g);
-  ideal J=f(I)+ideal(p*z-1);
-  J=std(J);
-  degBound=dB;
-  if (J[1]==1)
-  { return(1);
-  }
-  else
-  { return(0);
-  }
-}
-example
-{ "  EXAMPLE: Sturmfels: Algorithms in Invariant Theory 2.3.7.";
-  echo=2;
-           ring R=0,(x,y,z),dp;
-           ideal I=x2+y2,z2;
-           poly f=x4+y4;
-           rad_con(f,I);
-           ideal J=x2+y2,z2,x4+y4;
-           poly g=z;
-           rad_con(g,I);
-}
-
-////////////////////////////////////////////////////////////////////////////////
 // This procedure generates a basis of invariant polynomials in degree g. The
 // way this works, is that we look how the generators act on a general