source: git/kernel/syz.h @ 1f637e

fieker-DuValspielwiese
Last change on this file since 1f637e was 1f637e, checked in by Oleksandr Motsak <motsak@…>, 13 years ago
FIX: replaced pVariables by currRing->N... ADD: added 'void rChangeCurrRing(ring r);' to polys/polys.h CHG: started changing gr_kstd2.cc and syz*.cc
  • Property mode set to 100644
File size: 5.0 KB
Line 
1#ifndef SYZ_H
2#define SYZ_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id$ */
7/*
8* ABSTRACT: Resolutions
9*/
10#include <kernel/structs.h>
11#include <polys/monomials/ring.h>
12#include <kernel/ideals.h>
13
14// Logarithm of estimate of maximal number of new components
15#define SYZ_SHIFT_MAX_NEW_COMP_ESTIMATE 8
16// Logarithm of "distance" between a new component and prev component
17#define SYZ_SHIFT_BASE_LOG (BIT_SIZEOF_LONG - 1 - SYZ_SHIFT_MAX_NEW_COMP_ESTIMATE)
18#define SYZ_SHIFT_BASE (((long)1) << SYZ_SHIFT_BASE_LOG)
19struct sSObject{
20                 poly  p;
21                 poly  p1,p2; /*- the pair p comes from -*/
22                 poly  lcm;   /*- the lcm of p1,p2 -*/
23                 poly  syz;   /*- the syzygy associated to p1,p2 -*/
24                 int   ind1,ind2; /*- the indeces of p1,p2 -*/
25                 poly  isNotMinimal;
26                 int   syzind;
27                 int   order;
28                 int   length;
29                 int   reference;
30               };
31typedef struct sSObject SObject;
32typedef SObject * SSet;
33typedef SSet * SRes;
34
35class ssyStrategy;
36typedef ssyStrategy * syStrategy;
37class ssyStrategy{
38  public:
39  int ** truecomponents;
40  long** ShiftedComponents;
41  int ** backcomponents;
42  int ** Howmuch;
43  int ** Firstelem;
44  int ** elemLength;
45  intvec ** weights;
46  intvec ** hilb_coeffs;
47  resolvente res;              //polynomial data for internal use only
48  resolvente orderedRes;       //polynomial data for internal use only
49  SRes resPairs;               //polynomial data for internal use only
50  intvec * Tl;
51  intvec * resolution;
52  intvec * cw;
53  intvec * betti;
54  kBucket_pt bucket;
55  kBucket_pt syz_bucket;
56  ring syRing;
57  resolvente fullres;
58  resolvente minres;
59  unsigned long ** sev;
60  int length;
61  int regularity;
62  short list_length;
63  short references;
64};
65
66void sySchreyersSyzygiesM(polyset F,int Fmax,polyset* Shdl,int* Smax,
67   BOOLEAN noSort);
68
69void sySchreyersSyzygiesB(polyset F,int Fmax,polyset* Shdl,int* Smax,
70   BOOLEAN noSort);
71
72resolvente sySchreyerResolvente(ideal arg, int maxlength, int * length,
73   BOOLEAN isMonomial=FALSE, BOOLEAN notReplace=FALSE);
74
75syStrategy sySchreyer(ideal arg, int maxlength);
76
77resolvente syResolvente(ideal arg, int maxlength, int * length,
78                        intvec *** weights, BOOLEAN minim);
79
80syStrategy syResolution(ideal arg, int maxlength,intvec * w, BOOLEAN minim);
81
82void syMinimizeResolvente(resolvente res, int length, int first);
83
84intvec * syBetti(resolvente res,int length, int * regularity,
85         intvec* weights=NULL,BOOLEAN tomin=TRUE, int * row_shift=NULL);
86
87ideal syMinBase(ideal arg);
88
89BOOLEAN syTestOrder(ideal i);
90
91void syReOrderResolventFB(resolvente res,int length, int initial=1);
92
93resolvente syLaScala1(ideal arg,int * length);
94syStrategy syLaScala3(ideal arg,int * length);
95
96syStrategy syLaScala(ideal arg, int& maxlength, intvec* weights = NULL);
97
98syStrategy syHilb(ideal arg,int * length);
99syStrategy syKosz(ideal arg,int * length);
100
101void syKillComputation(syStrategy syzstr, ring r=currRing);
102intvec * syBettiOfComputation(syStrategy syzstr, BOOLEAN minim=TRUE,int * row_shift=NULL, intvec *weights=NULL);
103BOOLEAN syBetti1(leftv res, leftv u);
104BOOLEAN syBetti2(leftv res, leftv u, leftv w);
105int sySize(syStrategy syzstr);
106int syDim(syStrategy syzstr);
107syStrategy syCopy(syStrategy syzstr);
108void syPrint(syStrategy syzstr);
109
110// lists syConvRes(syStrategy syzstr,BOOLEAN toDel=FALSE,int add_row_shift=0); // TODO: move to Singular/
111// syStrategy syConvList(lists li,BOOLEAN toDel=FALSE); // TODO: move to Singular/
112// syStrategy syForceMin(lists li); // TODO: move to Singular/
113
114syStrategy syMinimize(syStrategy syzstr);
115void syKillEmptyEntres(resolvente res,int length);
116
117extern int *  currcomponents;
118extern long *  currShiftedComponents;
119
120void syDeletePair(SObject * so);
121void syInitializePair(SObject * so);
122void syCopyPair(SObject * argso, SObject * imso);
123void syCompactifyPairSet(SSet sPairs, int sPlength, int first);
124void syCompactify1(SSet sPairs, int* sPlength, int first);
125SRes syInitRes(ideal arg,int * length, intvec * Tl, intvec * cw=NULL);
126void syResetShiftedComponents(syStrategy syzstr, int index,int hilb=0);
127void syEnlargeFields(syStrategy syzstr,int index);
128void syEnterPair(syStrategy syzstr, SObject * so, int * sPlength,int index);
129SSet syChosePairs(syStrategy syzstr, int *index, int *howmuch, int * actdeg);
130int syInitSyzMod(syStrategy syzstr, int index, int init=17);
131long syReorderShiftedComponents(long * sc, int n);
132void syGaussForOne(ideal arg,int gen,int ModComp,int from=-1,int till=0);
133void syEnterPair(SSet sPairs, SObject * so, int * sPlength,int index);
134void syEnterPair(syStrategy syzstr, SObject * so, int * sPlength,int index);
135syStrategy syKosz(ideal arg,int * length);
136
137resolvente syReorder(resolvente res,int length,
138        syStrategy syzstr,BOOLEAN toCopy=TRUE,resolvente totake=NULL);
139resolvente syReorder(resolvente res,int length,
140        syStrategy syzstr,BOOLEAN toCopy/*=TRUE*/,resolvente totake/*=NULL*/);
141
142#endif
Note: See TracBrowser for help on using the repository browser.