Changeset 51d95b in git for Singular/LIB/ainvar.lib
- Timestamp:
- Feb 2, 2001, 5:34:03 PM (23 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- d6e3b1afb0e8520e0ecd6884a887b9e5dfad7c0a
- Parents:
- d0b24aa6b76ceff1814449a910b055491387ea33
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/ainvar.lib
rd0b24a r51d95b 1 // $Id: ainvar.lib,v 1. 5 2001-01-16 13:48:21 SingularExp $1 // $Id: ainvar.lib,v 1.6 2001-02-02 16:32:32 mschulze Exp $ 2 2 ///////////////////////////////////////////////////////////////////////////// 3 version="$Id: ainvar.lib,v 1. 5 2001-01-16 13:48:21 SingularExp $";3 version="$Id: ainvar.lib,v 1.6 2001-02-02 16:32:32 mschulze Exp $"; 4 4 category="Invariant theory"; 5 5 info=" 6 6 LIBRARY: ainvar.lib Invariant Rings of the Additive Group 7 AUTHORS: Gerhard Pfister , email: pfister@mathematik.uni-kl.de8 Gert-Martin Greuel , email: greuel@mathematik.uni-kl.de7 AUTHORS: Gerhard Pfister (email: pfister@mathematik.uni-kl.de), 8 Gert-Martin Greuel (email: greuel@mathematik.uni-kl.de) 9 9 10 10 PROCEDURES: … … 334 334 h must be a ring variable 335 335 RETURN: a polynomial, the invariant polynomial of the vectorfield 336 m = m[1,1]*d/dx(1) +...+ m[n,1]*d/dx(n) 336 @format 337 m = m[1,1]*d/dx(1) +...+ m[n,1]*d/dx(n) 338 @end format 337 339 with respect to p,q,h. It is defined as follows: set inv = p if p is 338 340 invariant, and else as … … 399 401 RETURN: list of two ideals, the first ideal contains further invariants of 400 402 the vectorfield 401 m = sum m[i,1]*d/dx(i) with respect to id,p,q, 403 @format 404 m = sum m[i,1]*d/dx(i) with respect to id,p,q, 405 @end format 402 406 i.e. we compute elements in the (invariant) subring generated by id 403 407 which are divisible by q and divde them by q as much as possible … … 496 500 RETURN: ideal, containing generators of the ring of invariants of the 497 501 additive gropup (K,+) given by the vectorfield 498 m = m[1,1]*d/dx(1) +...+ m[n,1]*d/dx(n). 502 @format 503 m = m[1,1]*d/dx(1) +...+ m[n,1]*d/dx(n). 504 @end format 499 505 If b>0 the computation stops after all invariants of degree <= b 500 506 (and at least one of higher degree) are found or when all invariants
Note: See TracChangeset
for help on using the changeset viewer.