example: d1
description: TITLE : a sparse system, known as benchmark D1
REFERENCES :
H. Hong and V. Stahl: `Safe Starting Regions by Fixed Points and Tightening', Computing 53(3-4): 322-335, 1995.
Faugere J.C. A new efficient algorithm for computing Grobner Basis (F4). Technical report, Task 3.3.2.1 Frisco report, 1997. preprint.
Jan Verschelde. Homotopy Continuation Methods for solving Polynomial Systems. PhD thesis, Katholike Univ. Leuven, May 1996.
NOTE :
The system is deficient w.r.t. the face normals
(1,1,0,0, 0,0,0,0, 0,0,0,0) (0,0,1,1, 1,1,1,1, 0,0,0,0) (0,0,2,2, 2,2,2,2, -2,0,1,1) (0,0,2,2, 2,2,0,0, -2,0,1,1) (0,0,2,2, 0,0,2,2, -2,0,1,1) (0,0,0,0, 2,2,2,2, -2,0,1,1)
system: Polynomial
variables: x1 > x2 > x3 > x4 > x5 > x6 > x7 > x8 > x9 > x10 > x11 > x12
equations: 0 1 2 3 4 5 6 7 8 9 10 11
length of Janet-like basis: 104
length of Janet basis: 104
length of Gröbner basis 86
Hilbert polynomial: 48
Strategy: degJ highJ lowJ degJL highJL lowJL


examples