source: git/Singular/ideals.h @ 8d1bbc

fieker-DuValspielwiese
Last change on this file since 8d1bbc was c98410, checked in by Mathias Schulze <mschulze@…>, 22 years ago
*mschulze: division with 3 args git-svn-id: file:///usr/local/Singular/svn/trunk@5964 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 4.5 KB
Line 
1#ifndef IDEALS_H
2#define IDEALS_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id: ideals.h,v 1.38 2002-03-07 18:32:10 mschulze Exp $ */
7/*
8* ABSTRACT - all basic methods to manipulate ideals
9*/
10#include "structs.h"
11
12#ifdef PDEBUG
13ideal idDBInit (int size, int rank, char *f, int l);
14#define idInit(A,B) idDBInit(A,B,__FILE__,__LINE__)
15#else
16/*- creates an ideal -*/
17ideal idInit (int size, int rank=1);
18#endif
19/*- deletes an ideal -*/
20#define idDelete(h) id_Delete(h, currRing)
21void id_Delete (ideal* h, ring r);
22void id_ShallowDelete (ideal* h, ring r);
23/* Shows an ideal -- mainly for debugging */
24void idShow(ideal id);
25  /*- initialise an ideal -*/
26ideal idMaxIdeal (int deg);
27  /*- initialise the maximal ideal (at 0) -*/
28void idSkipZeroes (ideal ide);
29  /*gives an ideal the minimal possible size*/
30void idNorm(ideal id);
31void idDelMultiples(ideal id);
32void idDelEquals(ideal id);
33void idDelLmEquals(ideal id);
34void idDelDiv(ideal id);
35BOOLEAN idIsConstant(ideal id);
36
37#ifdef PDEBUG
38void idDBTest(ideal h1, int level, char *f,int l);
39#define idTest(A) idDBTest(A, PDEBUG, __FILE__,__LINE__)
40#define idPrint(id) idShow(id)
41#else
42#define idTest(A)  (TRUE)
43#define idPrint(A) ((void)0)
44#endif
45
46#ifdef PDEBUG
47ideal idDBCopy(ideal h1,char *f,int l);
48#define idCopy(A) idDBCopy(A,__FILE__,__LINE__)
49#else
50ideal idCopy (ideal h1);
51#endif
52  /*adds two ideals without simplifying the result*/
53ideal idSimpleAdd (ideal h1,ideal h2);
54  /*adds the quotient ideal*/
55ideal idAdd (ideal h1,ideal h2);
56  /* h1 + h2 */
57ideal idMult (ideal h1,ideal h2);
58  /*hh := h1 * h2*/
59
60BOOLEAN idIs0 (ideal h);
61
62long idRankFreeModule(ideal m, ring lmRing, ring tailRing);
63inline long idRankFreeModule(ideal m, ring r = currRing)
64{return idRankFreeModule(m, r, r);}
65// returns TRUE, if idRankFreeModule(m) > 0
66BOOLEAN idIsModule(ideal m, ring r = currRing);
67BOOLEAN idHomIdeal (ideal id, ideal Q=NULL);
68BOOLEAN idHomModule(ideal m, ideal Q,intvec **w);
69
70ideal idMinBase (ideal h1);
71  /*returns a minimized set of generators of h1*/
72int pLowVar (poly p);
73  /*-the minimal index of used variables - 1-*/
74ideal idDehomogen (ideal id1,poly p,number n);
75  /*dehomogenized the generators of the ideal id1 with the leading
76  monomial of p replaced by n*/
77void pShift (poly * p,int i);
78  /*- verschiebt die Indizes der Modulerzeugenden um i -*/
79void    idInitChoise (int r,int beg,int end,BOOLEAN *endch,int * choise);
80void    idGetNextChoise (int r,int end,BOOLEAN *endch,int * choise);
81int     idGetNumberOfChoise(int t, int d, int begin, int end, int * choise);
82
83int     binom (int n,int r);
84
85ideal   idFreeModule (int i);
86
87ideal   idSect (ideal h1,ideal h2);
88ideal   idMultSect(resolvente arg, int length);
89
90//ideal   idSyzygies (ideal h1, tHomog h,intvec **w);
91ideal   idSyzygies (ideal h1, tHomog h,intvec **w, BOOLEAN setSyzComp=TRUE,
92                    BOOLEAN setRegularity=FALSE, int *deg = NULL);
93ideal   idLiftStd  (ideal h1, matrix *m, tHomog h=testHomog);
94
95ideal   idLift (ideal mod, ideal sumod,ideal * rest=NULL,
96             BOOLEAN goodShape=FALSE, BOOLEAN isSB=TRUE,BOOLEAN divide=FALSE,
97             matrix *unit=NULL);
98
99lists idLiftW(ideal P,ideal Q,int n,short *w=NULL);
100
101intvec * idMWLift(ideal mod,intvec * weights);
102
103ideal   idQuot (ideal h1,ideal h2,
104                BOOLEAN h1IsStb=FALSE, BOOLEAN resultIsIdeal=FALSE);
105
106ideal   idPower(ideal gid,int deg);
107
108//ideal   idElimination (ideal h1,poly delVar);
109ideal   idElimination (ideal h1,poly delVar, intvec *hilb=NULL);
110
111ideal   idMinors(matrix a, int ar, ideal R=NULL);
112
113ideal   idCompactify(ideal id);
114
115ideal idMinEmbedding(ideal arg,BOOLEAN inPlace=FALSE);
116
117ideal   idHead(ideal h);
118
119ideal   idHomogen(ideal h, int varnum);
120
121BOOLEAN idIsSubModule(ideal id1,ideal id2);
122
123ideal   idVec2Ideal(poly vec);
124
125ideal   idMatrix2Module(matrix mat);
126
127matrix  idModule2Matrix(ideal mod);
128
129matrix  idModule2formatedMatrix(ideal mod,int rows, int cols);
130
131ideal   idSubst(ideal i, int n, poly e);
132
133ideal   idJet(ideal i,int d);
134ideal   idJetW(ideal i,int d, intvec * iv);
135int idMinDeg(ideal M,intvec *w=NULL);
136ideal   idSeries(int n,ideal M,matrix U=NULL,intvec *w=NULL);
137
138BOOLEAN idIsZeroDim(ideal i);
139matrix  idDiff(matrix i, int k);
140matrix  idDiffOp(ideal I, ideal J,BOOLEAN multiply=TRUE);
141
142intvec *idSort(ideal id,BOOLEAN nolex=TRUE);
143ideal   idModulo (ideal h1,ideal h2);
144int     idElem(ideal F);
145matrix  idCoeffOfKBase(ideal arg, ideal kbase, poly how);
146ideal   idTransp(ideal a);
147
148intvec *idQHomWeight(ideal id);
149
150void    idNormalize(ideal id);
151
152ideal idXXX (ideal  h1, int k);
153#endif
Note: See TracBrowser for help on using the repository browser.