Next: Bibliography
Up: On strategies and implementations
Previous: 3.4 The algorithm of
Here I would like to propose a variant of the algorithm for global
(quasi)homomogeneous ideals or modules realizing the ideas of the
Sections 3.2 and 3.3. The main question is,
whether the usage of Hilbert functions yields better restrictions to
the pair sets than the regularity does. This will (hopefully) be
answered in the near future by programming it in SINGULAR.
INPUT:
generators of the given ideal,
OUTPUT:
the resolution of F,


(F',Syz_{F})=computeFirstSyzygies(F)


S'=resolve(In(F'))


hilb_{.}=computeHilbertFunctions(S')


L=buildPairs(Syz_{F})

 i=1

 WHILE (
)

 h=0 //the Hilbert function of the actual module S_{i}




deg=deg_{min}

 WHILE (
isNotComplete(h,hilb_{i}))


G=reduce(L',deg,hilb_{i},h)


L'=buildPairs(G)


h=computeHilbertFunction(G)

 WHILE (
isNotComplete(h,hilb_{i},deg))




h=computeHilbertFunction(G)


checkForDirectReductions(L,S_{i1},deg,hilb_{i})


deletePairs(L,deg)

 deg=deg+1

 S_{i}=G

 L=L'

 i=i+1
The main content of the above procedures is
Next: Bibliography
Up: On strategies and implementations
Previous: 3.4 The algorithm of
 ZCA Home 
Reports 