Changeset b9b906 in git for Singular/LIB/zeroset.lib

Timestamp:

Jan 16, 2001, 2:48:47 PM (23 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

081d28e7da33af82545a27eb9f8ee82b0884b9f0

Parents:

4e3468f1f6473297e317588e34a7719e241780f9

Message:

*hannes: lib format revisited


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

File:

• Singular/LIB/zeroset.lib (modified) (6 diffs)

Singular/LIB/zeroset.lib

@@ -2 +2 @@
 ///////////////////////////////////////////////////////////////////////////////
 
-version="$Id: zeroset.lib,v 1.5 2000-12-22 15:59:36 greuel Exp $";
+version="$Id: zeroset.lib,v 1.6 2001-01-16 13:48:47 Singular Exp $";
 category="Symbolic-numerical solving";
 info="
@@ -10 +10 @@
           Current Adress: Institut fuer Informatik, TU Muenchen
 
-OVERVIEW: 
+OVERVIEW:
  Algorithms for finding the zero-set of a zero-dim. ideal in Q(a)[x_1,..x_n],
  Roots and Factorization of univariate polynomials over Q(a)[t]
- where a is an algebric number. Written in the frame of the 
- diploma thesis (advisor: Prof. Gert-Martin Greuel) 'Computations of moduli 
+ where a is an algebric number. Written in the frame of the
+ diploma thesis (advisor: Prof. Gert-Martin Greuel) 'Computations of moduli
  spaces of semiquasihomogenous singularities and an implementation in Singular'
  This library is meant as a preliminary extension of the functionality
@@ -169 +169 @@
 RETURN:  list, all entries are polynomials
          _[1] = roots of f, each entry is a polynomial
-         _[2] = 'newA'  - if the groundfield is Q(a') and the extension field 
+         _[2] = 'newA'  - if the groundfield is Q(a') and the extension field
                 is Q(a), then 'newA' is the representation of a' in Q(a)
          _[3] = minpoly of the algebraic extension of the groundfield
@@ -321 +321 @@
 OPTIONS: opt = 0 no primary decomposition (default)
          opt > 0 primary decomposition
-NOTE:    If I contains an algebraic number (parameter) then 'I' must be 
+NOTE:    If I contains an algebraic number (parameter) then 'I' must be
          transformed w.r.t. 'newA' in the new ring.
 EXAMPLE: example ZeroSet; shows an example
@@ -708 +708 @@
          _[2] = g (= f(x - s*a)) (poly)
          _[3] = s (int)
-ASSUME:  f must be squarefree, basering = Q[x,a] and ideal 'mpoly' is equal to 
+ASSUME:  f must be squarefree, basering = Q[x,a] and ideal 'mpoly' is equal to
          'minpoly',this represents the ring Q(a)[x] together with 'minpoly'.
 NOTE:   the norm is an element of Q[x]
@@ -757 +757 @@
          _[1] = factors (monic), first entry is the leading coefficient
          _[2] = multiplicities (not yet)
-ASSUME:  basering must be the univariate polynomial ring over a field which 
+ASSUME:  basering must be the univariate polynomial ring over a field which
          is Q or a simple extension of Q given by a minpoly.
 NOTE:    if basering = Q[t] then this is the built-in 'factorize'.