[35aab3] | 1 | /**************************************** |
---|
| 2 | * Computer Algebra System SINGULAR * |
---|
| 3 | ****************************************/ |
---|
[5b02a5] | 4 | /* $Id: ideals.cc,v 1.19 2006-04-06 12:42:56 Singular Exp $ */ |
---|
[35aab3] | 5 | /* |
---|
| 6 | * ABSTRACT - all basic methods to manipulate ideals |
---|
| 7 | */ |
---|
| 8 | |
---|
| 9 | /* includes */ |
---|
| 10 | #include "mod2.h" |
---|
| 11 | #include "structs.h" |
---|
| 12 | #include "omalloc.h" |
---|
| 13 | #include "febase.h" |
---|
| 14 | #include "numbers.h" |
---|
| 15 | #include "polys.h" |
---|
| 16 | #include "ring.h" |
---|
| 17 | #include "kstd1.h" |
---|
| 18 | #include "matpol.h" |
---|
| 19 | #include "weight.h" |
---|
| 20 | #include "intvec.h" |
---|
| 21 | #include "syz.h" |
---|
| 22 | #include "sparsmat.h" |
---|
| 23 | #include "ideals.h" |
---|
| 24 | #include "prCopy.h" |
---|
| 25 | |
---|
| 26 | |
---|
| 27 | /* #define WITH_OLD_MINOR */ |
---|
| 28 | #define pCopy_noCheck(p) pCopy(p) |
---|
| 29 | |
---|
| 30 | static poly * idpower; |
---|
| 31 | /*collects the monomials in makemonoms, must be allocated befor*/ |
---|
| 32 | static int idpowerpoint; |
---|
| 33 | /*index of the actual monomial in idpower*/ |
---|
| 34 | static poly * givenideal; |
---|
| 35 | /*the ideal from which a power is computed*/ |
---|
| 36 | |
---|
| 37 | /*0 implementation*/ |
---|
| 38 | |
---|
| 39 | /*2 |
---|
| 40 | * initialise an ideal |
---|
| 41 | */ |
---|
| 42 | #ifdef PDEBUG |
---|
| 43 | ideal idDBInit(int idsize, int rank, char *f, int l) |
---|
| 44 | #else |
---|
| 45 | ideal idInit(int idsize, int rank) |
---|
| 46 | #endif |
---|
| 47 | { |
---|
| 48 | /*- initialise an ideal -*/ |
---|
| 49 | ideal hh = (ideal )omAllocBin(sip_sideal_bin); |
---|
| 50 | hh->nrows = 1; |
---|
| 51 | hh->rank = rank; |
---|
| 52 | IDELEMS(hh) = idsize; |
---|
| 53 | if (idsize>0) |
---|
| 54 | { |
---|
| 55 | hh->m = (poly *)omAlloc0(idsize*sizeof(poly)); |
---|
| 56 | } |
---|
| 57 | else |
---|
| 58 | hh->m=NULL; |
---|
| 59 | return hh; |
---|
| 60 | } |
---|
| 61 | |
---|
| 62 | //#ifndef __OPTIMIZE__ |
---|
| 63 | // this is mainly for outputting an ideal within the debugger |
---|
| 64 | void idShow(ideal id) |
---|
| 65 | { |
---|
| 66 | Print("Module of rank %d,real rank %d and %d generators.\n", |
---|
| 67 | id->rank,idRankFreeModule(id),IDELEMS(id)); |
---|
| 68 | for (int i=0;i<id->ncols*id->nrows;i++) |
---|
| 69 | { |
---|
| 70 | if (id->m[i]!=NULL) |
---|
| 71 | { |
---|
| 72 | Print("generator %d: ",i);pWrite(id->m[i]); |
---|
| 73 | } |
---|
| 74 | } |
---|
| 75 | } |
---|
| 76 | //#endif |
---|
| 77 | |
---|
| 78 | /*2 |
---|
| 79 | * initialise the maximal ideal (at 0) |
---|
| 80 | */ |
---|
| 81 | ideal idMaxIdeal (void) |
---|
| 82 | { |
---|
| 83 | int l; |
---|
| 84 | ideal hh=NULL; |
---|
| 85 | |
---|
| 86 | hh=idInit(pVariables,1); |
---|
| 87 | for (l=0; l<pVariables; l++) |
---|
| 88 | { |
---|
| 89 | hh->m[l] = pOne(); |
---|
| 90 | pSetExp(hh->m[l],l+1,1); |
---|
| 91 | pSetm(hh->m[l]); |
---|
| 92 | } |
---|
| 93 | return hh; |
---|
| 94 | } |
---|
| 95 | |
---|
| 96 | /*2 |
---|
| 97 | * deletes an ideal/matrix |
---|
| 98 | */ |
---|
| 99 | void id_Delete (ideal * h, ring r) |
---|
| 100 | { |
---|
| 101 | int j,elems; |
---|
| 102 | if (*h == NULL) |
---|
| 103 | return; |
---|
| 104 | elems=j=(*h)->nrows*(*h)->ncols; |
---|
| 105 | if (j>0) |
---|
| 106 | { |
---|
| 107 | do |
---|
| 108 | { |
---|
| 109 | p_Delete(&((*h)->m[--j]), r); |
---|
| 110 | } |
---|
| 111 | while (j>0); |
---|
| 112 | omFreeSize((ADDRESS)((*h)->m),sizeof(poly)*elems); |
---|
| 113 | } |
---|
| 114 | omFreeBin((ADDRESS)*h, sip_sideal_bin); |
---|
| 115 | *h=NULL; |
---|
| 116 | } |
---|
| 117 | |
---|
| 118 | |
---|
| 119 | /*2 |
---|
| 120 | * Shallowdeletes an ideal/matrix |
---|
| 121 | */ |
---|
| 122 | void id_ShallowDelete (ideal *h, ring r) |
---|
| 123 | { |
---|
| 124 | int j,elems; |
---|
| 125 | if (*h == NULL) |
---|
| 126 | return; |
---|
| 127 | elems=j=(*h)->nrows*(*h)->ncols; |
---|
| 128 | if (j>0) |
---|
| 129 | { |
---|
| 130 | do |
---|
| 131 | { |
---|
| 132 | p_ShallowDelete(&((*h)->m[--j]), r); |
---|
| 133 | } |
---|
| 134 | while (j>0); |
---|
| 135 | omFreeSize((ADDRESS)((*h)->m),sizeof(poly)*elems); |
---|
| 136 | } |
---|
| 137 | omFreeBin((ADDRESS)*h, sip_sideal_bin); |
---|
| 138 | *h=NULL; |
---|
| 139 | } |
---|
| 140 | |
---|
| 141 | /*2 |
---|
| 142 | *gives an ideal the minimal possible size |
---|
| 143 | */ |
---|
| 144 | void idSkipZeroes (ideal ide) |
---|
| 145 | { |
---|
| 146 | int k; |
---|
| 147 | int j = -1; |
---|
| 148 | BOOLEAN change=FALSE; |
---|
| 149 | for (k=0; k<IDELEMS(ide); k++) |
---|
| 150 | { |
---|
| 151 | if (ide->m[k] != NULL) |
---|
| 152 | { |
---|
| 153 | j++; |
---|
| 154 | if (change) |
---|
| 155 | { |
---|
| 156 | ide->m[j] = ide->m[k]; |
---|
| 157 | } |
---|
| 158 | } |
---|
| 159 | else |
---|
| 160 | { |
---|
| 161 | change=TRUE; |
---|
| 162 | } |
---|
| 163 | } |
---|
| 164 | if (change) |
---|
| 165 | { |
---|
| 166 | if (j == -1) |
---|
| 167 | j = 0; |
---|
| 168 | else |
---|
| 169 | { |
---|
| 170 | for (k=j+1; k<IDELEMS(ide); k++) |
---|
| 171 | ide->m[k] = NULL; |
---|
| 172 | } |
---|
| 173 | pEnlargeSet(&(ide->m),IDELEMS(ide),j+1-IDELEMS(ide)); |
---|
| 174 | IDELEMS(ide) = j+1; |
---|
| 175 | } |
---|
| 176 | } |
---|
| 177 | |
---|
| 178 | /*2 |
---|
| 179 | * ideal id = (id[i]) |
---|
| 180 | * result is leadcoeff(id[i]) = 1 |
---|
| 181 | */ |
---|
| 182 | void idNorm(ideal id) |
---|
| 183 | { |
---|
| 184 | for (int i=0; i<IDELEMS(id); i++) |
---|
| 185 | { |
---|
| 186 | if (id->m[i] != NULL) |
---|
| 187 | { |
---|
| 188 | pNorm(id->m[i]); |
---|
| 189 | } |
---|
| 190 | } |
---|
| 191 | } |
---|
| 192 | |
---|
| 193 | /*2 |
---|
| 194 | * ideal id = (id[i]), c any number |
---|
| 195 | * if id[i] = c*id[j] then id[j] is deleted for j > i |
---|
| 196 | */ |
---|
| 197 | void idDelMultiples(ideal id) |
---|
| 198 | { |
---|
| 199 | int i, j, t; |
---|
| 200 | int k = IDELEMS(id), l = k; |
---|
| 201 | for (i=k-2; i>=0; i--) |
---|
| 202 | { |
---|
| 203 | if (id->m[i]!=NULL) |
---|
| 204 | { |
---|
| 205 | for (j=l-1; j>i; j--) |
---|
| 206 | { |
---|
| 207 | if ((id->m[j]!=NULL) |
---|
| 208 | && (pComparePolys(id->m[i], id->m[j]))) |
---|
| 209 | { |
---|
| 210 | pDelete(&id->m[j]); |
---|
| 211 | l--; |
---|
| 212 | for(t=j; t<l; t++) |
---|
| 213 | { |
---|
| 214 | id->m[t] = id->m[t+1]; |
---|
| 215 | } |
---|
| 216 | } |
---|
| 217 | } |
---|
| 218 | } |
---|
| 219 | } |
---|
| 220 | if (l != k) |
---|
| 221 | { |
---|
| 222 | pEnlargeSet(&id->m, k, l-k); |
---|
| 223 | IDELEMS(id) = l; |
---|
| 224 | } |
---|
| 225 | } |
---|
| 226 | |
---|
| 227 | /*2 |
---|
| 228 | * ideal id = (id[i]) |
---|
| 229 | * if id[i] = id[j] then id[j] is deleted for j > i |
---|
| 230 | */ |
---|
| 231 | void idDelEquals(ideal id) |
---|
| 232 | { |
---|
| 233 | int i, j, t; |
---|
| 234 | int k = IDELEMS(id), l = k; |
---|
| 235 | for (i=k-2; i>=0; i--) |
---|
| 236 | { |
---|
| 237 | for (j=l-1; j>i; j--) |
---|
| 238 | { |
---|
| 239 | if (pEqualPolys(id->m[i], id->m[j])) |
---|
| 240 | { |
---|
| 241 | pDelete(&id->m[j]); |
---|
| 242 | l--; |
---|
| 243 | for(t=j; t<l; t++) |
---|
| 244 | { |
---|
| 245 | id->m[t] = id->m[t+1]; |
---|
| 246 | } |
---|
| 247 | } |
---|
| 248 | } |
---|
| 249 | } |
---|
| 250 | if (l != k) |
---|
| 251 | { |
---|
| 252 | pEnlargeSet(&id->m, k, l-k); |
---|
| 253 | IDELEMS(id) = l; |
---|
| 254 | } |
---|
| 255 | } |
---|
| 256 | |
---|
| 257 | // |
---|
| 258 | // Delete id[j], if Lm(j) == Lm(i) and j > i |
---|
| 259 | // |
---|
| 260 | void idDelLmEquals(ideal id) |
---|
| 261 | { |
---|
| 262 | int i, j, t; |
---|
| 263 | int k = IDELEMS(id), l = k; |
---|
| 264 | for (i=k-2; i>=0; i--) |
---|
| 265 | { |
---|
| 266 | for (j=l-1; j>i; j--) |
---|
| 267 | { |
---|
| 268 | if (id->m[i] != NULL && id->m[j] != NULL && pLmEqual(id->m[i], id->m[j])) |
---|
| 269 | { |
---|
| 270 | pDelete(&id->m[j]); |
---|
| 271 | l--; |
---|
| 272 | for(t=j; t<l; t++) |
---|
| 273 | { |
---|
| 274 | id->m[t] = id->m[t+1]; |
---|
| 275 | } |
---|
| 276 | } |
---|
| 277 | } |
---|
| 278 | } |
---|
| 279 | if (l != k) |
---|
| 280 | { |
---|
| 281 | pEnlargeSet(&id->m, k, l-k); |
---|
| 282 | IDELEMS(id) = l; |
---|
| 283 | } |
---|
| 284 | } |
---|
| 285 | |
---|
| 286 | void idDelDiv(ideal id) |
---|
| 287 | { |
---|
| 288 | int i, j, t; |
---|
| 289 | int k = IDELEMS(id), l = k; |
---|
| 290 | for (i=k-2; i>=0; i--) |
---|
| 291 | { |
---|
| 292 | for (j=l-1; j>i; j--) |
---|
| 293 | { |
---|
| 294 | |
---|
| 295 | if (((id->m[j] != NULL) && pDivisibleBy(id->m[i], id->m[j])) || |
---|
| 296 | (id->m[i] == NULL && id->m[j] == NULL)) |
---|
| 297 | { |
---|
| 298 | pDelete(&id->m[j]); |
---|
| 299 | l--; |
---|
| 300 | for(t=j; t<l; t++) |
---|
| 301 | { |
---|
| 302 | id->m[t] = id->m[t+1]; |
---|
| 303 | } |
---|
| 304 | } |
---|
| 305 | } |
---|
| 306 | } |
---|
| 307 | if (l != k) |
---|
| 308 | { |
---|
| 309 | pEnlargeSet(&id->m, k, l-k); |
---|
| 310 | IDELEMS(id) = l; |
---|
| 311 | } |
---|
| 312 | } |
---|
| 313 | |
---|
| 314 | /*2 |
---|
| 315 | *test if the ideal has only constant polynomials |
---|
| 316 | */ |
---|
| 317 | BOOLEAN idIsConstant(ideal id) |
---|
| 318 | { |
---|
| 319 | int k; |
---|
| 320 | for (k = IDELEMS(id)-1; k>=0; k--) |
---|
| 321 | { |
---|
| 322 | if (pIsConstantPoly(id->m[k]) == FALSE) |
---|
| 323 | return FALSE; |
---|
| 324 | } |
---|
| 325 | return TRUE; |
---|
| 326 | } |
---|
| 327 | |
---|
| 328 | /*2 |
---|
| 329 | * copy an ideal |
---|
| 330 | */ |
---|
| 331 | #ifdef PDEBUG |
---|
| 332 | ideal idDBCopy(ideal h1,char *f,int l) |
---|
| 333 | { |
---|
| 334 | int i; |
---|
| 335 | ideal h2; |
---|
| 336 | |
---|
| 337 | idDBTest(h1,PDEBUG,f,l); |
---|
| 338 | //#ifdef TEST |
---|
| 339 | if (h1 == NULL) |
---|
| 340 | { |
---|
| 341 | h2=idDBInit(1,1,f,l); |
---|
| 342 | } |
---|
| 343 | else |
---|
| 344 | //#endif |
---|
| 345 | { |
---|
| 346 | h2=idDBInit(IDELEMS(h1),h1->rank,f,l); |
---|
| 347 | for (i=IDELEMS(h1)-1; i>=0; i--) |
---|
| 348 | h2->m[i] = pCopy(h1->m[i]); |
---|
| 349 | } |
---|
| 350 | return h2; |
---|
| 351 | } |
---|
[d523f3] | 352 | #endif |
---|
| 353 | |
---|
| 354 | ideal id_Copy (ideal h1, const ring r) |
---|
| 355 | { |
---|
| 356 | int i; |
---|
| 357 | ideal h2; |
---|
| 358 | |
---|
| 359 | //#ifdef TEST |
---|
| 360 | if (h1 == NULL) |
---|
| 361 | { |
---|
| 362 | h2=idInit(1,1); |
---|
| 363 | } |
---|
| 364 | else |
---|
| 365 | //#endif |
---|
| 366 | { |
---|
| 367 | h2=idInit(IDELEMS(h1),h1->rank); |
---|
| 368 | for (i=IDELEMS(h1)-1; i>=0; i--) |
---|
| 369 | h2->m[i] = p_Copy(h1->m[i],r); |
---|
| 370 | } |
---|
| 371 | return h2; |
---|
| 372 | } |
---|
[35aab3] | 373 | |
---|
| 374 | #ifdef PDEBUG |
---|
| 375 | void idDBTest(ideal h1, int level, char *f,int l) |
---|
| 376 | { |
---|
| 377 | int i; |
---|
| 378 | |
---|
| 379 | if (h1 != NULL) |
---|
| 380 | { |
---|
| 381 | // assume(IDELEMS(h1) > 0); for ideal/module, does not apply to matrix |
---|
| 382 | omCheckAddrSize(h1,sizeof(*h1)); |
---|
| 383 | omdebugAddrSize(h1->m,h1->ncols*h1->nrows*sizeof(poly)); |
---|
| 384 | /* to be able to test matrices: */ |
---|
| 385 | for (i=(h1->ncols*h1->nrows)-1; i>=0; i--) |
---|
| 386 | _p_Test(h1->m[i], currRing, level); |
---|
| 387 | int new_rk=idRankFreeModule(h1); |
---|
| 388 | if(new_rk > h1->rank) |
---|
| 389 | { |
---|
| 390 | dReportError("wrong rank %d (should be %d) in %s:%d\n", |
---|
| 391 | h1->rank, new_rk, f,l); |
---|
| 392 | omPrintAddrInfo(stderr, h1, " for ideal"); |
---|
| 393 | h1->rank=new_rk; |
---|
| 394 | } |
---|
| 395 | } |
---|
| 396 | } |
---|
| 397 | #endif |
---|
| 398 | |
---|
| 399 | /*3 |
---|
| 400 | * for idSort: compare a and b revlex inclusive module comp. |
---|
| 401 | */ |
---|
| 402 | static int pComp_RevLex(poly a, poly b,BOOLEAN nolex) |
---|
| 403 | { |
---|
| 404 | if (b==NULL) return 1; |
---|
| 405 | if (a==NULL) return -1; |
---|
| 406 | |
---|
| 407 | if (nolex) return pLmCmp(a,b); |
---|
| 408 | int l=pVariables; |
---|
| 409 | while ((l>0) && (pGetExp(a,l)==pGetExp(b,l))) l--; |
---|
| 410 | if (l==0) |
---|
| 411 | { |
---|
| 412 | if (pGetComp(a)==pGetComp(b)) return 0; |
---|
| 413 | if (pGetComp(a)>pGetComp(b)) return 1; |
---|
| 414 | } |
---|
| 415 | else if (pGetExp(a,l)>pGetExp(b,l)) |
---|
| 416 | return 1; |
---|
| 417 | return -1; |
---|
| 418 | } |
---|
| 419 | |
---|
| 420 | /*2 |
---|
| 421 | *sorts the ideal w.r.t. the actual ringordering |
---|
| 422 | *uses lex-ordering when nolex = FALSE |
---|
| 423 | */ |
---|
| 424 | intvec *idSort(ideal id,BOOLEAN nolex) |
---|
| 425 | { |
---|
| 426 | poly p,q; |
---|
| 427 | intvec * result = new intvec(IDELEMS(id)); |
---|
| 428 | int i, j, actpos=0, newpos, l; |
---|
| 429 | int diff, olddiff, lastcomp, newcomp; |
---|
| 430 | BOOLEAN notFound; |
---|
| 431 | |
---|
| 432 | for (i=0;i<IDELEMS(id);i++) |
---|
| 433 | { |
---|
| 434 | if (id->m[i]!=NULL) |
---|
| 435 | { |
---|
| 436 | notFound = TRUE; |
---|
| 437 | newpos = actpos / 2; |
---|
| 438 | diff = (actpos+1) / 2; |
---|
| 439 | diff = (diff+1) / 2; |
---|
| 440 | lastcomp = pComp_RevLex(id->m[i],id->m[(*result)[newpos]],nolex); |
---|
| 441 | if (lastcomp<0) |
---|
| 442 | { |
---|
| 443 | newpos -= diff; |
---|
| 444 | } |
---|
| 445 | else if (lastcomp>0) |
---|
| 446 | { |
---|
| 447 | newpos += diff; |
---|
| 448 | } |
---|
| 449 | else |
---|
| 450 | { |
---|
| 451 | notFound = FALSE; |
---|
| 452 | } |
---|
| 453 | //while ((newpos>=0) && (newpos<actpos) && (notFound)) |
---|
| 454 | while (notFound && (newpos>=0) && (newpos<actpos)) |
---|
| 455 | { |
---|
| 456 | newcomp = pComp_RevLex(id->m[i],id->m[(*result)[newpos]],nolex); |
---|
| 457 | olddiff = diff; |
---|
| 458 | if (diff>1) |
---|
| 459 | { |
---|
| 460 | diff = (diff+1) / 2; |
---|
| 461 | if ((newcomp==1) |
---|
| 462 | && (actpos-newpos>1) |
---|
| 463 | && (diff>1) |
---|
| 464 | && (newpos+diff>=actpos)) |
---|
| 465 | { |
---|
| 466 | diff = actpos-newpos-1; |
---|
| 467 | } |
---|
| 468 | else if ((newcomp==-1) |
---|
| 469 | && (diff>1) |
---|
| 470 | && (newpos<diff)) |
---|
| 471 | { |
---|
| 472 | diff = newpos; |
---|
| 473 | } |
---|
| 474 | } |
---|
| 475 | if (newcomp<0) |
---|
| 476 | { |
---|
| 477 | if ((olddiff==1) && (lastcomp>0)) |
---|
| 478 | notFound = FALSE; |
---|
| 479 | else |
---|
| 480 | newpos -= diff; |
---|
| 481 | } |
---|
| 482 | else if (newcomp>0) |
---|
| 483 | { |
---|
| 484 | if ((olddiff==1) && (lastcomp<0)) |
---|
| 485 | { |
---|
| 486 | notFound = FALSE; |
---|
| 487 | newpos++; |
---|
| 488 | } |
---|
| 489 | else |
---|
| 490 | { |
---|
| 491 | newpos += diff; |
---|
| 492 | } |
---|
| 493 | } |
---|
| 494 | else |
---|
| 495 | { |
---|
| 496 | notFound = FALSE; |
---|
| 497 | } |
---|
| 498 | lastcomp = newcomp; |
---|
| 499 | if (diff==0) notFound=FALSE; /*hs*/ |
---|
| 500 | } |
---|
| 501 | if (newpos<0) newpos = 0; |
---|
| 502 | if (newpos>actpos) newpos = actpos; |
---|
| 503 | while ((newpos<actpos) && (pComp_RevLex(id->m[i],id->m[(*result)[newpos]],nolex)==0)) |
---|
| 504 | newpos++; |
---|
| 505 | for (j=actpos;j>newpos;j--) |
---|
| 506 | { |
---|
| 507 | (*result)[j] = (*result)[j-1]; |
---|
| 508 | } |
---|
| 509 | (*result)[newpos] = i; |
---|
| 510 | actpos++; |
---|
| 511 | } |
---|
| 512 | } |
---|
| 513 | for (j=0;j<actpos;j++) (*result)[j]++; |
---|
| 514 | return result; |
---|
| 515 | } |
---|
| 516 | |
---|
| 517 | /*2 |
---|
| 518 | * concat the lists h1 and h2 without zeros |
---|
| 519 | */ |
---|
| 520 | ideal idSimpleAdd (ideal h1,ideal h2) |
---|
| 521 | { |
---|
| 522 | int i,j,r,l; |
---|
| 523 | ideal result; |
---|
| 524 | |
---|
| 525 | if (h1==NULL) return idCopy(h2); |
---|
| 526 | if (h2==NULL) return idCopy(h1); |
---|
| 527 | j = IDELEMS(h1)-1; |
---|
| 528 | while ((j >= 0) && (h1->m[j] == NULL)) j--; |
---|
| 529 | i = IDELEMS(h2)-1; |
---|
| 530 | while ((i >= 0) && (h2->m[i] == NULL)) i--; |
---|
| 531 | r = si_max(h1->rank,h2->rank); |
---|
| 532 | if (i+j==(-2)) |
---|
| 533 | return idInit(1,r); |
---|
| 534 | else |
---|
| 535 | result=idInit(i+j+2,r); |
---|
| 536 | for (l=j; l>=0; l--) |
---|
| 537 | { |
---|
| 538 | result->m[l] = pCopy(h1->m[l]); |
---|
| 539 | } |
---|
| 540 | r = i+j+1; |
---|
| 541 | for (l=i; l>=0; l--, r--) |
---|
| 542 | { |
---|
| 543 | result->m[r] = pCopy(h2->m[l]); |
---|
| 544 | } |
---|
| 545 | return result; |
---|
| 546 | } |
---|
| 547 | |
---|
| 548 | /*2 |
---|
| 549 | * h1 + h2 |
---|
| 550 | */ |
---|
| 551 | ideal idAdd (ideal h1,ideal h2) |
---|
| 552 | { |
---|
| 553 | ideal result = idSimpleAdd(h1,h2); |
---|
| 554 | ideal tmp = idCompactify(result); |
---|
| 555 | |
---|
| 556 | idDelete(&result); |
---|
| 557 | return tmp; |
---|
| 558 | } |
---|
| 559 | |
---|
| 560 | /*2 |
---|
| 561 | * h1 * h2 |
---|
| 562 | */ |
---|
| 563 | ideal idMult (ideal h1,ideal h2) |
---|
| 564 | { |
---|
| 565 | int i,j,k; |
---|
| 566 | ideal hh; |
---|
| 567 | |
---|
| 568 | j = IDELEMS(h1); |
---|
| 569 | while ((j > 0) && (h1->m[j-1] == NULL)) j--; |
---|
| 570 | i = IDELEMS(h2); |
---|
| 571 | while ((i > 0) && (h2->m[i-1] == NULL)) i--; |
---|
| 572 | j = j * i; |
---|
| 573 | if (j == 0) |
---|
| 574 | hh = idInit(1,1); |
---|
| 575 | else |
---|
| 576 | hh=idInit(j,1); |
---|
| 577 | if (h1->rank<h2->rank) |
---|
| 578 | hh->rank = h2->rank; |
---|
| 579 | else |
---|
| 580 | hh->rank = h1->rank; |
---|
| 581 | if (j==0) return hh; |
---|
| 582 | k = 0; |
---|
| 583 | for (i=0; i<IDELEMS(h1); i++) |
---|
| 584 | { |
---|
| 585 | if (h1->m[i] != NULL) |
---|
| 586 | { |
---|
| 587 | for (j=0; j<IDELEMS(h2); j++) |
---|
| 588 | { |
---|
| 589 | if (h2->m[j] != NULL) |
---|
| 590 | { |
---|
| 591 | hh->m[k] = ppMult_qq(h1->m[i],h2->m[j]); |
---|
| 592 | k++; |
---|
| 593 | } |
---|
| 594 | } |
---|
| 595 | } |
---|
| 596 | } |
---|
| 597 | { |
---|
| 598 | ideal tmp = idCompactify(hh); |
---|
| 599 | idDelete(&hh); |
---|
| 600 | return tmp; |
---|
| 601 | //return hh; |
---|
| 602 | } |
---|
| 603 | } |
---|
| 604 | |
---|
| 605 | /*2 |
---|
| 606 | *returns true if h is the zero ideal |
---|
| 607 | */ |
---|
| 608 | BOOLEAN idIs0 (ideal h) |
---|
| 609 | { |
---|
| 610 | int i; |
---|
| 611 | |
---|
| 612 | if (h == NULL) return TRUE; |
---|
| 613 | i = IDELEMS(h); |
---|
| 614 | while ((i > 0) && (h->m[i-1] == NULL)) |
---|
| 615 | { |
---|
| 616 | i--; |
---|
| 617 | } |
---|
| 618 | if (i == 0) |
---|
| 619 | return TRUE; |
---|
| 620 | else |
---|
| 621 | return FALSE; |
---|
| 622 | } |
---|
| 623 | |
---|
| 624 | /*2 |
---|
| 625 | * return the maximal component number found in any polynomial in s |
---|
| 626 | */ |
---|
| 627 | long idRankFreeModule (ideal s, ring lmRing, ring tailRing) |
---|
| 628 | { |
---|
| 629 | if (s!=NULL) |
---|
| 630 | { |
---|
| 631 | int j=0; |
---|
| 632 | |
---|
| 633 | if (rRing_has_Comp(tailRing) && rRing_has_Comp(lmRing)) |
---|
| 634 | { |
---|
| 635 | int l=IDELEMS(s); |
---|
| 636 | poly *p=s->m; |
---|
| 637 | int k; |
---|
| 638 | for (; l != 0; l--) |
---|
| 639 | { |
---|
| 640 | if (*p!=NULL) |
---|
| 641 | { |
---|
| 642 | pp_Test(*p, lmRing, tailRing); |
---|
| 643 | k = p_MaxComp(*p, lmRing, tailRing); |
---|
| 644 | if (k>j) j = k; |
---|
| 645 | } |
---|
| 646 | p++; |
---|
| 647 | } |
---|
| 648 | } |
---|
| 649 | return j; |
---|
| 650 | } |
---|
| 651 | return -1; |
---|
| 652 | } |
---|
| 653 | |
---|
| 654 | BOOLEAN idIsModule(ideal id, ring r) |
---|
| 655 | { |
---|
| 656 | if (id != NULL && rRing_has_Comp(r)) |
---|
| 657 | { |
---|
| 658 | int j, l = IDELEMS(id); |
---|
| 659 | for (j=0; j<l; j++) |
---|
| 660 | { |
---|
| 661 | if (id->m[j] != NULL && p_GetComp(id->m[j], r) > 0) return TRUE; |
---|
| 662 | } |
---|
| 663 | } |
---|
| 664 | return FALSE; |
---|
| 665 | } |
---|
| 666 | |
---|
| 667 | |
---|
| 668 | /*2 |
---|
| 669 | *returns true if id is homogenous with respect to the aktual weights |
---|
| 670 | */ |
---|
| 671 | BOOLEAN idHomIdeal (ideal id, ideal Q) |
---|
| 672 | { |
---|
| 673 | int i; |
---|
| 674 | BOOLEAN b; |
---|
| 675 | if ((id == NULL) || (IDELEMS(id) == 0)) return TRUE; |
---|
| 676 | i = 0; |
---|
| 677 | b = TRUE; |
---|
| 678 | while ((i < IDELEMS(id)) && b) |
---|
| 679 | { |
---|
| 680 | b = pIsHomogeneous(id->m[i]); |
---|
| 681 | i++; |
---|
| 682 | } |
---|
| 683 | if ((b) && (Q!=NULL) && (IDELEMS(Q)>0)) |
---|
| 684 | { |
---|
| 685 | i=0; |
---|
| 686 | while ((i < IDELEMS(Q)) && b) |
---|
| 687 | { |
---|
| 688 | b = pIsHomogeneous(Q->m[i]); |
---|
| 689 | i++; |
---|
| 690 | } |
---|
| 691 | } |
---|
| 692 | return b; |
---|
| 693 | } |
---|
| 694 | |
---|
| 695 | /*2 |
---|
| 696 | *returns a minimized set of generators of h1 |
---|
| 697 | */ |
---|
| 698 | ideal idMinBase (ideal h1) |
---|
| 699 | { |
---|
| 700 | ideal h2, h3,h4,e; |
---|
| 701 | int j,k; |
---|
| 702 | int i,l,ll; |
---|
| 703 | intvec * wth; |
---|
| 704 | BOOLEAN homog; |
---|
| 705 | |
---|
| 706 | homog = idHomModule(h1,currQuotient,&wth); |
---|
| 707 | if ((currRing->OrdSgn == 1) && (!homog)) |
---|
| 708 | { |
---|
| 709 | Warn("minbase applies only to the local or homogeneous case"); |
---|
| 710 | e=idCopy(h1); |
---|
| 711 | return e; |
---|
| 712 | } |
---|
| 713 | if ((currRing->OrdSgn == 1) && (homog)) |
---|
| 714 | { |
---|
| 715 | ideal re=kMin_std(h1,currQuotient,(tHomog)homog,&wth,h2,NULL,0,3); |
---|
| 716 | idDelete(&re); |
---|
| 717 | return h2; |
---|
| 718 | } |
---|
| 719 | e=idInit(1,h1->rank); |
---|
| 720 | if (idIs0(h1)) |
---|
| 721 | { |
---|
| 722 | return e; |
---|
| 723 | } |
---|
| 724 | pEnlargeSet(&(e->m),IDELEMS(e),15); |
---|
| 725 | IDELEMS(e) = 16; |
---|
| 726 | h2 = kStd(h1,currQuotient,isNotHomog,NULL); |
---|
| 727 | h3 = idMaxIdeal(); |
---|
| 728 | h4=idMult(h2,h3); |
---|
| 729 | idDelete(&h3); |
---|
| 730 | h3=kStd(h4,currQuotient,isNotHomog,NULL); |
---|
| 731 | k = IDELEMS(h3); |
---|
| 732 | while ((k > 0) && (h3->m[k-1] == NULL)) k--; |
---|
| 733 | j = -1; |
---|
| 734 | l = IDELEMS(h2); |
---|
| 735 | while ((l > 0) && (h2->m[l-1] == NULL)) l--; |
---|
| 736 | for (i=l-1; i>=0; i--) |
---|
| 737 | { |
---|
| 738 | if (h2->m[i] != NULL) |
---|
| 739 | { |
---|
| 740 | ll = 0; |
---|
| 741 | while ((ll < k) && ((h3->m[ll] == NULL) |
---|
| 742 | || !pDivisibleBy(h3->m[ll],h2->m[i]))) |
---|
| 743 | ll++; |
---|
| 744 | if (ll >= k) |
---|
| 745 | { |
---|
| 746 | j++; |
---|
| 747 | if (j > IDELEMS(e)-1) |
---|
| 748 | { |
---|
| 749 | pEnlargeSet(&(e->m),IDELEMS(e),16); |
---|
| 750 | IDELEMS(e) += 16; |
---|
| 751 | } |
---|
| 752 | e->m[j] = pCopy(h2->m[i]); |
---|
| 753 | } |
---|
| 754 | } |
---|
| 755 | } |
---|
| 756 | idDelete(&h2); |
---|
| 757 | idDelete(&h3); |
---|
| 758 | idDelete(&h4); |
---|
| 759 | if (currQuotient!=NULL) |
---|
| 760 | { |
---|
| 761 | h3=idInit(1,e->rank); |
---|
| 762 | h2=kNF(h3,currQuotient,e); |
---|
| 763 | idDelete(&h3); |
---|
| 764 | idDelete(&e); |
---|
| 765 | e=h2; |
---|
| 766 | } |
---|
| 767 | idSkipZeroes(e); |
---|
| 768 | return e; |
---|
| 769 | } |
---|
| 770 | |
---|
| 771 | /*2 |
---|
| 772 | *the minimal index of used variables - 1 |
---|
| 773 | */ |
---|
| 774 | int pLowVar (poly p) |
---|
| 775 | { |
---|
| 776 | int k,l,lex; |
---|
| 777 | |
---|
| 778 | if (p == NULL) return -1; |
---|
| 779 | |
---|
| 780 | k = 32000;/*a very large dummy value*/ |
---|
| 781 | while (p != NULL) |
---|
| 782 | { |
---|
| 783 | l = 1; |
---|
| 784 | lex = pGetExp(p,l); |
---|
| 785 | while ((l < pVariables) && (lex == 0)) |
---|
| 786 | { |
---|
| 787 | l++; |
---|
| 788 | lex = pGetExp(p,l); |
---|
| 789 | } |
---|
| 790 | l--; |
---|
| 791 | if (l < k) k = l; |
---|
| 792 | pIter(p); |
---|
| 793 | } |
---|
| 794 | return k; |
---|
| 795 | } |
---|
| 796 | |
---|
| 797 | /*3 |
---|
| 798 | *multiplies p with t (!cas) or (t-1) |
---|
| 799 | *the index of t is:1, so we have to shift all variables |
---|
| 800 | *p is NOT in the actual ring, it has no t |
---|
| 801 | */ |
---|
| 802 | static poly pMultWithT (poly p,BOOLEAN cas) |
---|
| 803 | { |
---|
| 804 | /*qp is the working pointer in p*/ |
---|
| 805 | /*result is the result, qresult is the working pointer*/ |
---|
| 806 | /*pp is p in the actual ring(shifted), qpp the working pointer*/ |
---|
| 807 | poly result,qp,pp; |
---|
| 808 | poly qresult=NULL; |
---|
| 809 | poly qpp=NULL; |
---|
| 810 | int i,j,lex; |
---|
| 811 | number n; |
---|
| 812 | |
---|
| 813 | pp = NULL; |
---|
| 814 | result = NULL; |
---|
| 815 | qp = p; |
---|
| 816 | while (qp != NULL) |
---|
| 817 | { |
---|
| 818 | i = 0; |
---|
| 819 | if (result == NULL) |
---|
| 820 | {/*first monomial*/ |
---|
| 821 | result = pInit(); |
---|
| 822 | qresult = result; |
---|
| 823 | } |
---|
| 824 | else |
---|
| 825 | { |
---|
| 826 | qresult->next = pInit(); |
---|
| 827 | pIter(qresult); |
---|
| 828 | } |
---|
| 829 | for (j=pVariables-1; j>0; j--) |
---|
| 830 | { |
---|
| 831 | lex = pGetExp(qp,j); |
---|
| 832 | pSetExp(qresult,j+1,lex);/*copy all variables*/ |
---|
| 833 | } |
---|
| 834 | lex = pGetComp(qp); |
---|
| 835 | pSetComp(qresult,lex); |
---|
| 836 | n=nCopy(pGetCoeff(qp)); |
---|
| 837 | pSetCoeff0(qresult,n); |
---|
| 838 | qresult->next = NULL; |
---|
| 839 | pSetm(qresult); |
---|
| 840 | /*qresult is now qp brought into the actual ring*/ |
---|
| 841 | if (cas) |
---|
| 842 | { /*case: mult with t-1*/ |
---|
| 843 | pSetExp(qresult,1,0); |
---|
| 844 | pSetm(qresult); |
---|
| 845 | if (pp == NULL) |
---|
| 846 | { /*first monomial*/ |
---|
| 847 | pp = pCopy(qresult); |
---|
| 848 | qpp = pp; |
---|
| 849 | } |
---|
| 850 | else |
---|
| 851 | { |
---|
| 852 | qpp->next = pCopy(qresult); |
---|
| 853 | pIter(qpp); |
---|
| 854 | } |
---|
| 855 | pGetCoeff(qpp)=nNeg(pGetCoeff(qpp)); |
---|
| 856 | /*now qpp contains -1*qp*/ |
---|
| 857 | } |
---|
| 858 | pSetExp(qresult,1,1);/*this is mult. by t*/ |
---|
| 859 | pSetm(qresult); |
---|
| 860 | pIter(qp); |
---|
| 861 | } |
---|
| 862 | /* |
---|
| 863 | *now p is processed: |
---|
| 864 | *result contains t*p |
---|
| 865 | * if cas: pp contains -1*p (in the new ring) |
---|
| 866 | */ |
---|
| 867 | if (cas) qresult->next = pp; |
---|
| 868 | /* else qresult->next = NULL;*/ |
---|
| 869 | return result; |
---|
| 870 | } |
---|
| 871 | |
---|
| 872 | /*2 |
---|
| 873 | *dehomogenized the generators of the ideal id1 with the leading |
---|
| 874 | *monomial of p replaced by n |
---|
| 875 | */ |
---|
| 876 | ideal idDehomogen (ideal id1,poly p,number n) |
---|
| 877 | { |
---|
| 878 | int i; |
---|
| 879 | ideal result; |
---|
| 880 | |
---|
| 881 | if (idIs0(id1)) |
---|
| 882 | { |
---|
| 883 | return idInit(1,id1->rank); |
---|
| 884 | } |
---|
| 885 | result=idInit(IDELEMS(id1),id1->rank); |
---|
| 886 | for (i=0; i<IDELEMS(id1); i++) |
---|
| 887 | { |
---|
| 888 | result->m[i] = pDehomogen(id1->m[i],p,n); |
---|
| 889 | } |
---|
| 890 | return result; |
---|
| 891 | } |
---|
| 892 | |
---|
| 893 | /*2 |
---|
| 894 | * verschiebt die Indizees der Modulerzeugenden um i |
---|
| 895 | */ |
---|
| 896 | void pShift (poly * p,int i) |
---|
| 897 | { |
---|
| 898 | poly qp1 = *p,qp2 = *p;/*working pointers*/ |
---|
| 899 | int j = pMaxComp(*p),k = pMinComp(*p); |
---|
| 900 | |
---|
| 901 | if (j+i < 0) return ; |
---|
| 902 | while (qp1 != NULL) |
---|
| 903 | { |
---|
| 904 | if ((pGetComp(qp1)+i > 0) || ((j == -i) && (j == k))) |
---|
| 905 | { |
---|
| 906 | pSetComp(qp1,pGetComp(qp1)+i); |
---|
| 907 | pSetmComp(qp1); |
---|
| 908 | qp2 = qp1; |
---|
| 909 | pIter(qp1); |
---|
| 910 | } |
---|
| 911 | else |
---|
| 912 | { |
---|
| 913 | if (qp2 == *p) |
---|
| 914 | { |
---|
| 915 | pIter(*p); |
---|
| 916 | pDeleteLm(&qp2); |
---|
| 917 | qp2 = *p; |
---|
| 918 | qp1 = *p; |
---|
| 919 | } |
---|
| 920 | else |
---|
| 921 | { |
---|
| 922 | qp2->next = qp1->next; |
---|
| 923 | pDeleteLm(&qp1); |
---|
| 924 | qp1 = qp2->next; |
---|
| 925 | } |
---|
| 926 | } |
---|
| 927 | } |
---|
| 928 | } |
---|
| 929 | |
---|
| 930 | /*2 |
---|
| 931 | *initialized a field with r numbers between beg and end for the |
---|
| 932 | *procedure idNextChoise |
---|
| 933 | */ |
---|
| 934 | void idInitChoise (int r,int beg,int end,BOOLEAN *endch,int * choise) |
---|
| 935 | { |
---|
| 936 | /*returns the first choise of r numbers between beg and end*/ |
---|
| 937 | int i; |
---|
| 938 | for (i=0; i<r; i++) |
---|
| 939 | { |
---|
| 940 | choise[i] = 0; |
---|
| 941 | } |
---|
| 942 | if (r <= end-beg+1) |
---|
| 943 | for (i=0; i<r; i++) |
---|
| 944 | { |
---|
| 945 | choise[i] = beg+i; |
---|
| 946 | } |
---|
| 947 | if (r > end-beg+1) |
---|
| 948 | *endch = TRUE; |
---|
| 949 | else |
---|
| 950 | *endch = FALSE; |
---|
| 951 | } |
---|
| 952 | |
---|
| 953 | /*2 |
---|
| 954 | *returns the next choise of r numbers between beg and end |
---|
| 955 | */ |
---|
| 956 | void idGetNextChoise (int r,int end,BOOLEAN *endch,int * choise) |
---|
| 957 | { |
---|
| 958 | int i = r-1,j; |
---|
| 959 | while ((i >= 0) && (choise[i] == end)) |
---|
| 960 | { |
---|
| 961 | i--; |
---|
| 962 | end--; |
---|
| 963 | } |
---|
| 964 | if (i == -1) |
---|
| 965 | *endch = TRUE; |
---|
| 966 | else |
---|
| 967 | { |
---|
| 968 | choise[i]++; |
---|
| 969 | for (j=i+1; j<r; j++) |
---|
| 970 | { |
---|
| 971 | choise[j] = choise[i]+j-i; |
---|
| 972 | } |
---|
| 973 | *endch = FALSE; |
---|
| 974 | } |
---|
| 975 | } |
---|
| 976 | |
---|
| 977 | /*2 |
---|
| 978 | *takes the field choise of d numbers between beg and end, cancels the t-th |
---|
| 979 | *entree and searches for the ordinal number of that d-1 dimensional field |
---|
| 980 | * w.r.t. the algorithm of construction |
---|
| 981 | */ |
---|
| 982 | int idGetNumberOfChoise(int t, int d, int begin, int end, int * choise) |
---|
| 983 | { |
---|
| 984 | int * localchoise,i,result=0; |
---|
| 985 | BOOLEAN b=FALSE; |
---|
| 986 | |
---|
| 987 | if (d<=1) return 1; |
---|
| 988 | localchoise=(int*)omAlloc((d-1)*sizeof(int)); |
---|
| 989 | idInitChoise(d-1,begin,end,&b,localchoise); |
---|
| 990 | while (!b) |
---|
| 991 | { |
---|
| 992 | result++; |
---|
| 993 | i = 0; |
---|
| 994 | while ((i<t) && (localchoise[i]==choise[i])) i++; |
---|
| 995 | if (i>=t) |
---|
| 996 | { |
---|
| 997 | i = t+1; |
---|
| 998 | while ((i<d) && (localchoise[i-1]==choise[i])) i++; |
---|
| 999 | if (i>=d) |
---|
| 1000 | { |
---|
| 1001 | omFreeSize((ADDRESS)localchoise,(d-1)*sizeof(int)); |
---|
| 1002 | return result; |
---|
| 1003 | } |
---|
| 1004 | } |
---|
| 1005 | idGetNextChoise(d-1,end,&b,localchoise); |
---|
| 1006 | } |
---|
| 1007 | omFreeSize((ADDRESS)localchoise,(d-1)*sizeof(int)); |
---|
| 1008 | return 0; |
---|
| 1009 | } |
---|
| 1010 | |
---|
| 1011 | /*2 |
---|
| 1012 | *computes the binomial coefficient |
---|
| 1013 | */ |
---|
| 1014 | int binom (int n,int r) |
---|
| 1015 | { |
---|
| 1016 | int i,result; |
---|
| 1017 | |
---|
| 1018 | if (r==0) return 1; |
---|
| 1019 | if (n-r<r) return binom(n,n-r); |
---|
| 1020 | result = n-r+1; |
---|
| 1021 | for (i=2;i<=r;i++) |
---|
| 1022 | { |
---|
| 1023 | result *= n-r+i; |
---|
| 1024 | if (result<0) |
---|
| 1025 | { |
---|
| 1026 | WarnS("overflow in binomials"); |
---|
| 1027 | return 0; |
---|
| 1028 | } |
---|
| 1029 | result /= i; |
---|
| 1030 | } |
---|
| 1031 | return result; |
---|
| 1032 | } |
---|
| 1033 | |
---|
| 1034 | /*2 |
---|
| 1035 | *the free module of rank i |
---|
| 1036 | */ |
---|
| 1037 | ideal idFreeModule (int i) |
---|
| 1038 | { |
---|
| 1039 | int j; |
---|
| 1040 | ideal h; |
---|
| 1041 | |
---|
| 1042 | h=idInit(i,i); |
---|
| 1043 | for (j=0; j<i; j++) |
---|
| 1044 | { |
---|
| 1045 | h->m[j] = pOne(); |
---|
| 1046 | pSetComp(h->m[j],j+1); |
---|
| 1047 | pSetmComp(h->m[j]); |
---|
| 1048 | } |
---|
| 1049 | return h; |
---|
| 1050 | } |
---|
| 1051 | |
---|
| 1052 | /*2 |
---|
| 1053 | * h3 := h1 intersect h2 |
---|
| 1054 | */ |
---|
| 1055 | ideal idSect (ideal h1,ideal h2) |
---|
| 1056 | { |
---|
| 1057 | ideal first=h2,second=h1,temp,temp1,result; |
---|
| 1058 | int i,j,k,flength,slength,length,rank=si_min(h1->rank,h2->rank); |
---|
| 1059 | intvec *w; |
---|
| 1060 | poly p,q; |
---|
| 1061 | |
---|
| 1062 | if ((idIs0(h1)) && (idIs0(h2))) return idInit(1,rank); |
---|
| 1063 | if (IDELEMS(h1)<IDELEMS(h2)) |
---|
| 1064 | { |
---|
| 1065 | first = h1; |
---|
| 1066 | second = h2; |
---|
| 1067 | } |
---|
| 1068 | flength = idRankFreeModule(first); |
---|
| 1069 | slength = idRankFreeModule(second); |
---|
| 1070 | length = si_max(flength,slength); |
---|
| 1071 | if (length==0) |
---|
| 1072 | { |
---|
| 1073 | length = 1; |
---|
| 1074 | } |
---|
| 1075 | j = IDELEMS(first); |
---|
| 1076 | temp = idInit(j /*IDELEMS(first)*/,length+j); |
---|
| 1077 | |
---|
| 1078 | ring orig_ring=currRing; |
---|
| 1079 | ring syz_ring=rCurrRingAssure_SyzComp(); |
---|
| 1080 | rSetSyzComp(length); |
---|
| 1081 | |
---|
| 1082 | while ((j>0) && (first->m[j-1]==NULL)) j--; |
---|
| 1083 | k = 0; |
---|
| 1084 | for (i=0;i<j;i++) |
---|
| 1085 | { |
---|
| 1086 | if (first->m[i]!=NULL) |
---|
| 1087 | { |
---|
| 1088 | if (syz_ring==orig_ring) |
---|
| 1089 | temp->m[k] = pCopy(first->m[i]); |
---|
| 1090 | else |
---|
[99b206] | 1091 | temp->m[k] = prCopyR(first->m[i], orig_ring); |
---|
[35aab3] | 1092 | q = pOne(); |
---|
| 1093 | pSetComp(q,i+1+length); |
---|
| 1094 | pSetmComp(q); |
---|
| 1095 | if (flength==0) pShift(&(temp->m[k]),1); |
---|
| 1096 | p = temp->m[k]; |
---|
| 1097 | while (pNext(p)!=NULL) pIter(p); |
---|
| 1098 | pNext(p) = q; |
---|
| 1099 | k++; |
---|
| 1100 | } |
---|
| 1101 | } |
---|
| 1102 | pEnlargeSet(&(temp->m),IDELEMS(temp),j+IDELEMS(second)-IDELEMS(temp)); |
---|
| 1103 | IDELEMS(temp) = j+IDELEMS(second); |
---|
| 1104 | for (i=0;i<IDELEMS(second);i++) |
---|
| 1105 | { |
---|
| 1106 | if (second->m[i]!=NULL) |
---|
| 1107 | { |
---|
| 1108 | if (syz_ring==orig_ring) |
---|
| 1109 | temp->m[k] = pCopy(second->m[i]); |
---|
| 1110 | else |
---|
[99b206] | 1111 | temp->m[k] = prCopyR(second->m[i], orig_ring); |
---|
[35aab3] | 1112 | if (slength==0) pShift(&(temp->m[k]),1); |
---|
| 1113 | k++; |
---|
| 1114 | } |
---|
| 1115 | } |
---|
| 1116 | temp1 = kStd(temp,currQuotient,testHomog,&w,NULL,length); |
---|
| 1117 | if (w!=NULL) delete w; |
---|
| 1118 | idDelete(&temp); |
---|
| 1119 | |
---|
| 1120 | if(syz_ring!=orig_ring) |
---|
| 1121 | rChangeCurrRing(orig_ring); |
---|
| 1122 | |
---|
| 1123 | result = idInit(IDELEMS(temp1),rank); |
---|
| 1124 | j = 0; |
---|
| 1125 | for (i=0;i<IDELEMS(temp1);i++) |
---|
| 1126 | { |
---|
| 1127 | if ((temp1->m[i]!=NULL) |
---|
| 1128 | && (p_GetComp(temp1->m[i],syz_ring)>length)) |
---|
| 1129 | { |
---|
| 1130 | if(syz_ring==orig_ring) |
---|
[99b206] | 1131 | p = pCopy(temp1->m[i]); |
---|
[35aab3] | 1132 | else |
---|
[99b206] | 1133 | p = prCopyR(temp1->m[i], syz_ring); |
---|
[35aab3] | 1134 | while (p!=NULL) |
---|
| 1135 | { |
---|
| 1136 | q = pNext(p); |
---|
| 1137 | pNext(p) = NULL; |
---|
| 1138 | k = pGetComp(p)-1-length; |
---|
| 1139 | pSetComp(p,0); |
---|
| 1140 | pSetmComp(p); |
---|
[99b206] | 1141 | /* Warning! multiply only from the left! it's very important for Plural */ |
---|
| 1142 | result->m[j] = pAdd(result->m[j],pMult(p,pCopy(first->m[k]))); |
---|
[35aab3] | 1143 | p = q; |
---|
| 1144 | } |
---|
| 1145 | j++; |
---|
| 1146 | } |
---|
| 1147 | } |
---|
| 1148 | if(syz_ring!=orig_ring) |
---|
| 1149 | { |
---|
| 1150 | rChangeCurrRing(syz_ring); |
---|
| 1151 | idDelete(&temp1); |
---|
| 1152 | rChangeCurrRing(orig_ring); |
---|
| 1153 | rKill(syz_ring); |
---|
| 1154 | } |
---|
| 1155 | else |
---|
| 1156 | { |
---|
| 1157 | idDelete(&temp1); |
---|
| 1158 | } |
---|
| 1159 | |
---|
| 1160 | idSkipZeroes(result); |
---|
| 1161 | return result; |
---|
| 1162 | } |
---|
| 1163 | |
---|
| 1164 | /*2 |
---|
| 1165 | * ideal/module intersection for a list of objects |
---|
| 1166 | * given as 'resolvente' |
---|
| 1167 | */ |
---|
| 1168 | ideal idMultSect(resolvente arg, int length) |
---|
| 1169 | { |
---|
| 1170 | int i,j=0,k=0,syzComp,l,maxrk=-1,realrki; |
---|
| 1171 | ideal bigmat,tempstd,result; |
---|
| 1172 | poly p; |
---|
| 1173 | int isIdeal=0; |
---|
| 1174 | intvec * w=NULL; |
---|
| 1175 | |
---|
| 1176 | /* find 0-ideals and max rank -----------------------------------*/ |
---|
| 1177 | for (i=0;i<length;i++) |
---|
| 1178 | { |
---|
| 1179 | if (!idIs0(arg[i])) |
---|
| 1180 | { |
---|
| 1181 | realrki=idRankFreeModule(arg[i]); |
---|
| 1182 | k++; |
---|
| 1183 | j += IDELEMS(arg[i]); |
---|
| 1184 | if (realrki>maxrk) maxrk = realrki; |
---|
| 1185 | } |
---|
| 1186 | else |
---|
| 1187 | { |
---|
| 1188 | if (arg[i]!=NULL) |
---|
| 1189 | { |
---|
| 1190 | return idInit(1,arg[i]->rank); |
---|
| 1191 | } |
---|
| 1192 | } |
---|
| 1193 | } |
---|
| 1194 | if (maxrk == 0) |
---|
| 1195 | { |
---|
| 1196 | isIdeal = 1; |
---|
| 1197 | maxrk = 1; |
---|
| 1198 | } |
---|
| 1199 | /* init -----------------------------------------------------------*/ |
---|
| 1200 | j += maxrk; |
---|
| 1201 | syzComp = k*maxrk; |
---|
| 1202 | |
---|
| 1203 | ring orig_ring=currRing; |
---|
| 1204 | ring syz_ring=rCurrRingAssure_SyzComp(); |
---|
| 1205 | rSetSyzComp(syzComp); |
---|
| 1206 | |
---|
| 1207 | bigmat = idInit(j,(k+1)*maxrk); |
---|
| 1208 | /* create unit matrices ------------------------------------------*/ |
---|
| 1209 | for (i=0;i<maxrk;i++) |
---|
| 1210 | { |
---|
| 1211 | for (j=0;j<=k;j++) |
---|
| 1212 | { |
---|
| 1213 | p = pOne(); |
---|
| 1214 | pSetComp(p,i+1+j*maxrk); |
---|
| 1215 | pSetmComp(p); |
---|
| 1216 | bigmat->m[i] = pAdd(bigmat->m[i],p); |
---|
| 1217 | } |
---|
| 1218 | } |
---|
| 1219 | /* enter given ideals ------------------------------------------*/ |
---|
| 1220 | i = maxrk; |
---|
| 1221 | k = 0; |
---|
| 1222 | for (j=0;j<length;j++) |
---|
| 1223 | { |
---|
| 1224 | if (arg[j]!=NULL) |
---|
| 1225 | { |
---|
| 1226 | for (l=0;l<IDELEMS(arg[j]);l++) |
---|
| 1227 | { |
---|
| 1228 | if (arg[j]->m[l]!=NULL) |
---|
| 1229 | { |
---|
| 1230 | if (syz_ring==orig_ring) |
---|
| 1231 | bigmat->m[i] = pCopy(arg[j]->m[l]); |
---|
| 1232 | else |
---|
| 1233 | bigmat->m[i] = prCopyR(arg[j]->m[l], orig_ring); |
---|
| 1234 | pShift(&(bigmat->m[i]),k*maxrk+isIdeal); |
---|
| 1235 | i++; |
---|
| 1236 | } |
---|
| 1237 | } |
---|
| 1238 | k++; |
---|
| 1239 | } |
---|
| 1240 | } |
---|
| 1241 | /* std computation --------------------------------------------*/ |
---|
| 1242 | tempstd = kStd(bigmat,currQuotient,testHomog,&w,NULL,syzComp); |
---|
| 1243 | if (w!=NULL) delete w; |
---|
| 1244 | idDelete(&bigmat); |
---|
| 1245 | |
---|
| 1246 | if(syz_ring!=orig_ring) |
---|
| 1247 | rChangeCurrRing(orig_ring); |
---|
| 1248 | |
---|
| 1249 | /* interprete result ----------------------------------------*/ |
---|
| 1250 | result = idInit(8,maxrk); |
---|
| 1251 | k = 0; |
---|
| 1252 | for (j=0;j<IDELEMS(tempstd);j++) |
---|
| 1253 | { |
---|
| 1254 | if ((tempstd->m[j]!=NULL) && (p_GetComp(tempstd->m[j],syz_ring)>syzComp)) |
---|
| 1255 | { |
---|
| 1256 | if (k>=IDELEMS(result)) |
---|
| 1257 | { |
---|
| 1258 | pEnlargeSet(&(result->m),IDELEMS(result),8); |
---|
| 1259 | IDELEMS(result) += 8; |
---|
| 1260 | } |
---|
| 1261 | if (syz_ring==orig_ring) |
---|
| 1262 | p = pCopy(tempstd->m[j]); |
---|
| 1263 | else |
---|
| 1264 | p = prCopyR(tempstd->m[j], syz_ring); |
---|
| 1265 | pShift(&p,-syzComp-isIdeal); |
---|
| 1266 | result->m[k] = p; |
---|
| 1267 | k++; |
---|
| 1268 | } |
---|
| 1269 | } |
---|
| 1270 | /* clean up ----------------------------------------------------*/ |
---|
| 1271 | if(syz_ring!=orig_ring) |
---|
| 1272 | rChangeCurrRing(syz_ring); |
---|
| 1273 | idDelete(&tempstd); |
---|
| 1274 | if(syz_ring!=orig_ring) |
---|
| 1275 | { |
---|
| 1276 | rChangeCurrRing(orig_ring); |
---|
| 1277 | rKill(syz_ring); |
---|
| 1278 | } |
---|
| 1279 | idSkipZeroes(result); |
---|
| 1280 | return result; |
---|
| 1281 | } |
---|
| 1282 | |
---|
| 1283 | /*2 |
---|
| 1284 | *computes syzygies of h1, |
---|
| 1285 | *if quot != NULL it computes in the quotient ring modulo "quot" |
---|
| 1286 | *works always in a ring with ringorder_s |
---|
| 1287 | */ |
---|
| 1288 | static ideal idPrepare (ideal h1, tHomog h, int syzcomp, intvec **w) |
---|
| 1289 | { |
---|
| 1290 | ideal h2, h3; |
---|
| 1291 | int i; |
---|
| 1292 | int j,jj=0,k; |
---|
| 1293 | poly p,q; |
---|
| 1294 | |
---|
| 1295 | if (idIs0(h1)) return NULL; |
---|
| 1296 | k = idRankFreeModule(h1); |
---|
| 1297 | h2=idCopy(h1); |
---|
| 1298 | i = IDELEMS(h2)-1; |
---|
| 1299 | if (k == 0) |
---|
| 1300 | { |
---|
| 1301 | for (j=0; j<=i; j++) pShift(&(h2->m[j]),1); |
---|
| 1302 | k = 1; |
---|
| 1303 | } |
---|
| 1304 | if (syzcomp<k) |
---|
| 1305 | { |
---|
| 1306 | Warn("syzcomp too low, should be %d instead of %d",k,syzcomp); |
---|
| 1307 | syzcomp = k; |
---|
| 1308 | rSetSyzComp(k); |
---|
| 1309 | } |
---|
| 1310 | h2->rank = syzcomp+i+1; |
---|
| 1311 | for (j=0; j<=i; j++) |
---|
| 1312 | { |
---|
| 1313 | p = h2->m[j]; |
---|
| 1314 | q = pOne(); |
---|
| 1315 | pSetComp(q,syzcomp+1+j); |
---|
| 1316 | pSetmComp(q); |
---|
| 1317 | if (p!=NULL) |
---|
| 1318 | { |
---|
| 1319 | while (pNext(p)) pIter(p); |
---|
| 1320 | p->next = q; |
---|
| 1321 | } |
---|
| 1322 | else |
---|
| 1323 | h2->m[j]=q; |
---|
| 1324 | } |
---|
| 1325 | |
---|
| 1326 | #ifdef PDEBUG |
---|
| 1327 | for(j=0;j<IDELEMS(h2);j++) pTest(h2->m[j]); |
---|
| 1328 | #endif |
---|
| 1329 | h3=kStd(h2,currQuotient,h,w,NULL,syzcomp); |
---|
| 1330 | idDelete(&h2); |
---|
| 1331 | return h3; |
---|
| 1332 | } |
---|
| 1333 | |
---|
| 1334 | /*2 |
---|
| 1335 | * compute the syzygies of h1 in R/quot, |
---|
| 1336 | * weights of components are in w |
---|
| 1337 | * if setRegularity, return the regularity in deg |
---|
| 1338 | * do not change h1, w |
---|
| 1339 | */ |
---|
| 1340 | ideal idSyzygies (ideal h1, tHomog h,intvec **w, BOOLEAN setSyzComp, |
---|
| 1341 | BOOLEAN setRegularity, int *deg) |
---|
| 1342 | { |
---|
| 1343 | ideal s_h1; |
---|
| 1344 | poly p; |
---|
[43ebb1] | 1345 | int j, k, length=0,reg; |
---|
[35aab3] | 1346 | BOOLEAN isMonomial=TRUE; |
---|
[43ebb1] | 1347 | int ii, idElemens_h1; |
---|
[35aab3] | 1348 | |
---|
[43ebb1] | 1349 | idElemens_h1=IDELEMS(h1); |
---|
[35aab3] | 1350 | #ifdef PDEBUG |
---|
[43ebb1] | 1351 | for(ii=0;ii<idElemens_h1 /*IDELEMS(h1)*/;ii++) pTest(h1->m[ii]); |
---|
[35aab3] | 1352 | #endif |
---|
| 1353 | if (idIs0(h1)) |
---|
| 1354 | { |
---|
[43ebb1] | 1355 | ideal result=idFreeModule(idElemens_h1/*IDELEMS(h1)*/); |
---|
[35aab3] | 1356 | int curr_syz_limit=rGetCurrSyzLimit(); |
---|
| 1357 | if (curr_syz_limit>0) |
---|
[43ebb1] | 1358 | for (ii=0;ii<idElemens_h1/*IDELEMS(h1)*/;ii++) |
---|
[35aab3] | 1359 | { |
---|
| 1360 | if (h1->m[ii]!=NULL) |
---|
| 1361 | pShift(&h1->m[ii],curr_syz_limit); |
---|
| 1362 | } |
---|
| 1363 | return result; |
---|
| 1364 | } |
---|
[43ebb1] | 1365 | int slength=(int)idRankFreeModule(h1); |
---|
| 1366 | k=si_max(1,slength /*idRankFreeModule(h1)*/); |
---|
[35aab3] | 1367 | |
---|
| 1368 | assume(currRing != NULL); |
---|
| 1369 | ring orig_ring=currRing; |
---|
| 1370 | ring syz_ring=rCurrRingAssure_SyzComp(); |
---|
| 1371 | |
---|
| 1372 | if (setSyzComp) |
---|
| 1373 | rSetSyzComp(k); |
---|
| 1374 | |
---|
| 1375 | if (orig_ring != syz_ring) |
---|
| 1376 | { |
---|
| 1377 | s_h1=idrCopyR_NoSort(h1,orig_ring); |
---|
| 1378 | } |
---|
| 1379 | else |
---|
| 1380 | { |
---|
| 1381 | s_h1 = h1; |
---|
| 1382 | } |
---|
| 1383 | |
---|
| 1384 | ideal s_h3=idPrepare(s_h1,h,k,w); |
---|
| 1385 | |
---|
| 1386 | if (s_h3==NULL) |
---|
| 1387 | { |
---|
[43ebb1] | 1388 | return idFreeModule( idElemens_h1 /*IDELEMS(h1)*/); |
---|
[35aab3] | 1389 | } |
---|
| 1390 | |
---|
| 1391 | if (orig_ring != syz_ring) |
---|
| 1392 | { |
---|
| 1393 | idDelete(&s_h1); |
---|
| 1394 | for (j=0; j<IDELEMS(s_h3); j++) |
---|
| 1395 | { |
---|
| 1396 | if (s_h3->m[j] != NULL) |
---|
| 1397 | { |
---|
| 1398 | if (p_MinComp(s_h3->m[j],syz_ring) > k) |
---|
| 1399 | pShift(&s_h3->m[j], -k); |
---|
| 1400 | else |
---|
| 1401 | pDelete(&s_h3->m[j]); |
---|
| 1402 | } |
---|
| 1403 | } |
---|
| 1404 | idSkipZeroes(s_h3); |
---|
| 1405 | s_h3->rank -= k; |
---|
| 1406 | rChangeCurrRing(orig_ring); |
---|
| 1407 | s_h3 = idrMoveR_NoSort(s_h3, syz_ring); |
---|
| 1408 | rKill(syz_ring); |
---|
| 1409 | idTest(s_h3); |
---|
| 1410 | return s_h3; |
---|
| 1411 | } |
---|
| 1412 | |
---|
| 1413 | ideal e = idInit(IDELEMS(s_h3), s_h3->rank); |
---|
| 1414 | |
---|
| 1415 | for (j=0; j<IDELEMS(s_h3); j++) |
---|
| 1416 | { |
---|
| 1417 | if (s_h3->m[j] != NULL) |
---|
| 1418 | { |
---|
| 1419 | if (p_MinComp(s_h3->m[j],syz_ring) <= k) |
---|
| 1420 | { |
---|
| 1421 | e->m[j] = s_h3->m[j]; |
---|
| 1422 | isMonomial=isMonomial && (pNext(s_h3->m[j])==NULL); |
---|
| 1423 | pDelete(&pNext(s_h3->m[j])); |
---|
| 1424 | s_h3->m[j] = NULL; |
---|
| 1425 | } |
---|
| 1426 | } |
---|
| 1427 | } |
---|
| 1428 | |
---|
| 1429 | idSkipZeroes(s_h3); |
---|
| 1430 | idSkipZeroes(e); |
---|
| 1431 | |
---|
| 1432 | if ((deg != NULL) |
---|
| 1433 | && (!isMonomial) |
---|
| 1434 | && (!TEST_OPT_NOTREGULARITY) |
---|
| 1435 | && (setRegularity) |
---|
| 1436 | && (h==isHomog) |
---|
| 1437 | && (!rIsPluralRing(currRing)) |
---|
| 1438 | ) |
---|
| 1439 | { |
---|
| 1440 | ring dp_C_ring = rCurrRingAssure_dp_C(); |
---|
| 1441 | if (dp_C_ring != syz_ring) |
---|
| 1442 | e = idrMoveR_NoSort(e, syz_ring); |
---|
| 1443 | resolvente res = sySchreyerResolvente(e,-1,&length,TRUE, TRUE); |
---|
| 1444 | intvec * dummy = syBetti(res,length,®, *w); |
---|
| 1445 | *deg = reg+2; |
---|
| 1446 | delete dummy; |
---|
| 1447 | for (j=0;j<length;j++) |
---|
| 1448 | { |
---|
| 1449 | if (res[j]!=NULL) idDelete(&(res[j])); |
---|
| 1450 | } |
---|
| 1451 | omFreeSize((ADDRESS)res,length*sizeof(ideal)); |
---|
| 1452 | idDelete(&e); |
---|
| 1453 | if (dp_C_ring != syz_ring) |
---|
| 1454 | { |
---|
| 1455 | rChangeCurrRing(syz_ring); |
---|
| 1456 | rKill(dp_C_ring); |
---|
| 1457 | } |
---|
| 1458 | } |
---|
| 1459 | else |
---|
| 1460 | { |
---|
| 1461 | idDelete(&e); |
---|
| 1462 | } |
---|
| 1463 | idTest(s_h3); |
---|
| 1464 | if (currQuotient != NULL) |
---|
| 1465 | { |
---|
| 1466 | ideal ts_h3=kStd(s_h3,currQuotient,h,w); |
---|
| 1467 | idDelete(&s_h3); |
---|
| 1468 | s_h3 = ts_h3; |
---|
| 1469 | } |
---|
| 1470 | return s_h3; |
---|
| 1471 | } |
---|
| 1472 | |
---|
| 1473 | /*2 |
---|
| 1474 | */ |
---|
| 1475 | ideal idXXX (ideal h1, int k) |
---|
| 1476 | { |
---|
| 1477 | ideal s_h1; |
---|
| 1478 | int j; |
---|
| 1479 | intvec *w=NULL; |
---|
| 1480 | |
---|
| 1481 | assume(currRing != NULL); |
---|
| 1482 | ring orig_ring=currRing; |
---|
| 1483 | ring syz_ring=rCurrRingAssure_SyzComp(); |
---|
| 1484 | |
---|
| 1485 | rSetSyzComp(k); |
---|
| 1486 | |
---|
| 1487 | if (orig_ring != syz_ring) |
---|
| 1488 | { |
---|
| 1489 | s_h1=idrCopyR_NoSort(h1,orig_ring); |
---|
| 1490 | } |
---|
| 1491 | else |
---|
| 1492 | { |
---|
| 1493 | s_h1 = h1; |
---|
| 1494 | } |
---|
| 1495 | |
---|
| 1496 | ideal s_h3=kStd(s_h1,NULL,testHomog,&w,NULL,k); |
---|
| 1497 | |
---|
| 1498 | if (s_h3==NULL) |
---|
| 1499 | { |
---|
| 1500 | return idFreeModule(IDELEMS(h1)); |
---|
| 1501 | } |
---|
| 1502 | |
---|
| 1503 | if (orig_ring != syz_ring) |
---|
| 1504 | { |
---|
| 1505 | idDelete(&s_h1); |
---|
| 1506 | idSkipZeroes(s_h3); |
---|
| 1507 | rChangeCurrRing(orig_ring); |
---|
| 1508 | s_h3 = idrMoveR_NoSort(s_h3, syz_ring); |
---|
| 1509 | rKill(syz_ring); |
---|
| 1510 | idTest(s_h3); |
---|
| 1511 | return s_h3; |
---|
| 1512 | } |
---|
| 1513 | |
---|
| 1514 | idSkipZeroes(s_h3); |
---|
| 1515 | idTest(s_h3); |
---|
| 1516 | return s_h3; |
---|
| 1517 | } |
---|
| 1518 | |
---|
| 1519 | /* |
---|
| 1520 | *computes a standard basis for h1 and stores the transformation matrix |
---|
| 1521 | * in ma |
---|
| 1522 | */ |
---|
| 1523 | ideal idLiftStd (ideal h1, matrix* ma, tHomog h) |
---|
| 1524 | { |
---|
| 1525 | int i, j, k, t, inputIsIdeal=idRankFreeModule(h1); |
---|
| 1526 | poly p=NULL, q, qq; |
---|
| 1527 | intvec *w=NULL; |
---|
| 1528 | |
---|
| 1529 | idDelete((ideal*)ma); |
---|
| 1530 | *ma=mpNew(1,0); |
---|
| 1531 | if (idIs0(h1)) |
---|
| 1532 | return idInit(1,h1->rank); |
---|
[62dd9b] | 1533 | k=si_max(1,(int)idRankFreeModule(h1)); |
---|
[35aab3] | 1534 | |
---|
| 1535 | ring orig_ring=currRing; |
---|
| 1536 | ring syz_ring=rCurrRingAssure_SyzComp(); |
---|
| 1537 | rSetSyzComp(k); |
---|
| 1538 | |
---|
| 1539 | ideal s_h1=h1; |
---|
| 1540 | |
---|
| 1541 | if (orig_ring != syz_ring) |
---|
| 1542 | s_h1 = idrCopyR_NoSort(h1,orig_ring); |
---|
| 1543 | else |
---|
| 1544 | s_h1 = h1; |
---|
| 1545 | |
---|
| 1546 | ideal s_h3=idPrepare(s_h1,h,k,&w); |
---|
| 1547 | ideal s_h2 = idInit(IDELEMS(s_h3), s_h3->rank); |
---|
| 1548 | |
---|
| 1549 | if (w!=NULL) delete w; |
---|
| 1550 | i = 0; |
---|
| 1551 | for (j=0; j<IDELEMS(s_h3); j++) |
---|
| 1552 | { |
---|
| 1553 | if ((s_h3->m[j] != NULL) && (p_MinComp(s_h3->m[j],syz_ring) <= k)) |
---|
| 1554 | { |
---|
| 1555 | i++; |
---|
| 1556 | q = s_h3->m[j]; |
---|
| 1557 | while (pNext(q) != NULL) |
---|
| 1558 | { |
---|
| 1559 | if (pGetComp(pNext(q)) > k) |
---|
| 1560 | { |
---|
| 1561 | s_h2->m[j] = pNext(q); |
---|
| 1562 | pNext(q) = NULL; |
---|
| 1563 | } |
---|
| 1564 | else |
---|
| 1565 | { |
---|
| 1566 | pIter(q); |
---|
| 1567 | } |
---|
| 1568 | } |
---|
| 1569 | if (!inputIsIdeal) pShift(&(s_h3->m[j]), -1); |
---|
| 1570 | } |
---|
| 1571 | else |
---|
| 1572 | { |
---|
| 1573 | pDelete(&(s_h3->m[j])); |
---|
| 1574 | } |
---|
| 1575 | } |
---|
| 1576 | |
---|
| 1577 | idSkipZeroes(s_h3); |
---|
| 1578 | j = IDELEMS(s_h1); |
---|
| 1579 | |
---|
| 1580 | if (syz_ring!=orig_ring) |
---|
| 1581 | { |
---|
| 1582 | idDelete(&s_h1); |
---|
| 1583 | rChangeCurrRing(orig_ring); |
---|
| 1584 | } |
---|
| 1585 | |
---|
| 1586 | idDelete((ideal*)ma); |
---|
| 1587 | *ma = mpNew(j,i); |
---|
| 1588 | |
---|
| 1589 | i = 1; |
---|
| 1590 | for (j=0; j<IDELEMS(s_h2); j++) |
---|
| 1591 | { |
---|
| 1592 | if (s_h2->m[j] != NULL) |
---|
| 1593 | { |
---|
| 1594 | q = prMoveR( s_h2->m[j], syz_ring); |
---|
| 1595 | s_h2->m[j] = NULL; |
---|
| 1596 | |
---|
| 1597 | while (q != NULL) |
---|
| 1598 | { |
---|
| 1599 | p = q; |
---|
| 1600 | pIter(q); |
---|
| 1601 | pNext(p) = NULL; |
---|
| 1602 | t=pGetComp(p); |
---|
| 1603 | pSetComp(p,0); |
---|
| 1604 | pSetmComp(p); |
---|
| 1605 | MATELEM(*ma,t-k,i) = pAdd(MATELEM(*ma,t-k,i),p); |
---|
| 1606 | } |
---|
| 1607 | i++; |
---|
| 1608 | } |
---|
| 1609 | } |
---|
| 1610 | idDelete(&s_h2); |
---|
| 1611 | |
---|
| 1612 | for (i=0; i<IDELEMS(s_h3); i++) |
---|
| 1613 | { |
---|
| 1614 | s_h3->m[i] = prMoveR_NoSort(s_h3->m[i], syz_ring); |
---|
| 1615 | } |
---|
| 1616 | |
---|
| 1617 | if (syz_ring!=orig_ring) rKill(syz_ring); |
---|
| 1618 | return s_h3; |
---|
| 1619 | } |
---|
| 1620 | |
---|
| 1621 | static void idPrepareStd(ideal s_temp, int k) |
---|
| 1622 | { |
---|
| 1623 | int j,rk=idRankFreeModule(s_temp); |
---|
| 1624 | poly p,q; |
---|
| 1625 | |
---|
| 1626 | if (rk == 0) |
---|
| 1627 | { |
---|
| 1628 | for (j=0; j<IDELEMS(s_temp); j++) |
---|
| 1629 | { |
---|
| 1630 | if (s_temp->m[j]!=NULL) pSetCompP(s_temp->m[j],1); |
---|
| 1631 | } |
---|
| 1632 | k = si_max(k,1); |
---|
| 1633 | } |
---|
| 1634 | for (j=0; j<IDELEMS(s_temp); j++) |
---|
| 1635 | { |
---|
| 1636 | if (s_temp->m[j]!=NULL) |
---|
| 1637 | { |
---|
| 1638 | p = s_temp->m[j]; |
---|
| 1639 | q = pOne(); |
---|
| 1640 | //pGetCoeff(q)=nNeg(pGetCoeff(q)); //set q to -1 |
---|
| 1641 | pSetComp(q,k+1+j); |
---|
| 1642 | pSetmComp(q); |
---|
| 1643 | while (pNext(p)) pIter(p); |
---|
| 1644 | pNext(p) = q; |
---|
| 1645 | } |
---|
| 1646 | } |
---|
| 1647 | } |
---|
| 1648 | |
---|
| 1649 | /*2 |
---|
| 1650 | *computes a representation of the generators of submod with respect to those |
---|
| 1651 | * of mod |
---|
| 1652 | */ |
---|
| 1653 | |
---|
| 1654 | ideal idLift(ideal mod, ideal submod,ideal *rest, BOOLEAN goodShape, |
---|
| 1655 | BOOLEAN isSB, BOOLEAN divide, matrix *unit) |
---|
| 1656 | { |
---|
| 1657 | int lsmod =idRankFreeModule(submod), i, j, k; |
---|
| 1658 | int comps_to_add=0; |
---|
| 1659 | poly p; |
---|
| 1660 | |
---|
| 1661 | if (idIs0(submod)) |
---|
| 1662 | { |
---|
| 1663 | if (unit!=NULL) |
---|
| 1664 | { |
---|
| 1665 | *unit=mpNew(1,1); |
---|
| 1666 | MATELEM(*unit,1,1)=pOne(); |
---|
| 1667 | } |
---|
| 1668 | if (rest!=NULL) |
---|
| 1669 | { |
---|
| 1670 | *rest=idInit(1,mod->rank); |
---|
| 1671 | } |
---|
| 1672 | return idInit(1,mod->rank); |
---|
| 1673 | } |
---|
| 1674 | if (idIs0(mod)) |
---|
| 1675 | { |
---|
| 1676 | if (unit!=NULL) |
---|
| 1677 | { |
---|
| 1678 | i=IDELEMS(submod); |
---|
| 1679 | *unit=mpNew(i,i); |
---|
| 1680 | for (j=i;j>0;j--) |
---|
| 1681 | { |
---|
| 1682 | MATELEM(*unit,j,j)=pOne(); |
---|
| 1683 | } |
---|
| 1684 | } |
---|
| 1685 | if (rest!=NULL) |
---|
| 1686 | { |
---|
| 1687 | *rest=idCopy(submod); |
---|
| 1688 | } |
---|
| 1689 | return idInit(1,mod->rank); |
---|
| 1690 | } |
---|
| 1691 | if (unit!=NULL) |
---|
| 1692 | { |
---|
| 1693 | comps_to_add = IDELEMS(submod); |
---|
| 1694 | while ((comps_to_add>0) && (submod->m[comps_to_add-1]==NULL)) |
---|
| 1695 | comps_to_add--; |
---|
| 1696 | } |
---|
| 1697 | k=idRankFreeModule(mod); |
---|
| 1698 | if ((k!=0) && (lsmod==0)) lsmod=1; |
---|
| 1699 | k=si_max(k,1); |
---|
| 1700 | |
---|
| 1701 | ring orig_ring=currRing; |
---|
| 1702 | ring syz_ring=rCurrRingAssure_SyzComp(); |
---|
| 1703 | rSetSyzComp(k); |
---|
| 1704 | |
---|
| 1705 | ideal s_mod, s_temp; |
---|
| 1706 | if (orig_ring != syz_ring) |
---|
| 1707 | { |
---|
| 1708 | s_mod = idrCopyR_NoSort(mod,orig_ring); |
---|
| 1709 | s_temp = idrCopyR_NoSort(submod,orig_ring); |
---|
| 1710 | } |
---|
| 1711 | else |
---|
| 1712 | { |
---|
| 1713 | s_mod = mod; |
---|
| 1714 | s_temp = idCopy(submod); |
---|
| 1715 | } |
---|
| 1716 | ideal s_h3; |
---|
| 1717 | if (isSB) |
---|
| 1718 | { |
---|
| 1719 | s_h3 = idCopy(s_mod); |
---|
| 1720 | idPrepareStd(s_h3, k+comps_to_add); |
---|
| 1721 | } |
---|
| 1722 | else |
---|
| 1723 | { |
---|
| 1724 | s_h3 = idPrepare(s_mod,(tHomog)FALSE,k+comps_to_add,NULL); |
---|
| 1725 | } |
---|
| 1726 | if (!goodShape) |
---|
| 1727 | { |
---|
| 1728 | for (j=0;j<IDELEMS(s_h3);j++) |
---|
| 1729 | { |
---|
| 1730 | if ((s_h3->m[j] != NULL) && (pMinComp(s_h3->m[j]) > k)) |
---|
| 1731 | pDelete(&(s_h3->m[j])); |
---|
| 1732 | } |
---|
| 1733 | } |
---|
| 1734 | idSkipZeroes(s_h3); |
---|
| 1735 | if (lsmod==0) |
---|
| 1736 | { |
---|
| 1737 | for (j=IDELEMS(s_temp);j>0;j--) |
---|
| 1738 | { |
---|
| 1739 | if (s_temp->m[j-1]!=NULL) |
---|
| 1740 | pShift(&(s_temp->m[j-1]),1); |
---|
| 1741 | } |
---|
| 1742 | } |
---|
| 1743 | if (unit!=NULL) |
---|
| 1744 | { |
---|
| 1745 | for(j = 0;j<comps_to_add;j++) |
---|
| 1746 | { |
---|
| 1747 | p = s_temp->m[j]; |
---|
| 1748 | if (p!=NULL) |
---|
| 1749 | { |
---|
| 1750 | while (pNext(p)!=NULL) pIter(p); |
---|
| 1751 | pNext(p) = pOne(); |
---|
| 1752 | pIter(p); |
---|
| 1753 | pSetComp(p,1+j+k); |
---|
| 1754 | pSetmComp(p); |
---|
| 1755 | p = pNeg(p); |
---|
| 1756 | } |
---|
| 1757 | } |
---|
| 1758 | } |
---|
| 1759 | ideal s_result = kNF(s_h3,currQuotient,s_temp,k); |
---|
| 1760 | s_result->rank = s_h3->rank; |
---|
| 1761 | ideal s_rest = idInit(IDELEMS(s_result),k); |
---|
| 1762 | idDelete(&s_h3); |
---|
| 1763 | idDelete(&s_temp); |
---|
| 1764 | |
---|
| 1765 | for (j=0;j<IDELEMS(s_result);j++) |
---|
| 1766 | { |
---|
| 1767 | if (s_result->m[j]!=NULL) |
---|
| 1768 | { |
---|
| 1769 | if (pGetComp(s_result->m[j])<=k) |
---|
| 1770 | { |
---|
| 1771 | if (!divide) |
---|
| 1772 | { |
---|
| 1773 | if (isSB) |
---|
| 1774 | { |
---|
| 1775 | WarnS("first module not a standardbasis\n" |
---|
| 1776 | "// ** or second not a proper submodule"); |
---|
| 1777 | } |
---|
| 1778 | else |
---|
[5b02a5] | 1779 | WerrorS("2nd module does not lies in the first"); |
---|
[35aab3] | 1780 | idDelete(&s_result); |
---|
| 1781 | idDelete(&s_rest); |
---|
| 1782 | s_result=idInit(IDELEMS(submod),submod->rank); |
---|
| 1783 | break; |
---|
| 1784 | } |
---|
| 1785 | else |
---|
| 1786 | { |
---|
| 1787 | p = s_rest->m[j] = s_result->m[j]; |
---|
| 1788 | while ((pNext(p)!=NULL) && (pGetComp(pNext(p))<=k)) pIter(p); |
---|
| 1789 | s_result->m[j] = pNext(p); |
---|
| 1790 | pNext(p) = NULL; |
---|
| 1791 | } |
---|
| 1792 | } |
---|
| 1793 | pShift(&(s_result->m[j]),-k); |
---|
| 1794 | pNeg(s_result->m[j]); |
---|
| 1795 | } |
---|
| 1796 | } |
---|
| 1797 | if ((lsmod==0) && (!idIs0(s_rest))) |
---|
| 1798 | { |
---|
| 1799 | for (j=IDELEMS(s_rest);j>0;j--) |
---|
| 1800 | { |
---|
| 1801 | if (s_rest->m[j-1]!=NULL) |
---|
| 1802 | { |
---|
| 1803 | pShift(&(s_rest->m[j-1]),-1); |
---|
| 1804 | s_rest->m[j-1] = s_rest->m[j-1]; |
---|
| 1805 | } |
---|
| 1806 | } |
---|
| 1807 | } |
---|
| 1808 | if(syz_ring!=orig_ring) |
---|
| 1809 | { |
---|
| 1810 | idDelete(&s_mod); |
---|
| 1811 | rChangeCurrRing(orig_ring); |
---|
| 1812 | s_result = idrMoveR_NoSort(s_result, syz_ring); |
---|
| 1813 | s_rest = idrMoveR_NoSort(s_rest, syz_ring); |
---|
| 1814 | rKill(syz_ring); |
---|
| 1815 | } |
---|
| 1816 | if (rest!=NULL) |
---|
| 1817 | *rest = s_rest; |
---|
| 1818 | else |
---|
| 1819 | idDelete(&s_rest); |
---|
| 1820 | //idPrint(s_result); |
---|
| 1821 | if (unit!=NULL) |
---|
| 1822 | { |
---|
| 1823 | *unit=mpNew(comps_to_add,comps_to_add); |
---|
| 1824 | int i; |
---|
| 1825 | for(i=0;i<IDELEMS(s_result);i++) |
---|
| 1826 | { |
---|
| 1827 | poly p=s_result->m[i]; |
---|
| 1828 | poly q=NULL; |
---|
| 1829 | while(p!=NULL) |
---|
| 1830 | { |
---|
| 1831 | if(pGetComp(p)<=comps_to_add) |
---|
| 1832 | { |
---|
| 1833 | pSetComp(p,0); |
---|
| 1834 | if (q!=NULL) |
---|
| 1835 | { |
---|
| 1836 | pNext(q)=pNext(p); |
---|
| 1837 | } |
---|
| 1838 | else |
---|
| 1839 | { |
---|
| 1840 | pIter(s_result->m[i]); |
---|
| 1841 | } |
---|
| 1842 | pNext(p)=NULL; |
---|
| 1843 | MATELEM(*unit,i+1,i+1)=pAdd(MATELEM(*unit,i+1,i+1),p); |
---|
| 1844 | if(q!=NULL) p=pNext(q); |
---|
| 1845 | else p=s_result->m[i]; |
---|
| 1846 | } |
---|
| 1847 | else |
---|
| 1848 | { |
---|
| 1849 | q=p; |
---|
| 1850 | pIter(p); |
---|
| 1851 | } |
---|
| 1852 | } |
---|
| 1853 | pShift(&s_result->m[i],-comps_to_add); |
---|
| 1854 | } |
---|
| 1855 | } |
---|
| 1856 | return s_result; |
---|
| 1857 | } |
---|
| 1858 | |
---|
| 1859 | /*2 |
---|
| 1860 | *computes division of P by Q with remainder up to (w-weighted) degree n |
---|
| 1861 | *P, Q, and w are not changed |
---|
| 1862 | */ |
---|
| 1863 | void idLiftW(ideal P,ideal Q,int n,matrix &T, ideal &R,short *w) |
---|
| 1864 | { |
---|
[62dd9b] | 1865 | long N=0; |
---|
[35aab3] | 1866 | int i; |
---|
| 1867 | for(i=IDELEMS(Q)-1;i>=0;i--) |
---|
| 1868 | if(w==NULL) |
---|
| 1869 | N=si_max(N,pDeg(Q->m[i])); |
---|
| 1870 | else |
---|
| 1871 | N=si_max(N,pDegW(Q->m[i],w)); |
---|
| 1872 | N+=n; |
---|
| 1873 | |
---|
| 1874 | T=mpNew(IDELEMS(Q),IDELEMS(P)); |
---|
| 1875 | R=idInit(IDELEMS(P),P->rank); |
---|
| 1876 | |
---|
| 1877 | for(i=IDELEMS(P)-1;i>=0;i--) |
---|
| 1878 | { |
---|
| 1879 | poly p; |
---|
| 1880 | if(w==NULL) |
---|
| 1881 | p=ppJet(P->m[i],N); |
---|
| 1882 | else |
---|
| 1883 | p=ppJetW(P->m[i],N,w); |
---|
| 1884 | |
---|
| 1885 | int j=IDELEMS(Q)-1; |
---|
| 1886 | while(p!=NULL) |
---|
| 1887 | { |
---|
| 1888 | if(pDivisibleBy(Q->m[j],p)) |
---|
| 1889 | { |
---|
| 1890 | poly p0=pDivideM(pHead(p),pHead(Q->m[j])); |
---|
| 1891 | if(w==NULL) |
---|
| 1892 | p=pJet(pSub(p,ppMult_mm(Q->m[j],p0)),N); |
---|
| 1893 | else |
---|
| 1894 | p=pJetW(pSub(p,ppMult_mm(Q->m[j],p0)),N,w); |
---|
| 1895 | pNormalize(p); |
---|
| 1896 | if(w==NULL&&pDeg(p0)>n||w!=NULL&&pDegW(p0,w)>n) |
---|
| 1897 | pDelete(&p0); |
---|
| 1898 | else |
---|
| 1899 | MATELEM(T,j+1,i+1)=pAdd(MATELEM(T,j+1,i+1),p0); |
---|
| 1900 | j=IDELEMS(Q)-1; |
---|
| 1901 | } |
---|
| 1902 | else |
---|
| 1903 | { |
---|
| 1904 | if(j==0) |
---|
| 1905 | { |
---|
| 1906 | poly p0=p; |
---|
| 1907 | pIter(p); |
---|
| 1908 | pNext(p0)=NULL; |
---|
| 1909 | if(w==NULL&&pDeg(p0)>n||w!=NULL&&pDegW(p0,w)>n) |
---|
| 1910 | pDelete(&p0); |
---|
| 1911 | else |
---|
| 1912 | R->m[i]=pAdd(R->m[i],p0); |
---|
| 1913 | j=IDELEMS(Q)-1; |
---|
| 1914 | } |
---|
| 1915 | else |
---|
| 1916 | j--; |
---|
| 1917 | } |
---|
| 1918 | } |
---|
| 1919 | } |
---|
| 1920 | } |
---|
| 1921 | |
---|
| 1922 | /*2 |
---|
[e90187] | 1923 | *computes the quotient of h1,h2 : internal routine for idQuot |
---|
| 1924 | *BEWARE: the returned ideals may contain incorrectly ordered polys ! |
---|
[35aab3] | 1925 | * |
---|
| 1926 | */ |
---|
| 1927 | static ideal idInitializeQuot (ideal h1, ideal h2, BOOLEAN h1IsStb, |
---|
| 1928 | BOOLEAN *addOnlyOne, int *kkmax) |
---|
| 1929 | { |
---|
| 1930 | ideal temph1; |
---|
| 1931 | poly p,q = NULL; |
---|
| 1932 | int i,l,ll,k,kkk,kmax; |
---|
| 1933 | int j = 0; |
---|
| 1934 | int k1 = idRankFreeModule(h1); |
---|
| 1935 | int k2 = idRankFreeModule(h2); |
---|
| 1936 | tHomog hom=isNotHomog; |
---|
| 1937 | |
---|
| 1938 | k=si_max(k1,k2); |
---|
| 1939 | if (k==0) |
---|
| 1940 | k = 1; |
---|
| 1941 | if ((k2==0) && (k>1)) *addOnlyOne = FALSE; |
---|
| 1942 | |
---|
| 1943 | intvec * weights; |
---|
| 1944 | hom = (tHomog)idHomModule(h1,currQuotient,&weights); |
---|
| 1945 | if (addOnlyOne && (!h1IsStb)) |
---|
| 1946 | temph1 = kStd(h1,currQuotient,hom,&weights,NULL); |
---|
| 1947 | else |
---|
| 1948 | temph1 = idCopy(h1); |
---|
| 1949 | if (weights!=NULL) delete weights; |
---|
| 1950 | idTest(temph1); |
---|
| 1951 | /*--- making a single vector from h2 ---------------------*/ |
---|
| 1952 | for (i=0; i<IDELEMS(h2); i++) |
---|
| 1953 | { |
---|
| 1954 | if (h2->m[i] != NULL) |
---|
| 1955 | { |
---|
| 1956 | p = pCopy(h2->m[i]); |
---|
| 1957 | if (k2 == 0) |
---|
| 1958 | pShift(&p,j*k+1); |
---|
| 1959 | else |
---|
| 1960 | pShift(&p,j*k); |
---|
| 1961 | q = pAdd(q,p); |
---|
| 1962 | j++; |
---|
| 1963 | } |
---|
| 1964 | } |
---|
| 1965 | *kkmax = kmax = j*k+1; |
---|
| 1966 | /*--- adding a monomial for the result (syzygy) ----------*/ |
---|
| 1967 | p = q; |
---|
| 1968 | while (pNext(p)!=NULL) pIter(p); |
---|
| 1969 | pNext(p) = pOne(); |
---|
| 1970 | pIter(p); |
---|
| 1971 | pSetComp(p,kmax); |
---|
| 1972 | pSetmComp(p); |
---|
| 1973 | /*--- constructing the big matrix ------------------------*/ |
---|
| 1974 | ideal h4 = idInit(16,kmax+k-1); |
---|
| 1975 | h4->m[0] = q; |
---|
| 1976 | if (k2 == 0) |
---|
| 1977 | { |
---|
| 1978 | if (k > IDELEMS(h4)) |
---|
| 1979 | { |
---|
| 1980 | pEnlargeSet(&(h4->m),IDELEMS(h4),k-IDELEMS(h4)); |
---|
| 1981 | IDELEMS(h4) = k; |
---|
| 1982 | } |
---|
| 1983 | for (i=1; i<k; i++) |
---|
| 1984 | { |
---|
| 1985 | p = pCopy_noCheck(h4->m[i-1]); |
---|
| 1986 | pShift(&p,1); |
---|
| 1987 | h4->m[i] = p; |
---|
| 1988 | } |
---|
| 1989 | } |
---|
| 1990 | |
---|
| 1991 | kkk = IDELEMS(h4); |
---|
| 1992 | i = IDELEMS(temph1); |
---|
| 1993 | while ((i>0) && (temph1->m[i-1]==NULL)) i--; |
---|
| 1994 | for (l=0; l<i; l++) |
---|
| 1995 | { |
---|
| 1996 | if(temph1->m[l]!=NULL) |
---|
| 1997 | { |
---|
| 1998 | for (ll=0; ll<j; ll++) |
---|
| 1999 | { |
---|
| 2000 | p = pCopy(temph1->m[l]); |
---|
| 2001 | if (k1 == 0) |
---|
| 2002 | pShift(&p,ll*k+1); |
---|
| 2003 | else |
---|
| 2004 | pShift(&p,ll*k); |
---|
| 2005 | if (kkk >= IDELEMS(h4)) |
---|
| 2006 | { |
---|
| 2007 | pEnlargeSet(&(h4->m),IDELEMS(h4),16); |
---|
| 2008 | IDELEMS(h4) += 16; |
---|
| 2009 | } |
---|
| 2010 | h4->m[kkk] = p; |
---|
| 2011 | kkk++; |
---|
| 2012 | } |
---|
| 2013 | } |
---|
| 2014 | } |
---|
| 2015 | /*--- if h2 goes in as single vector - the h1-part is just SB ---*/ |
---|
| 2016 | if (*addOnlyOne) |
---|
| 2017 | { |
---|
| 2018 | p = h4->m[0]; |
---|
| 2019 | for (i=0;i<IDELEMS(h4)-1;i++) |
---|
| 2020 | { |
---|
| 2021 | h4->m[i] = h4->m[i+1]; |
---|
| 2022 | } |
---|
| 2023 | h4->m[IDELEMS(h4)-1] = p; |
---|
| 2024 | idSkipZeroes(h4); |
---|
| 2025 | test |= Sy_bit(OPT_SB_1); |
---|
| 2026 | } |
---|
| 2027 | idDelete(&temph1); |
---|
| 2028 | return h4; |
---|
| 2029 | } |
---|
| 2030 | /*2 |
---|
| 2031 | *computes the quotient of h1,h2 |
---|
| 2032 | */ |
---|
| 2033 | ideal idQuot (ideal h1, ideal h2, BOOLEAN h1IsStb, BOOLEAN resultIsIdeal) |
---|
| 2034 | { |
---|
| 2035 | // first check for special case h1:(0) |
---|
| 2036 | if (idIs0(h2)) |
---|
| 2037 | { |
---|
| 2038 | ideal res; |
---|
| 2039 | if (resultIsIdeal) |
---|
| 2040 | { |
---|
| 2041 | res = idInit(1,1); |
---|
| 2042 | res->m[0] = pOne(); |
---|
| 2043 | } |
---|
| 2044 | else |
---|
| 2045 | res = idFreeModule(h1->rank); |
---|
| 2046 | return res; |
---|
| 2047 | } |
---|
| 2048 | BITSET old_test=test; |
---|
| 2049 | poly p,q = NULL; |
---|
| 2050 | int i,l,ll,k,kkk,kmax; |
---|
| 2051 | BOOLEAN addOnlyOne=TRUE; |
---|
| 2052 | tHomog hom=isNotHomog; |
---|
| 2053 | intvec * weights1; |
---|
| 2054 | |
---|
| 2055 | ideal s_h4 = idInitializeQuot (h1,h2,h1IsStb,&addOnlyOne,&kmax); |
---|
| 2056 | |
---|
| 2057 | hom = (tHomog)idHomModule(s_h4,currQuotient,&weights1); |
---|
| 2058 | |
---|
| 2059 | ring orig_ring=currRing; |
---|
| 2060 | ring syz_ring=rCurrRingAssure_SyzComp(); |
---|
| 2061 | rSetSyzComp(kmax-1); |
---|
| 2062 | if (orig_ring!=syz_ring) |
---|
| 2063 | // s_h4 = idrMoveR_NoSort(s_h4,orig_ring); |
---|
| 2064 | s_h4 = idrMoveR(s_h4,orig_ring); |
---|
| 2065 | idTest(s_h4); |
---|
| 2066 | ideal s_h3; |
---|
| 2067 | if (addOnlyOne) |
---|
| 2068 | { |
---|
| 2069 | s_h3 = kStd(s_h4,currQuotient,hom,&weights1,NULL,kmax-1,IDELEMS(s_h4)-1); |
---|
| 2070 | } |
---|
| 2071 | else |
---|
| 2072 | { |
---|
| 2073 | s_h3 = kStd(s_h4,currQuotient,hom,&weights1,NULL,kmax-1); |
---|
| 2074 | } |
---|
| 2075 | idTest(s_h3); |
---|
| 2076 | if (weights1!=NULL) delete weights1; |
---|
| 2077 | idDelete(&s_h4); |
---|
| 2078 | |
---|
| 2079 | |
---|
| 2080 | for (i=0;i<IDELEMS(s_h3);i++) |
---|
| 2081 | { |
---|
| 2082 | if ((s_h3->m[i]!=NULL) && (pGetComp(s_h3->m[i])>=kmax)) |
---|
| 2083 | { |
---|
| 2084 | if (resultIsIdeal) |
---|
| 2085 | pShift(&s_h3->m[i],-kmax); |
---|
| 2086 | else |
---|
| 2087 | pShift(&s_h3->m[i],-kmax+1); |
---|
| 2088 | } |
---|
| 2089 | else |
---|
| 2090 | pDelete(&s_h3->m[i]); |
---|
| 2091 | } |
---|
| 2092 | if (resultIsIdeal) |
---|
| 2093 | s_h3->rank = 1; |
---|
| 2094 | else |
---|
| 2095 | s_h3->rank = h1->rank; |
---|
| 2096 | if(syz_ring!=orig_ring) |
---|
| 2097 | { |
---|
| 2098 | // pDelete(&q); |
---|
| 2099 | rChangeCurrRing(orig_ring); |
---|
| 2100 | s_h3 = idrMoveR_NoSort(s_h3, syz_ring); |
---|
| 2101 | rKill(syz_ring); |
---|
| 2102 | } |
---|
| 2103 | idSkipZeroes(s_h3); |
---|
| 2104 | test = old_test; |
---|
| 2105 | idTest(s_h3); |
---|
| 2106 | return s_h3; |
---|
| 2107 | } |
---|
| 2108 | |
---|
| 2109 | /*2 |
---|
| 2110 | *computes recursively all monomials of a certain degree |
---|
| 2111 | *in every step the actvar-th entry in the exponential |
---|
| 2112 | *vector is incremented and the other variables are |
---|
| 2113 | *computed by recursive calls of makemonoms |
---|
| 2114 | *if the last variable is reached, the difference to the |
---|
| 2115 | *degree is computed directly |
---|
| 2116 | *vars is the number variables |
---|
| 2117 | *actvar is the actual variable to handle |
---|
| 2118 | *deg is the degree of the monomials to compute |
---|
| 2119 | *monomdeg is the actual degree of the monomial in consideration |
---|
| 2120 | */ |
---|
| 2121 | static void makemonoms(int vars,int actvar,int deg,int monomdeg) |
---|
| 2122 | { |
---|
| 2123 | poly p; |
---|
| 2124 | int i=0; |
---|
| 2125 | |
---|
| 2126 | if ((idpowerpoint == 0) && (actvar ==1)) |
---|
| 2127 | { |
---|
| 2128 | idpower[idpowerpoint] = pOne(); |
---|
| 2129 | monomdeg = 0; |
---|
| 2130 | } |
---|
| 2131 | while (i<=deg) |
---|
| 2132 | { |
---|
| 2133 | if (deg == monomdeg) |
---|
| 2134 | { |
---|
| 2135 | pSetm(idpower[idpowerpoint]); |
---|
| 2136 | idpowerpoint++; |
---|
| 2137 | return; |
---|
| 2138 | } |
---|
| 2139 | if (actvar == vars) |
---|
| 2140 | { |
---|
| 2141 | pSetExp(idpower[idpowerpoint],actvar,deg-monomdeg); |
---|
| 2142 | pSetm(idpower[idpowerpoint]); |
---|
| 2143 | pTest(idpower[idpowerpoint]); |
---|
| 2144 | idpowerpoint++; |
---|
| 2145 | return; |
---|
| 2146 | } |
---|
| 2147 | else |
---|
| 2148 | { |
---|
| 2149 | p = pCopy(idpower[idpowerpoint]); |
---|
| 2150 | makemonoms(vars,actvar+1,deg,monomdeg); |
---|
| 2151 | idpower[idpowerpoint] = p; |
---|
| 2152 | } |
---|
| 2153 | monomdeg++; |
---|
| 2154 | pSetExp(idpower[idpowerpoint],actvar,pGetExp(idpower[idpowerpoint],actvar)+1); |
---|
| 2155 | pSetm(idpower[idpowerpoint]); |
---|
| 2156 | pTest(idpower[idpowerpoint]); |
---|
| 2157 | i++; |
---|
| 2158 | } |
---|
| 2159 | } |
---|
| 2160 | |
---|
| 2161 | /*2 |
---|
| 2162 | *returns the deg-th power of the maximal ideal of 0 |
---|
| 2163 | */ |
---|
| 2164 | ideal idMaxIdeal(int deg) |
---|
| 2165 | { |
---|
| 2166 | if (deg < 0) |
---|
| 2167 | { |
---|
| 2168 | WarnS("maxideal: power must be non-negative"); |
---|
| 2169 | } |
---|
| 2170 | if (deg < 1) |
---|
| 2171 | { |
---|
| 2172 | ideal I=idInit(1,1); |
---|
| 2173 | I->m[0]=pOne(); |
---|
| 2174 | return I; |
---|
| 2175 | } |
---|
| 2176 | if (deg == 1) |
---|
| 2177 | { |
---|
| 2178 | return idMaxIdeal(); |
---|
| 2179 | } |
---|
| 2180 | |
---|
| 2181 | int vars = currRing->N; |
---|
| 2182 | int i = binom(vars+deg-1,deg); |
---|
| 2183 | if (i<=0) return idInit(1,1); |
---|
| 2184 | ideal id=idInit(i,1); |
---|
| 2185 | idpower = id->m; |
---|
| 2186 | idpowerpoint = 0; |
---|
| 2187 | makemonoms(vars,1,deg,0); |
---|
| 2188 | idpower = NULL; |
---|
| 2189 | idpowerpoint = 0; |
---|
| 2190 | return id; |
---|
| 2191 | } |
---|
| 2192 | |
---|
| 2193 | /*2 |
---|
| 2194 | *computes recursively all generators of a certain degree |
---|
| 2195 | *of the ideal "givenideal" |
---|
| 2196 | *elms is the number elements in the given ideal |
---|
| 2197 | *actelm is the actual element to handle |
---|
| 2198 | *deg is the degree of the power to compute |
---|
| 2199 | *gendeg is the actual degree of the generator in consideration |
---|
| 2200 | */ |
---|
| 2201 | static void makepotence(int elms,int actelm,int deg,int gendeg) |
---|
| 2202 | { |
---|
| 2203 | poly p; |
---|
| 2204 | int i=0; |
---|
| 2205 | |
---|
| 2206 | if ((idpowerpoint == 0) && (actelm ==1)) |
---|
| 2207 | { |
---|
| 2208 | idpower[idpowerpoint] = pOne(); |
---|
| 2209 | gendeg = 0; |
---|
| 2210 | } |
---|
| 2211 | while (i<=deg) |
---|
| 2212 | { |
---|
| 2213 | if (deg == gendeg) |
---|
| 2214 | { |
---|
| 2215 | idpowerpoint++; |
---|
| 2216 | return; |
---|
| 2217 | } |
---|
| 2218 | if (actelm == elms) |
---|
| 2219 | { |
---|
| 2220 | p=pPower(pCopy(givenideal[actelm-1]),deg-gendeg); |
---|
| 2221 | idpower[idpowerpoint]=pMult(idpower[idpowerpoint],p); |
---|
| 2222 | idpowerpoint++; |
---|
| 2223 | return; |
---|
| 2224 | } |
---|
| 2225 | else |
---|
| 2226 | { |
---|
| 2227 | p = pCopy(idpower[idpowerpoint]); |
---|
| 2228 | makepotence(elms,actelm+1,deg,gendeg); |
---|
| 2229 | idpower[idpowerpoint] = p; |
---|
| 2230 | } |
---|
| 2231 | gendeg++; |
---|
| 2232 | idpower[idpowerpoint]=pMult(idpower[idpowerpoint],pCopy(givenideal[actelm-1])); |
---|
| 2233 | i++; |
---|
| 2234 | } |
---|
| 2235 | } |
---|
| 2236 | |
---|
| 2237 | /*2 |
---|
| 2238 | *returns the deg-th power of the ideal gid |
---|
| 2239 | */ |
---|
| 2240 | //ideal idPower(ideal gid,int deg) |
---|
| 2241 | //{ |
---|
| 2242 | // int i; |
---|
| 2243 | // ideal id; |
---|
| 2244 | // |
---|
| 2245 | // if (deg < 1) deg = 1; |
---|
| 2246 | // i = binom(IDELEMS(gid)+deg-1,deg); |
---|
| 2247 | // id=idInit(i,1); |
---|
| 2248 | // idpower = id->m; |
---|
| 2249 | // givenideal = gid->m; |
---|
| 2250 | // idpowerpoint = 0; |
---|
| 2251 | // makepotence(IDELEMS(gid),1,deg,0); |
---|
| 2252 | // idpower = NULL; |
---|
| 2253 | // givenideal = NULL; |
---|
| 2254 | // idpowerpoint = 0; |
---|
| 2255 | // return id; |
---|
| 2256 | //} |
---|
| 2257 | static void idNextPotence(ideal given, ideal result, |
---|
| 2258 | int begin, int end, int deg, int restdeg, poly ap) |
---|
| 2259 | { |
---|
| 2260 | poly p; |
---|
| 2261 | int i; |
---|
| 2262 | |
---|
| 2263 | p = pPower(pCopy(given->m[begin]),restdeg); |
---|
| 2264 | i = result->nrows; |
---|
| 2265 | result->m[i] = pMult(pCopy(ap),p); |
---|
| 2266 | //PrintS("."); |
---|
| 2267 | (result->nrows)++; |
---|
| 2268 | if (result->nrows >= IDELEMS(result)) |
---|
| 2269 | { |
---|
| 2270 | pEnlargeSet(&(result->m),IDELEMS(result),16); |
---|
| 2271 | IDELEMS(result) += 16; |
---|
| 2272 | } |
---|
| 2273 | if (begin == end) return; |
---|
| 2274 | for (i=restdeg-1;i>0;i--) |
---|
| 2275 | { |
---|
| 2276 | p = pPower(pCopy(given->m[begin]),i); |
---|
| 2277 | p = pMult(pCopy(ap),p); |
---|
| 2278 | idNextPotence(given, result, begin+1, end, deg, restdeg-i, p); |
---|
| 2279 | pDelete(&p); |
---|
| 2280 | } |
---|
| 2281 | idNextPotence(given, result, begin+1, end, deg, restdeg, ap); |
---|
| 2282 | } |
---|
| 2283 | |
---|
| 2284 | ideal idPower(ideal given,int exp) |
---|
| 2285 | { |
---|
| 2286 | ideal result,temp; |
---|
| 2287 | poly p1; |
---|
| 2288 | int i; |
---|
| 2289 | |
---|
| 2290 | if (idIs0(given)) return idInit(1,1); |
---|
| 2291 | temp = idCopy(given); |
---|
| 2292 | idSkipZeroes(temp); |
---|
| 2293 | i = binom(IDELEMS(temp)+exp-1,exp); |
---|
| 2294 | result = idInit(i,1); |
---|
| 2295 | result->nrows = 0; |
---|
| 2296 | //Print("ideal contains %d elements\n",i); |
---|
| 2297 | p1=pOne(); |
---|
| 2298 | idNextPotence(temp,result,0,IDELEMS(temp)-1,exp,exp,p1); |
---|
| 2299 | pDelete(&p1); |
---|
| 2300 | idDelete(&temp); |
---|
| 2301 | result->nrows = 1; |
---|
| 2302 | idSkipZeroes(result); |
---|
| 2303 | idDelEquals(result); |
---|
| 2304 | return result; |
---|
| 2305 | } |
---|
| 2306 | |
---|
| 2307 | /*2 |
---|
| 2308 | * eliminate delVar (product of vars) in h1 |
---|
| 2309 | */ |
---|
| 2310 | ideal idElimination (ideal h1,poly delVar,intvec *hilb) |
---|
| 2311 | { |
---|
| 2312 | int i,j=0,k,l; |
---|
| 2313 | ideal h,hh, h3; |
---|
| 2314 | int *ord,*block0,*block1; |
---|
| 2315 | int ordersize=2; |
---|
| 2316 | int **wv; |
---|
| 2317 | tHomog hom; |
---|
| 2318 | intvec * w; |
---|
| 2319 | sip_sring tmpR; |
---|
| 2320 | ring origR = currRing; |
---|
| 2321 | |
---|
| 2322 | if (delVar==NULL) |
---|
| 2323 | { |
---|
| 2324 | return idCopy(h1); |
---|
| 2325 | } |
---|
| 2326 | if (currQuotient!=NULL) |
---|
| 2327 | { |
---|
| 2328 | WerrorS("cannot eliminate in a qring"); |
---|
| 2329 | return idCopy(h1); |
---|
| 2330 | } |
---|
| 2331 | if (idIs0(h1)) return idInit(1,h1->rank); |
---|
| 2332 | #ifdef HAVE_PLURAL |
---|
| 2333 | if (rIsPluralRing(currRing)) |
---|
| 2334 | /* in the NC case, we have to check the admissibility of */ |
---|
| 2335 | /* the subalgebra to be intersected with */ |
---|
| 2336 | { |
---|
[e5fc4d4] | 2337 | if (currRing->nc->type!=nc_skew) /* in (quasi)-commutative algebras every subalgebra is admissible */ |
---|
[35aab3] | 2338 | { |
---|
[ea68ed] | 2339 | if (nc_CheckSubalgebra(delVar,currRing)) |
---|
[35aab3] | 2340 | { |
---|
| 2341 | WerrorS("no elimination is possible: subalgebra is not admissible"); |
---|
| 2342 | return idCopy(h1); |
---|
| 2343 | } |
---|
| 2344 | } |
---|
| 2345 | } |
---|
| 2346 | #endif |
---|
| 2347 | hom=(tHomog)idHomModule(h1,NULL,&w); //sets w to weight vector or NULL |
---|
| 2348 | h3=idInit(16,h1->rank); |
---|
| 2349 | for (k=0;; k++) |
---|
| 2350 | { |
---|
| 2351 | if (currRing->order[k]!=0) ordersize++; |
---|
| 2352 | else break; |
---|
| 2353 | } |
---|
| 2354 | ord=(int*)omAlloc0(ordersize*sizeof(int)); |
---|
| 2355 | block0=(int*)omAlloc(ordersize*sizeof(int)); |
---|
| 2356 | block1=(int*)omAlloc(ordersize*sizeof(int)); |
---|
| 2357 | for (k=0;; k++) |
---|
| 2358 | { |
---|
| 2359 | if (currRing->order[k]!=0) |
---|
| 2360 | { |
---|
| 2361 | block0[k+1] = currRing->block0[k]; |
---|
| 2362 | block1[k+1] = currRing->block1[k]; |
---|
| 2363 | ord[k+1] = currRing->order[k]; |
---|
| 2364 | } |
---|
| 2365 | else |
---|
| 2366 | break; |
---|
| 2367 | } |
---|
| 2368 | block0[0] = 1; |
---|
| 2369 | block1[0] = pVariables; |
---|
| 2370 | wv=(int**) omAlloc0(ordersize*sizeof(int**)); |
---|
| 2371 | memcpy4(wv+1,currRing->wvhdl,(ordersize-1)*sizeof(int**)); |
---|
| 2372 | wv[0]=(int*)omAlloc((pVariables+1)*sizeof(int)); |
---|
| 2373 | memset(wv[0],0,(pVariables+1)*sizeof(int)); |
---|
| 2374 | for (j=0;j<pVariables;j++) |
---|
| 2375 | if (pGetExp(delVar,j+1)!=0) wv[0][j]=1; |
---|
| 2376 | // use this special ordering: like ringorder_a, except that pFDeg, pWeights |
---|
| 2377 | // ignore it |
---|
| 2378 | ord[0] = ringorder_aa; |
---|
| 2379 | |
---|
| 2380 | // fill in tmp ring to get back the data later on |
---|
| 2381 | tmpR = *origR; |
---|
| 2382 | tmpR.order = ord; |
---|
| 2383 | tmpR.block0 = block0; |
---|
| 2384 | tmpR.block1 = block1; |
---|
| 2385 | tmpR.wvhdl = wv; |
---|
| 2386 | rComplete(&tmpR, 1); |
---|
| 2387 | |
---|
[ea68ed] | 2388 | #ifdef HAVE_PLURAL |
---|
[e5fc4d4] | 2389 | /* update nc structure on tmpR */ |
---|
[8ebd1a0] | 2390 | if (rIsPluralRing(currRing)) |
---|
[e5fc4d4] | 2391 | { |
---|
[8ebd1a0] | 2392 | BOOLEAN BAD = FALSE; |
---|
| 2393 | if ( nc_rComplete(origR, &tmpR) ) |
---|
[e5fc4d4] | 2394 | { |
---|
[8ebd1a0] | 2395 | Werror("error in nc_rComplete"); |
---|
| 2396 | BAD = TRUE; |
---|
[e5fc4d4] | 2397 | } |
---|
[8ebd1a0] | 2398 | if (!BAD) |
---|
| 2399 | { |
---|
| 2400 | /* tests the admissibility of the new elim. ordering */ |
---|
| 2401 | if ( nc_CheckOrdCondition( (&tmpR)->nc->D, &tmpR) ) |
---|
| 2402 | { |
---|
| 2403 | Werror("no elimination is possible: ordering condition is violated"); |
---|
| 2404 | BAD = TRUE; |
---|
| 2405 | } |
---|
| 2406 | } |
---|
| 2407 | if (BAD) |
---|
[e5fc4d4] | 2408 | { |
---|
[8ebd1a0] | 2409 | // cleanup |
---|
| 2410 | omFree((ADDRESS)wv[0]); |
---|
| 2411 | omFreeSize((ADDRESS)wv,ordersize*sizeof(int**)); |
---|
| 2412 | omFreeSize((ADDRESS)ord,ordersize*sizeof(int)); |
---|
| 2413 | omFreeSize((ADDRESS)block0,ordersize*sizeof(int)); |
---|
| 2414 | omFreeSize((ADDRESS)block1,ordersize*sizeof(int)); |
---|
| 2415 | rUnComplete(&tmpR); |
---|
| 2416 | if (w!=NULL) |
---|
| 2417 | { |
---|
| 2418 | delete w; |
---|
| 2419 | } |
---|
| 2420 | return idCopy(h1); |
---|
[e5fc4d4] | 2421 | } |
---|
[ea68ed] | 2422 | } |
---|
| 2423 | #endif |
---|
[35aab3] | 2424 | // change into the new ring |
---|
| 2425 | //pChangeRing(pVariables,currRing->OrdSgn,ord,block0,block1,wv); |
---|
| 2426 | rChangeCurrRing(&tmpR); |
---|
[ea68ed] | 2427 | |
---|
[35aab3] | 2428 | h = idInit(IDELEMS(h1),h1->rank); |
---|
| 2429 | // fetch data from the old ring |
---|
| 2430 | for (k=0;k<IDELEMS(h1);k++) h->m[k] = prCopyR( h1->m[k], origR); |
---|
| 2431 | // compute kStd |
---|
| 2432 | hh = kStd(h,NULL,hom,&w,hilb); |
---|
| 2433 | idDelete(&h); |
---|
| 2434 | |
---|
| 2435 | // go back to the original ring |
---|
| 2436 | rChangeCurrRing(origR); |
---|
| 2437 | i = IDELEMS(hh)-1; |
---|
| 2438 | while ((i >= 0) && (hh->m[i] == NULL)) i--; |
---|
| 2439 | j = -1; |
---|
| 2440 | // fetch data from temp ring |
---|
| 2441 | for (k=0; k<=i; k++) |
---|
| 2442 | { |
---|
| 2443 | l=pVariables; |
---|
| 2444 | while ((l>0) && (p_GetExp( hh->m[k],l,&tmpR)*pGetExp(delVar,l)==0)) l--; |
---|
| 2445 | if (l==0) |
---|
| 2446 | { |
---|
| 2447 | j++; |
---|
| 2448 | if (j >= IDELEMS(h3)) |
---|
| 2449 | { |
---|
| 2450 | pEnlargeSet(&(h3->m),IDELEMS(h3),16); |
---|
| 2451 | IDELEMS(h3) += 16; |
---|
| 2452 | } |
---|
| 2453 | h3->m[j] = prCopyR( hh->m[k], &tmpR); |
---|
| 2454 | } |
---|
| 2455 | } |
---|
| 2456 | id_Delete(&hh, &tmpR); |
---|
| 2457 | idSkipZeroes(h3); |
---|
| 2458 | omFree((ADDRESS)wv[0]); |
---|
| 2459 | omFreeSize((ADDRESS)wv,ordersize*sizeof(int**)); |
---|
| 2460 | omFreeSize((ADDRESS)ord,ordersize*sizeof(int)); |
---|
| 2461 | omFreeSize((ADDRESS)block0,ordersize*sizeof(int)); |
---|
| 2462 | omFreeSize((ADDRESS)block1,ordersize*sizeof(int)); |
---|
| 2463 | rUnComplete(&tmpR); |
---|
| 2464 | if (w!=NULL) |
---|
| 2465 | delete w; |
---|
| 2466 | return h3; |
---|
| 2467 | } |
---|
| 2468 | |
---|
| 2469 | #ifdef WITH_OLD_MINOR |
---|
| 2470 | /*2 |
---|
| 2471 | * compute all ar-minors of the matrix a |
---|
| 2472 | */ |
---|
| 2473 | ideal idMinors(matrix a, int ar, ideal R) |
---|
| 2474 | { |
---|
| 2475 | int i,j,k,size; |
---|
| 2476 | int *rowchoise,*colchoise; |
---|
| 2477 | BOOLEAN rowch,colch; |
---|
| 2478 | ideal result; |
---|
| 2479 | matrix tmp; |
---|
| 2480 | poly p,q; |
---|
| 2481 | |
---|
| 2482 | i = binom(a->rows(),ar); |
---|
| 2483 | j = binom(a->cols(),ar); |
---|
| 2484 | |
---|
| 2485 | rowchoise=(int *)omAlloc(ar*sizeof(int)); |
---|
| 2486 | colchoise=(int *)omAlloc(ar*sizeof(int)); |
---|
| 2487 | if ((i>512) || (j>512) || (i*j >512)) size=512; |
---|
| 2488 | else size=i*j; |
---|
| 2489 | result=idInit(size,1); |
---|
| 2490 | tmp=mpNew(ar,ar); |
---|
| 2491 | k = 0; /* the index in result*/ |
---|
| 2492 | idInitChoise(ar,1,a->rows(),&rowch,rowchoise); |
---|
| 2493 | while (!rowch) |
---|
| 2494 | { |
---|
| 2495 | idInitChoise(ar,1,a->cols(),&colch,colchoise); |
---|
| 2496 | while (!colch) |
---|
| 2497 | { |
---|
| 2498 | for (i=1; i<=ar; i++) |
---|
| 2499 | { |
---|
| 2500 | for (j=1; j<=ar; j++) |
---|
| 2501 | { |
---|
| 2502 | MATELEM(tmp,i,j) = MATELEM(a,rowchoise[i-1],colchoise[j-1]); |
---|
| 2503 | } |
---|
| 2504 | } |
---|
| 2505 | p = mpDetBareiss(tmp); |
---|
| 2506 | if (p!=NULL) |
---|
| 2507 | { |
---|
| 2508 | if (R!=NULL) |
---|
| 2509 | { |
---|
| 2510 | q = p; |
---|
| 2511 | p = kNF(R,currQuotient,q); |
---|
| 2512 | pDelete(&q); |
---|
| 2513 | } |
---|
| 2514 | if (p!=NULL) |
---|
| 2515 | { |
---|
| 2516 | if (k>=size) |
---|
| 2517 | { |
---|
| 2518 | pEnlargeSet(&result->m,size,32); |
---|
| 2519 | size += 32; |
---|
| 2520 | } |
---|
| 2521 | result->m[k] = p; |
---|
| 2522 | k++; |
---|
| 2523 | } |
---|
| 2524 | } |
---|
| 2525 | idGetNextChoise(ar,a->cols(),&colch,colchoise); |
---|
| 2526 | } |
---|
| 2527 | idGetNextChoise(ar,a->rows(),&rowch,rowchoise); |
---|
| 2528 | } |
---|
| 2529 | /*delete the matrix tmp*/ |
---|
| 2530 | for (i=1; i<=ar; i++) |
---|
| 2531 | { |
---|
| 2532 | for (j=1; j<=ar; j++) MATELEM(tmp,i,j) = NULL; |
---|
| 2533 | } |
---|
| 2534 | idDelete((ideal*)&tmp); |
---|
| 2535 | if (k==0) |
---|
| 2536 | { |
---|
| 2537 | k=1; |
---|
| 2538 | result->m[0]=NULL; |
---|
| 2539 | } |
---|
| 2540 | omFreeSize((ADDRESS)rowchoise,ar*sizeof(int)); |
---|
| 2541 | omFreeSize((ADDRESS)colchoise,ar*sizeof(int)); |
---|
| 2542 | pEnlargeSet(&result->m,size,k-size); |
---|
| 2543 | IDELEMS(result) = k; |
---|
| 2544 | return (result); |
---|
| 2545 | } |
---|
| 2546 | #else |
---|
| 2547 | /*2 |
---|
| 2548 | * compute all ar-minors of the matrix a |
---|
| 2549 | * the caller of mpRecMin |
---|
| 2550 | * the elements of the result are not in R (if R!=NULL) |
---|
| 2551 | */ |
---|
| 2552 | ideal idMinors(matrix a, int ar, ideal R) |
---|
| 2553 | { |
---|
| 2554 | int elems=0; |
---|
| 2555 | int r=a->nrows,c=a->ncols; |
---|
| 2556 | int i; |
---|
| 2557 | matrix b; |
---|
| 2558 | ideal result,h; |
---|
| 2559 | ring origR; |
---|
| 2560 | sip_sring tmpR; |
---|
| 2561 | Exponent_t bound; |
---|
| 2562 | |
---|
| 2563 | if((ar<=0) || (ar>r) || (ar>c)) |
---|
| 2564 | { |
---|
| 2565 | Werror("%d-th minor, matrix is %dx%d",ar,r,c); |
---|
| 2566 | return NULL; |
---|
| 2567 | } |
---|
| 2568 | h = idMatrix2Module(mpCopy(a)); |
---|
| 2569 | bound = smExpBound(h,c,r,ar); |
---|
| 2570 | idDelete(&h); |
---|
| 2571 | smRingChange(&origR,tmpR,bound); |
---|
| 2572 | b = mpNew(r,c); |
---|
| 2573 | for (i=r*c-1;i>=0;i--) |
---|
| 2574 | { |
---|
| 2575 | if (a->m[i]) |
---|
| 2576 | b->m[i] = prCopyR(a->m[i],origR); |
---|
| 2577 | } |
---|
| 2578 | if (R) R = idrCopyR(R,origR); |
---|
| 2579 | result=idInit(32,1); |
---|
| 2580 | if(ar>1) mpRecMin(ar-1,result,elems,b,r,c,NULL,R); |
---|
| 2581 | else mpMinorToResult(result,elems,b,r,c,R); |
---|
| 2582 | idDelete((ideal *)&b); |
---|
| 2583 | if (R) idDelete(&R); |
---|
| 2584 | idSkipZeroes(result); |
---|
| 2585 | rChangeCurrRing(origR); |
---|
| 2586 | result = idrMoveR(result,&tmpR); |
---|
| 2587 | smRingClean(origR,tmpR); |
---|
| 2588 | idTest(result); |
---|
| 2589 | return result; |
---|
| 2590 | } |
---|
| 2591 | #endif |
---|
| 2592 | |
---|
| 2593 | /*2 |
---|
| 2594 | *skips all zeroes and double elements, searches also for units |
---|
| 2595 | */ |
---|
| 2596 | ideal idCompactify(ideal id) |
---|
| 2597 | { |
---|
| 2598 | int i,j; |
---|
| 2599 | BOOLEAN b=FALSE; |
---|
| 2600 | |
---|
| 2601 | i = IDELEMS(id)-1; |
---|
| 2602 | while ((! b) && (i>=0)) |
---|
| 2603 | { |
---|
| 2604 | b=pIsUnit(id->m[i]); |
---|
| 2605 | i--; |
---|
| 2606 | } |
---|
| 2607 | if (b) |
---|
| 2608 | { |
---|
| 2609 | ideal result=idInit(1,id->rank); |
---|
| 2610 | result->m[0]=pOne(); |
---|
| 2611 | return result; |
---|
| 2612 | } |
---|
| 2613 | else |
---|
| 2614 | { |
---|
| 2615 | ideal result=idCopy(id); |
---|
| 2616 | //if (IDELEMS(result) < 1) |
---|
| 2617 | { |
---|
| 2618 | for (i=1;i<IDELEMS(result);i++) |
---|
| 2619 | { |
---|
| 2620 | if (result->m[i]!=NULL) |
---|
| 2621 | { |
---|
| 2622 | for (j=0;j<i;j++) |
---|
| 2623 | { |
---|
| 2624 | if ((result->m[j]!=NULL) |
---|
| 2625 | && (pComparePolys(result->m[i],result->m[j]))) |
---|
| 2626 | { |
---|
| 2627 | pDelete(&(result->m[j])); |
---|
| 2628 | } |
---|
| 2629 | } |
---|
| 2630 | } |
---|
| 2631 | } |
---|
| 2632 | } |
---|
| 2633 | // else |
---|
| 2634 | // { |
---|
| 2635 | // intvec *v=idSort(result,TRUE); |
---|
| 2636 | // for(i=0;i<IDELEMS(result);i++) |
---|
| 2637 | // (*v)[i]--; |
---|
| 2638 | // for (i=0;i<IDELEMS(result)-1;i++) |
---|
| 2639 | // { |
---|
| 2640 | // if (((*v)[i]>=0) |
---|
| 2641 | // && (result->m[(*v)[i]]!=NULL)) |
---|
| 2642 | // { |
---|
| 2643 | // j=i+1; |
---|
| 2644 | // while ((j<IDELEMS(result)) |
---|
| 2645 | // && ((*v)[j]>=0) |
---|
| 2646 | // && (result->m[(*v)[j]]!=NULL) |
---|
| 2647 | // && (pComparePolys(result->m[(*v)[i]],result->m[(*v)[j]]))) |
---|
| 2648 | // { |
---|
| 2649 | // pDelete(&(result->m[(*v)[j]])); |
---|
| 2650 | // j++; |
---|
| 2651 | // } |
---|
| 2652 | // } |
---|
| 2653 | // } |
---|
| 2654 | // delete v; |
---|
| 2655 | // } |
---|
| 2656 | idSkipZeroes(result); |
---|
| 2657 | return result; |
---|
| 2658 | } |
---|
| 2659 | } |
---|
| 2660 | |
---|
| 2661 | /*2 |
---|
| 2662 | *returns TRUE if id1 is a submodule of id2 |
---|
| 2663 | */ |
---|
| 2664 | BOOLEAN idIsSubModule(ideal id1,ideal id2) |
---|
| 2665 | { |
---|
| 2666 | int i; |
---|
| 2667 | poly p; |
---|
| 2668 | |
---|
| 2669 | if (idIs0(id1)) return TRUE; |
---|
| 2670 | for (i=0;i<IDELEMS(id1);i++) |
---|
| 2671 | { |
---|
| 2672 | if (id1->m[i] != NULL) |
---|
| 2673 | { |
---|
| 2674 | p = kNF(id2,currQuotient,id1->m[i]); |
---|
| 2675 | if (p != NULL) |
---|
| 2676 | { |
---|
| 2677 | pDelete(&p); |
---|
| 2678 | return FALSE; |
---|
| 2679 | } |
---|
| 2680 | } |
---|
| 2681 | } |
---|
| 2682 | return TRUE; |
---|
| 2683 | } |
---|
| 2684 | |
---|
| 2685 | /*2 |
---|
| 2686 | * returns the ideals of initial terms |
---|
| 2687 | */ |
---|
| 2688 | ideal idHead(ideal h) |
---|
| 2689 | { |
---|
| 2690 | ideal m = idInit(IDELEMS(h),h->rank); |
---|
| 2691 | int i; |
---|
| 2692 | |
---|
| 2693 | for (i=IDELEMS(h)-1;i>=0; i--) |
---|
| 2694 | { |
---|
| 2695 | if (h->m[i]!=NULL) m->m[i]=pHead(h->m[i]); |
---|
| 2696 | } |
---|
| 2697 | return m; |
---|
| 2698 | } |
---|
| 2699 | |
---|
| 2700 | ideal idHomogen(ideal h, int varnum) |
---|
| 2701 | { |
---|
| 2702 | ideal m = idInit(IDELEMS(h),h->rank); |
---|
| 2703 | int i; |
---|
| 2704 | |
---|
| 2705 | for (i=IDELEMS(h)-1;i>=0; i--) |
---|
| 2706 | { |
---|
| 2707 | m->m[i]=pHomogen(h->m[i],varnum); |
---|
| 2708 | } |
---|
| 2709 | return m; |
---|
| 2710 | } |
---|
| 2711 | |
---|
| 2712 | /*------------------type conversions----------------*/ |
---|
| 2713 | ideal idVec2Ideal(poly vec) |
---|
| 2714 | { |
---|
| 2715 | ideal result=idInit(1,1); |
---|
| 2716 | omFree((ADDRESS)result->m); |
---|
| 2717 | result->m=NULL; // remove later |
---|
| 2718 | pVec2Polys(vec, &(result->m), &(IDELEMS(result))); |
---|
| 2719 | return result; |
---|
| 2720 | } |
---|
| 2721 | |
---|
| 2722 | // #define NEW_STUFF |
---|
| 2723 | #ifndef NEW_STUFF |
---|
| 2724 | // converts mat to module, destroys mat |
---|
| 2725 | ideal idMatrix2Module(matrix mat) |
---|
| 2726 | { |
---|
| 2727 | int mc=MATCOLS(mat); |
---|
| 2728 | int mr=MATROWS(mat); |
---|
| 2729 | ideal result = idInit(si_max(mc,1),si_max(mr,1)); |
---|
| 2730 | int i,j; |
---|
| 2731 | poly h; |
---|
| 2732 | |
---|
| 2733 | for(j=0;j<mc /*MATCOLS(mat)*/;j++) /* j is also index in result->m */ |
---|
| 2734 | { |
---|
| 2735 | for (i=1;i<=mr /*MATROWS(mat)*/;i++) |
---|
| 2736 | { |
---|
| 2737 | h = MATELEM(mat,i,j+1); |
---|
| 2738 | if (h!=NULL) |
---|
| 2739 | { |
---|
| 2740 | MATELEM(mat,i,j+1)=NULL; |
---|
| 2741 | pSetCompP(h,i); |
---|
| 2742 | result->m[j] = pAdd(result->m[j],h); |
---|
| 2743 | } |
---|
| 2744 | } |
---|
| 2745 | } |
---|
| 2746 | // obachman: need to clean this up |
---|
| 2747 | idDelete((ideal*) &mat); |
---|
| 2748 | return result; |
---|
| 2749 | } |
---|
| 2750 | #else |
---|
| 2751 | |
---|
| 2752 | #include "sbuckets.h" |
---|
| 2753 | |
---|
| 2754 | // converts mat to module, destroys mat |
---|
| 2755 | ideal idMatrix2Module(matrix mat) |
---|
| 2756 | { |
---|
| 2757 | int mc=MATCOLS(mat); |
---|
| 2758 | int mr=MATROWS(mat); |
---|
| 2759 | ideal result = idInit(si_max(mc,1),si_max(mr,1)); |
---|
| 2760 | int i,j, l; |
---|
| 2761 | poly h; |
---|
| 2762 | poly p; |
---|
| 2763 | sBucket_pt bucket = sBucketInit(currRing); |
---|
| 2764 | |
---|
| 2765 | for(j=0;j<mc /*MATCOLS(mat)*/;j++) /* j is also index in result->m */ |
---|
| 2766 | { |
---|
| 2767 | for (i=1;i<=mr /*MATROWS(mat)*/;i++) |
---|
| 2768 | { |
---|
| 2769 | h = MATELEM(mat,i,j+1); |
---|
| 2770 | if (h!=NULL) |
---|
| 2771 | { |
---|
| 2772 | MATELEM(mat,i,j+1)=NULL; |
---|
| 2773 | p_SetCompP(h,i, currRing, &l); |
---|
| 2774 | sBucket_Merge_p(bucket, h, l); |
---|
| 2775 | } |
---|
| 2776 | } |
---|
| 2777 | sBucketClearMerge(bucket, &(result->m[j]), &l); |
---|
| 2778 | } |
---|
| 2779 | |
---|
| 2780 | // obachman: need to clean this up |
---|
| 2781 | idDelete((ideal*) &mat); |
---|
| 2782 | return result; |
---|
| 2783 | } |
---|
| 2784 | #endif |
---|
| 2785 | |
---|
| 2786 | /*2 |
---|
| 2787 | * converts a module into a matrix, destroyes the input |
---|
| 2788 | */ |
---|
| 2789 | matrix idModule2Matrix(ideal mod) |
---|
| 2790 | { |
---|
| 2791 | matrix result = mpNew(mod->rank,IDELEMS(mod)); |
---|
| 2792 | int i,cp; |
---|
| 2793 | poly p,h; |
---|
| 2794 | |
---|
| 2795 | for(i=0;i<IDELEMS(mod);i++) |
---|
| 2796 | { |
---|
| 2797 | p=mod->m[i]; |
---|
| 2798 | mod->m[i]=NULL; |
---|
| 2799 | while (p!=NULL) |
---|
| 2800 | { |
---|
| 2801 | h=p; |
---|
| 2802 | pIter(p); |
---|
| 2803 | pNext(h)=NULL; |
---|
| 2804 | // cp = si_max(1,pGetComp(h)); // if used for ideals too |
---|
| 2805 | cp = pGetComp(h); |
---|
| 2806 | pSetComp(h,0); |
---|
| 2807 | pSetmComp(h); |
---|
| 2808 | #ifdef TEST |
---|
| 2809 | if (cp>mod->rank) |
---|
| 2810 | { |
---|
| 2811 | Print("## inv. rank %d -> %d\n",mod->rank,cp); |
---|
| 2812 | int k,l,o=mod->rank; |
---|
| 2813 | mod->rank=cp; |
---|
| 2814 | matrix d=mpNew(mod->rank,IDELEMS(mod)); |
---|
| 2815 | for (l=1; l<=o; l++) |
---|
| 2816 | { |
---|
| 2817 | for (k=1; k<=IDELEMS(mod); k++) |
---|
| 2818 | { |
---|
| 2819 | MATELEM(d,l,k)=MATELEM(result,l,k); |
---|
| 2820 | MATELEM(result,l,k)=NULL; |
---|
| 2821 | } |
---|
| 2822 | } |
---|
| 2823 | idDelete((ideal *)&result); |
---|
| 2824 | result=d; |
---|
| 2825 | } |
---|
| 2826 | #endif |
---|
| 2827 | MATELEM(result,cp,i+1) = pAdd(MATELEM(result,cp,i+1),h); |
---|
| 2828 | } |
---|
| 2829 | } |
---|
| 2830 | // obachman 10/99: added the following line, otherwise memory leack! |
---|
| 2831 | idDelete(&mod); |
---|
| 2832 | return result; |
---|
| 2833 | } |
---|
| 2834 | |
---|
| 2835 | matrix idModule2formatedMatrix(ideal mod,int rows, int cols) |
---|
| 2836 | { |
---|
| 2837 | matrix result = mpNew(rows,cols); |
---|
| 2838 | int i,cp,r=idRankFreeModule(mod),c=IDELEMS(mod); |
---|
| 2839 | poly p,h; |
---|
| 2840 | |
---|
| 2841 | if (r>rows) r = rows; |
---|
| 2842 | if (c>cols) c = cols; |
---|
| 2843 | for(i=0;i<c;i++) |
---|
| 2844 | { |
---|
| 2845 | p=mod->m[i]; |
---|
| 2846 | mod->m[i]=NULL; |
---|
| 2847 | while (p!=NULL) |
---|
| 2848 | { |
---|
| 2849 | h=p; |
---|
| 2850 | pIter(p); |
---|
| 2851 | pNext(h)=NULL; |
---|
| 2852 | cp = pGetComp(h); |
---|
| 2853 | if (cp<=r) |
---|
| 2854 | { |
---|
| 2855 | pSetComp(h,0); |
---|
| 2856 | pSetmComp(h); |
---|
| 2857 | MATELEM(result,cp,i+1) = pAdd(MATELEM(result,cp,i+1),h); |
---|
| 2858 | } |
---|
| 2859 | else |
---|
| 2860 | pDelete(&h); |
---|
| 2861 | } |
---|
| 2862 | } |
---|
| 2863 | idDelete(&mod); |
---|
| 2864 | return result; |
---|
| 2865 | } |
---|
| 2866 | |
---|
| 2867 | /*2 |
---|
| 2868 | * substitute the n-th variable by the monomial e in id |
---|
| 2869 | * destroy id |
---|
| 2870 | */ |
---|
| 2871 | ideal idSubst(ideal id, int n, poly e) |
---|
| 2872 | { |
---|
| 2873 | int k=MATROWS((matrix)id)*MATCOLS((matrix)id); |
---|
| 2874 | ideal res=(ideal)mpNew(MATROWS((matrix)id),MATCOLS((matrix)id)); |
---|
| 2875 | |
---|
| 2876 | res->rank = id->rank; |
---|
| 2877 | for(k--;k>=0;k--) |
---|
| 2878 | { |
---|
| 2879 | res->m[k]=pSubst(id->m[k],n,e); |
---|
| 2880 | id->m[k]=NULL; |
---|
| 2881 | } |
---|
| 2882 | idDelete(&id); |
---|
| 2883 | return res; |
---|
| 2884 | } |
---|
| 2885 | |
---|
| 2886 | BOOLEAN idHomModule(ideal m, ideal Q, intvec **w) |
---|
| 2887 | { |
---|
| 2888 | if (w!=NULL) *w=NULL; |
---|
| 2889 | if ((Q!=NULL) && (!idHomIdeal(Q,NULL))) return FALSE; |
---|
[43ebb1] | 2890 | if (idIs0(m)) |
---|
| 2891 | { |
---|
[a12776] | 2892 | if (w!=NULL) (*w)=new intvec(m->rank); |
---|
[43ebb1] | 2893 | return TRUE; |
---|
| 2894 | } |
---|
[35aab3] | 2895 | |
---|
| 2896 | int i,j,cmax=2,order=0,ord,* diff,* iscom,diffmin=32000; |
---|
| 2897 | poly p=NULL; |
---|
| 2898 | int length=IDELEMS(m); |
---|
| 2899 | polyset P=m->m; |
---|
| 2900 | polyset F=(polyset)omAlloc(length*sizeof(poly)); |
---|
| 2901 | for (i=length-1;i>=0;i--) |
---|
| 2902 | { |
---|
| 2903 | p=F[i]=P[i]; |
---|
[62dd9b] | 2904 | cmax=si_max(cmax,(int)pMaxComp(p)+1); |
---|
[35aab3] | 2905 | } |
---|
| 2906 | diff = (int *)omAlloc0(cmax*sizeof(int)); |
---|
| 2907 | if (w!=NULL) *w=new intvec(cmax-1); |
---|
| 2908 | iscom = (int *)omAlloc0(cmax*sizeof(int)); |
---|
| 2909 | i=0; |
---|
| 2910 | while (i<=length) |
---|
| 2911 | { |
---|
| 2912 | if (i<length) |
---|
| 2913 | { |
---|
| 2914 | p=F[i]; |
---|
| 2915 | while ((p!=NULL) && (!iscom[pGetComp(p)])) pIter(p); |
---|
| 2916 | } |
---|
| 2917 | if ((p==NULL) && (i<length)) |
---|
| 2918 | { |
---|
| 2919 | i++; |
---|
| 2920 | } |
---|
| 2921 | else |
---|
| 2922 | { |
---|
| 2923 | if (p==NULL) |
---|
| 2924 | { |
---|
| 2925 | i=0; |
---|
| 2926 | while ((i<length) && (F[i]==NULL)) i++; |
---|
| 2927 | if (i>=length) break; |
---|
| 2928 | p = F[i]; |
---|
| 2929 | } |
---|
[d0c9ea] | 2930 | if (pLexOrder && (currRing->order[0]==ringorder_lp)) |
---|
[35aab3] | 2931 | order=pTotaldegree(p); |
---|
| 2932 | else |
---|
| 2933 | // order = p->order; |
---|
[b130fb] | 2934 | order = pFDeg(p,currRing); |
---|
[35aab3] | 2935 | order += diff[pGetComp(p)]; |
---|
| 2936 | p = F[i]; |
---|
| 2937 | //Print("Actual p=F[%d]: ",i);pWrite(p); |
---|
| 2938 | F[i] = NULL; |
---|
| 2939 | i=0; |
---|
| 2940 | } |
---|
| 2941 | while (p!=NULL) |
---|
| 2942 | { |
---|
| 2943 | //if (pLexOrder) |
---|
| 2944 | // ord=pTotaldegree(p); |
---|
| 2945 | //else |
---|
| 2946 | // ord = p->order; |
---|
[b130fb] | 2947 | ord = pFDeg(p,currRing); |
---|
[35aab3] | 2948 | if (!iscom[pGetComp(p)]) |
---|
| 2949 | { |
---|
| 2950 | diff[pGetComp(p)] = order-ord; |
---|
| 2951 | iscom[pGetComp(p)] = 1; |
---|
| 2952 | /* |
---|
| 2953 | *PrintS("new diff: "); |
---|
| 2954 | *for (j=0;j<cmax;j++) Print("%d ",diff[j]); |
---|
| 2955 | *PrintLn(); |
---|
| 2956 | *PrintS("new iscom: "); |
---|
| 2957 | *for (j=0;j<cmax;j++) Print("%d ",iscom[j]); |
---|
| 2958 | *PrintLn(); |
---|
| 2959 | *Print("new set %d, order %d, ord %d, diff %d\n",pGetComp(p),order,ord,diff[pGetComp(p)]); |
---|
| 2960 | */ |
---|
| 2961 | } |
---|
| 2962 | else |
---|
| 2963 | { |
---|
| 2964 | /* |
---|
| 2965 | *PrintS("new diff: "); |
---|
| 2966 | *for (j=0;j<cmax;j++) Print("%d ",diff[j]); |
---|
| 2967 | *PrintLn(); |
---|
| 2968 | *Print("order %d, ord %d, diff %d\n",order,ord,diff[pGetComp(p)]); |
---|
| 2969 | */ |
---|
| 2970 | if (order != ord+diff[pGetComp(p)]) |
---|
| 2971 | { |
---|
| 2972 | omFreeSize((ADDRESS) iscom,cmax*sizeof(int)); |
---|
| 2973 | omFreeSize((ADDRESS) diff,cmax*sizeof(int)); |
---|
| 2974 | omFreeSize((ADDRESS) F,length*sizeof(poly)); |
---|
| 2975 | delete *w;*w=NULL; |
---|
| 2976 | return FALSE; |
---|
| 2977 | } |
---|
| 2978 | } |
---|
| 2979 | pIter(p); |
---|
| 2980 | } |
---|
| 2981 | } |
---|
| 2982 | omFreeSize((ADDRESS) iscom,cmax*sizeof(int)); |
---|
| 2983 | omFreeSize((ADDRESS) F,length*sizeof(poly)); |
---|
| 2984 | for (i=1;i<cmax;i++) (**w)[i-1]=diff[i]; |
---|
| 2985 | for (i=1;i<cmax;i++) |
---|
| 2986 | { |
---|
| 2987 | if (diff[i]<diffmin) diffmin=diff[i]; |
---|
| 2988 | } |
---|
| 2989 | if (w!=NULL) |
---|
| 2990 | { |
---|
| 2991 | for (i=1;i<cmax;i++) |
---|
| 2992 | { |
---|
| 2993 | (**w)[i-1]=diff[i]-diffmin; |
---|
| 2994 | } |
---|
| 2995 | } |
---|
| 2996 | omFreeSize((ADDRESS) diff,cmax*sizeof(int)); |
---|
| 2997 | return TRUE; |
---|
| 2998 | } |
---|
| 2999 | |
---|
[30b8381] | 3000 | BOOLEAN idTestHomModule(ideal m, ideal Q, intvec *w) |
---|
| 3001 | { |
---|
| 3002 | if ((Q!=NULL) && (!idHomIdeal(Q,NULL))) { PrintS(" Q not hom\n"); return FALSE;} |
---|
| 3003 | if (idIs0(m)) return TRUE; |
---|
| 3004 | |
---|
| 3005 | int cmax=-1; |
---|
| 3006 | int i; |
---|
| 3007 | poly p=NULL; |
---|
| 3008 | int length=IDELEMS(m); |
---|
| 3009 | polyset P=m->m; |
---|
| 3010 | for (i=length-1;i>=0;i--) |
---|
| 3011 | { |
---|
| 3012 | p=P[i]; |
---|
| 3013 | if (p!=NULL) cmax=si_max(cmax,(int)pMaxComp(p)+1); |
---|
| 3014 | } |
---|
| 3015 | if (w->length()+1 < cmax) |
---|
| 3016 | { |
---|
| 3017 | // Print("length: %d - %d \n", w->length(),cmax); |
---|
| 3018 | return FALSE; |
---|
| 3019 | } |
---|
| 3020 | pSetModDeg(w); |
---|
| 3021 | for (i=length-1;i>=0;i--) |
---|
| 3022 | { |
---|
| 3023 | p=P[i]; |
---|
| 3024 | poly q=p; |
---|
| 3025 | if (p!=NULL) |
---|
| 3026 | { |
---|
[b130fb] | 3027 | int d=pFDeg(p,currRing); |
---|
[30b8381] | 3028 | loop |
---|
| 3029 | { |
---|
| 3030 | pIter(p); |
---|
| 3031 | if (p==NULL) break; |
---|
[b130fb] | 3032 | if (d!=pFDeg(p,currRing)) |
---|
[30b8381] | 3033 | { |
---|
[42d5aa] | 3034 | //pWrite(q); wrp(p); Print(" -> %d - %d\n",d,pFDeg(p,currRing)); |
---|
[30b8381] | 3035 | return FALSE; |
---|
| 3036 | } |
---|
| 3037 | } |
---|
| 3038 | } |
---|
| 3039 | } |
---|
| 3040 | pSetModDeg(NULL); |
---|
| 3041 | return TRUE; |
---|
| 3042 | } |
---|
| 3043 | |
---|
[35aab3] | 3044 | ideal idJet(ideal i,int d) |
---|
| 3045 | { |
---|
| 3046 | ideal r=idInit((i->nrows)*(i->ncols),i->rank); |
---|
| 3047 | r->nrows = i-> nrows; |
---|
| 3048 | r->ncols = i-> ncols; |
---|
| 3049 | //r->rank = i-> rank; |
---|
| 3050 | int k; |
---|
| 3051 | for(k=(i->nrows)*(i->ncols)-1;k>=0; k--) |
---|
| 3052 | { |
---|
| 3053 | r->m[k]=ppJet(i->m[k],d); |
---|
| 3054 | } |
---|
| 3055 | return r; |
---|
| 3056 | } |
---|
| 3057 | |
---|
| 3058 | ideal idJetW(ideal i,int d, intvec * iv) |
---|
| 3059 | { |
---|
| 3060 | ideal r=idInit(IDELEMS(i),i->rank); |
---|
| 3061 | if (ecartWeights!=NULL) |
---|
| 3062 | { |
---|
| 3063 | WerrorS("cannot compute weighted jets now"); |
---|
| 3064 | } |
---|
| 3065 | else |
---|
| 3066 | { |
---|
| 3067 | short *w=iv2array(iv); |
---|
| 3068 | int k; |
---|
| 3069 | for(k=0; k<IDELEMS(i); k++) |
---|
| 3070 | { |
---|
| 3071 | r->m[k]=ppJetW(i->m[k],d,w); |
---|
| 3072 | } |
---|
| 3073 | omFreeSize((ADDRESS)w,(pVariables+1)*sizeof(short)); |
---|
| 3074 | } |
---|
| 3075 | return r; |
---|
| 3076 | } |
---|
| 3077 | |
---|
| 3078 | int idMinDegW(ideal M,intvec *w) |
---|
| 3079 | { |
---|
| 3080 | int d=-1; |
---|
| 3081 | for(int i=0;i<IDELEMS(M);i++) |
---|
| 3082 | { |
---|
| 3083 | int d0=pMinDeg(M->m[i],w); |
---|
| 3084 | if(-1<d0&&(d0<d||d==-1)) |
---|
| 3085 | d=d0; |
---|
| 3086 | } |
---|
| 3087 | return d; |
---|
| 3088 | } |
---|
| 3089 | |
---|
| 3090 | ideal idSeries(int n,ideal M,matrix U,intvec *w) |
---|
| 3091 | { |
---|
| 3092 | for(int i=IDELEMS(M)-1;i>=0;i--) |
---|
| 3093 | { |
---|
| 3094 | if(U==NULL) |
---|
| 3095 | M->m[i]=pSeries(n,M->m[i],NULL,w); |
---|
| 3096 | else |
---|
| 3097 | { |
---|
| 3098 | M->m[i]=pSeries(n,M->m[i],MATELEM(U,i+1,i+1),w); |
---|
| 3099 | MATELEM(U,i+1,i+1)=NULL; |
---|
| 3100 | } |
---|
| 3101 | } |
---|
| 3102 | if(U!=NULL) |
---|
| 3103 | idDelete((ideal*)&U); |
---|
| 3104 | return M; |
---|
| 3105 | } |
---|
| 3106 | |
---|
| 3107 | matrix idDiff(matrix i, int k) |
---|
| 3108 | { |
---|
| 3109 | int e=MATCOLS(i)*MATROWS(i); |
---|
| 3110 | matrix r=mpNew(MATROWS(i),MATCOLS(i)); |
---|
| 3111 | int j; |
---|
| 3112 | for(j=0; j<e; j++) |
---|
| 3113 | { |
---|
| 3114 | r->m[j]=pDiff(i->m[j],k); |
---|
| 3115 | } |
---|
| 3116 | return r; |
---|
| 3117 | } |
---|
| 3118 | |
---|
| 3119 | matrix idDiffOp(ideal I, ideal J,BOOLEAN multiply) |
---|
| 3120 | { |
---|
| 3121 | matrix r=mpNew(IDELEMS(I),IDELEMS(J)); |
---|
| 3122 | int i,j; |
---|
| 3123 | for(i=0; i<IDELEMS(I); i++) |
---|
| 3124 | { |
---|
| 3125 | for(j=0; j<IDELEMS(J); j++) |
---|
| 3126 | { |
---|
| 3127 | MATELEM(r,i+1,j+1)=pDiffOp(I->m[i],J->m[j],multiply); |
---|
| 3128 | } |
---|
| 3129 | } |
---|
| 3130 | return r; |
---|
| 3131 | } |
---|
| 3132 | |
---|
| 3133 | /*3 |
---|
| 3134 | *handles for some ideal operations the ring/syzcomp managment |
---|
| 3135 | *returns all syzygies (componentwise-)shifted by -syzcomp |
---|
| 3136 | *or -syzcomp-1 (in case of ideals as input) |
---|
| 3137 | static ideal idHandleIdealOp(ideal arg,int syzcomp,int isIdeal=FALSE) |
---|
| 3138 | { |
---|
| 3139 | ring orig_ring=currRing; |
---|
| 3140 | ring syz_ring=rCurrRingAssure_SyzComp(); |
---|
| 3141 | rSetSyzComp(length); |
---|
| 3142 | |
---|
| 3143 | ideal s_temp; |
---|
| 3144 | if (orig_ring!=syz_ring) |
---|
| 3145 | s_temp=idrMoveR_NoSort(arg,orig_ring); |
---|
| 3146 | else |
---|
| 3147 | s_temp=arg; |
---|
| 3148 | |
---|
| 3149 | ideal s_temp1 = kStd(s_temp,currQuotient,testHomog,&w,NULL,length); |
---|
| 3150 | if (w!=NULL) delete w; |
---|
| 3151 | |
---|
| 3152 | if (syz_ring!=orig_ring) |
---|
| 3153 | { |
---|
| 3154 | idDelete(&s_temp); |
---|
| 3155 | rChangeCurrRing(orig_ring); |
---|
| 3156 | } |
---|
| 3157 | |
---|
| 3158 | idDelete(&temp); |
---|
| 3159 | ideal temp1=idRingCopy(s_temp1,syz_ring); |
---|
| 3160 | |
---|
| 3161 | if (syz_ring!=orig_ring) |
---|
| 3162 | { |
---|
| 3163 | rChangeCurrRing(syz_ring); |
---|
| 3164 | idDelete(&s_temp1); |
---|
| 3165 | rChangeCurrRing(orig_ring); |
---|
| 3166 | rKill(syz_ring); |
---|
| 3167 | } |
---|
| 3168 | |
---|
| 3169 | for (i=0;i<IDELEMS(temp1);i++) |
---|
| 3170 | { |
---|
| 3171 | if ((temp1->m[i]!=NULL) |
---|
| 3172 | && (pGetComp(temp1->m[i])<=length)) |
---|
| 3173 | { |
---|
| 3174 | pDelete(&(temp1->m[i])); |
---|
| 3175 | } |
---|
| 3176 | else |
---|
| 3177 | { |
---|
| 3178 | pShift(&(temp1->m[i]),-length); |
---|
| 3179 | } |
---|
| 3180 | } |
---|
| 3181 | temp1->rank = rk; |
---|
| 3182 | idSkipZeroes(temp1); |
---|
| 3183 | |
---|
| 3184 | return temp1; |
---|
| 3185 | } |
---|
| 3186 | */ |
---|
| 3187 | /*2 |
---|
| 3188 | * represents (h1+h2)/h2=h1/(h1 intersect h2) |
---|
| 3189 | */ |
---|
[cf108d] | 3190 | //ideal idModulo (ideal h2,ideal h1) |
---|
| 3191 | ideal idModulo (ideal h2,ideal h1, tHomog hom, intvec ** w) |
---|
[35aab3] | 3192 | { |
---|
[cf108d] | 3193 | intvec *wtmp=NULL; |
---|
| 3194 | |
---|
[35aab3] | 3195 | int i,j,k,rk,flength=0,slength,length; |
---|
| 3196 | poly p,q; |
---|
| 3197 | |
---|
| 3198 | if (idIs0(h2)) |
---|
| 3199 | return idFreeModule(si_max(1,h2->ncols)); |
---|
| 3200 | if (!idIs0(h1)) |
---|
| 3201 | flength = idRankFreeModule(h1); |
---|
| 3202 | slength = idRankFreeModule(h2); |
---|
| 3203 | length = si_max(flength,slength); |
---|
| 3204 | if (length==0) |
---|
| 3205 | { |
---|
| 3206 | length = 1; |
---|
| 3207 | } |
---|
| 3208 | ideal temp = idInit(IDELEMS(h2),length+IDELEMS(h2)); |
---|
[cf108d] | 3209 | if ((w!=NULL)&&((*w)!=NULL)) |
---|
| 3210 | { |
---|
| 3211 | //Print("input weights:");(*w)->show(1);PrintLn(); |
---|
| 3212 | int d; |
---|
| 3213 | int k; |
---|
| 3214 | wtmp=new intvec(length+IDELEMS(h2)); |
---|
| 3215 | for (i=0;i<length;i++) |
---|
| 3216 | ((*wtmp)[i])=(**w)[i]; |
---|
| 3217 | for (i=0;i<IDELEMS(h2);i++) |
---|
| 3218 | { |
---|
[43ebb1] | 3219 | poly p=h2->m[i]; |
---|
| 3220 | if (p!=NULL) |
---|
| 3221 | { |
---|
| 3222 | d = pDeg(p); |
---|
| 3223 | k= pGetComp(p); |
---|
| 3224 | if (slength>0) k--; |
---|
| 3225 | d +=((**w)[k]); |
---|
| 3226 | ((*wtmp)[i+length]) = d; |
---|
| 3227 | } |
---|
[cf108d] | 3228 | } |
---|
| 3229 | //Print("weights:");wtmp->show(1);PrintLn(); |
---|
| 3230 | } |
---|
[35aab3] | 3231 | for (i=0;i<IDELEMS(h2);i++) |
---|
| 3232 | { |
---|
| 3233 | temp->m[i] = pCopy(h2->m[i]); |
---|
| 3234 | q = pOne(); |
---|
| 3235 | pSetComp(q,i+1+length); |
---|
| 3236 | pSetmComp(q); |
---|
| 3237 | if(temp->m[i]!=NULL) |
---|
| 3238 | { |
---|
| 3239 | if (slength==0) pShift(&(temp->m[i]),1); |
---|
| 3240 | p = temp->m[i]; |
---|
| 3241 | while (pNext(p)!=NULL) pIter(p); |
---|
| 3242 | pNext(p) = q; |
---|
| 3243 | } |
---|
| 3244 | else |
---|
| 3245 | temp->m[i]=q; |
---|
| 3246 | } |
---|
| 3247 | rk = k = IDELEMS(h2); |
---|
| 3248 | if (!idIs0(h1)) |
---|
| 3249 | { |
---|
| 3250 | pEnlargeSet(&(temp->m),IDELEMS(temp),IDELEMS(h1)); |
---|
| 3251 | IDELEMS(temp) += IDELEMS(h1); |
---|
| 3252 | for (i=0;i<IDELEMS(h1);i++) |
---|
| 3253 | { |
---|
| 3254 | if (h1->m[i]!=NULL) |
---|
| 3255 | { |
---|
| 3256 | temp->m[k] = pCopy(h1->m[i]); |
---|
| 3257 | if (flength==0) pShift(&(temp->m[k]),1); |
---|
| 3258 | k++; |
---|
| 3259 | } |
---|
| 3260 | } |
---|
| 3261 | } |
---|
| 3262 | |
---|
| 3263 | ring orig_ring=currRing; |
---|
| 3264 | ring syz_ring=rCurrRingAssure_SyzComp(); |
---|
| 3265 | rSetSyzComp(length); |
---|
| 3266 | ideal s_temp; |
---|
| 3267 | |
---|
| 3268 | if (syz_ring != orig_ring) |
---|
| 3269 | { |
---|
| 3270 | s_temp = idrMoveR_NoSort(temp, orig_ring); |
---|
| 3271 | } |
---|
| 3272 | else |
---|
| 3273 | { |
---|
| 3274 | s_temp = temp; |
---|
| 3275 | } |
---|
| 3276 | |
---|
| 3277 | idTest(s_temp); |
---|
[cf108d] | 3278 | ideal s_temp1 = kStd(s_temp,currQuotient,hom,&wtmp,NULL,length); |
---|
| 3279 | |
---|
| 3280 | //if (wtmp!=NULL) Print("output weights:");wtmp->show(1);PrintLn(); |
---|
| 3281 | if ((w!=NULL) && (*w !=NULL) && (wtmp!=NULL)) |
---|
| 3282 | { |
---|
| 3283 | delete *w; |
---|
| 3284 | *w=new intvec(IDELEMS(h2)); |
---|
| 3285 | for (i=0;i<IDELEMS(h2);i++) |
---|
| 3286 | ((**w)[i])=(*wtmp)[i+length]; |
---|
| 3287 | } |
---|
| 3288 | if (wtmp!=NULL) delete wtmp; |
---|
[35aab3] | 3289 | |
---|
| 3290 | for (i=0;i<IDELEMS(s_temp1);i++) |
---|
| 3291 | { |
---|
| 3292 | if ((s_temp1->m[i]!=NULL) |
---|
| 3293 | && (pGetComp(s_temp1->m[i])<=length)) |
---|
| 3294 | { |
---|
| 3295 | pDelete(&(s_temp1->m[i])); |
---|
| 3296 | } |
---|
| 3297 | else |
---|
| 3298 | { |
---|
| 3299 | pShift(&(s_temp1->m[i]),-length); |
---|
| 3300 | } |
---|
| 3301 | } |
---|
| 3302 | s_temp1->rank = rk; |
---|
| 3303 | idSkipZeroes(s_temp1); |
---|
| 3304 | |
---|
| 3305 | if (syz_ring!=orig_ring) |
---|
| 3306 | { |
---|
| 3307 | rChangeCurrRing(orig_ring); |
---|
| 3308 | s_temp1 = idrMoveR_NoSort(s_temp1, syz_ring); |
---|
| 3309 | rKill(syz_ring); |
---|
| 3310 | // Hmm ... here seems to be a memory leak |
---|
| 3311 | // However, simply deleting it causes memory trouble |
---|
| 3312 | // idDelete(&s_temp); |
---|
| 3313 | } |
---|
| 3314 | else |
---|
| 3315 | { |
---|
| 3316 | idDelete(&temp); |
---|
| 3317 | } |
---|
| 3318 | idTest(s_temp1); |
---|
| 3319 | return s_temp1; |
---|
| 3320 | } |
---|
| 3321 | |
---|
| 3322 | int idElem(ideal F) |
---|
| 3323 | { |
---|
| 3324 | int i=0,j=0; |
---|
| 3325 | |
---|
| 3326 | while(j<IDELEMS(F)) |
---|
| 3327 | { |
---|
| 3328 | if ((F->m)[j]!=NULL) i++; |
---|
| 3329 | j++; |
---|
| 3330 | } |
---|
| 3331 | return i; |
---|
| 3332 | } |
---|
| 3333 | |
---|
| 3334 | /* |
---|
| 3335 | *computes module-weights for liftings of homogeneous modules |
---|
| 3336 | */ |
---|
| 3337 | intvec * idMWLift(ideal mod,intvec * weights) |
---|
| 3338 | { |
---|
| 3339 | if (idIs0(mod)) return new intvec(2); |
---|
| 3340 | int i=IDELEMS(mod); |
---|
| 3341 | while ((i>0) && (mod->m[i-1]==NULL)) i--; |
---|
| 3342 | intvec *result = new intvec(i+1); |
---|
| 3343 | while (i>0) |
---|
| 3344 | { |
---|
[b130fb] | 3345 | (*result)[i]=pFDeg(mod->m[i],currRing)+(*weights)[pGetComp(mod->m[i])]; |
---|
[35aab3] | 3346 | } |
---|
| 3347 | return result; |
---|
| 3348 | } |
---|
| 3349 | |
---|
| 3350 | /*2 |
---|
| 3351 | *sorts the kbase for idCoef* in a special way (lexicographically |
---|
| 3352 | *with x_max,...,x_1) |
---|
| 3353 | */ |
---|
| 3354 | ideal idCreateSpecialKbase(ideal kBase,intvec ** convert) |
---|
| 3355 | { |
---|
| 3356 | int i; |
---|
| 3357 | ideal result; |
---|
| 3358 | |
---|
| 3359 | if (idIs0(kBase)) return NULL; |
---|
| 3360 | result = idInit(IDELEMS(kBase),kBase->rank); |
---|
| 3361 | *convert = idSort(kBase,FALSE); |
---|
| 3362 | for (i=0;i<(*convert)->length();i++) |
---|
| 3363 | { |
---|
| 3364 | result->m[i] = pCopy(kBase->m[(**convert)[i]-1]); |
---|
| 3365 | } |
---|
| 3366 | return result; |
---|
| 3367 | } |
---|
| 3368 | |
---|
| 3369 | /*2 |
---|
| 3370 | *returns the index of a given monom in the list of the special kbase |
---|
| 3371 | */ |
---|
| 3372 | int idIndexOfKBase(poly monom, ideal kbase) |
---|
| 3373 | { |
---|
| 3374 | int j=IDELEMS(kbase); |
---|
| 3375 | |
---|
| 3376 | while ((j>0) && (kbase->m[j-1]==NULL)) j--; |
---|
| 3377 | if (j==0) return -1; |
---|
| 3378 | int i=pVariables; |
---|
| 3379 | while (i>0) |
---|
| 3380 | { |
---|
| 3381 | loop |
---|
| 3382 | { |
---|
| 3383 | if (pGetExp(monom,i)>pGetExp(kbase->m[j-1],i)) return -1; |
---|
| 3384 | if (pGetExp(monom,i)==pGetExp(kbase->m[j-1],i)) break; |
---|
| 3385 | j--; |
---|
| 3386 | if (j==0) return -1; |
---|
| 3387 | } |
---|
| 3388 | if (i==1) |
---|
| 3389 | { |
---|
| 3390 | while(j>0) |
---|
| 3391 | { |
---|
| 3392 | if (pGetComp(monom)==pGetComp(kbase->m[j-1])) return j-1; |
---|
| 3393 | if (pGetComp(monom)>pGetComp(kbase->m[j-1])) return -1; |
---|
| 3394 | j--; |
---|
| 3395 | } |
---|
| 3396 | } |
---|
| 3397 | i--; |
---|
| 3398 | } |
---|
| 3399 | return -1; |
---|
| 3400 | } |
---|
| 3401 | |
---|
| 3402 | /*2 |
---|
| 3403 | *decomposes the monom in a part of coefficients described by the |
---|
| 3404 | *complement of how and a monom in variables occuring in how, the |
---|
| 3405 | *index of which in kbase is returned as integer pos (-1 if it don't |
---|
| 3406 | *exists) |
---|
| 3407 | */ |
---|
| 3408 | poly idDecompose(poly monom, poly how, ideal kbase, int * pos) |
---|
| 3409 | { |
---|
| 3410 | int i; |
---|
| 3411 | poly coeff=pOne(), base=pOne(); |
---|
| 3412 | |
---|
| 3413 | for (i=1;i<=pVariables;i++) |
---|
| 3414 | { |
---|
| 3415 | if (pGetExp(how,i)>0) |
---|
| 3416 | { |
---|
| 3417 | pSetExp(base,i,pGetExp(monom,i)); |
---|
| 3418 | } |
---|
| 3419 | else |
---|
| 3420 | { |
---|
| 3421 | pSetExp(coeff,i,pGetExp(monom,i)); |
---|
| 3422 | } |
---|
| 3423 | } |
---|
| 3424 | pSetComp(base,pGetComp(monom)); |
---|
| 3425 | pSetm(base); |
---|
| 3426 | pSetCoeff(coeff,nCopy(pGetCoeff(monom))); |
---|
| 3427 | pSetm(coeff); |
---|
| 3428 | *pos = idIndexOfKBase(base,kbase); |
---|
| 3429 | if (*pos<0) |
---|
| 3430 | pDelete(&coeff); |
---|
| 3431 | pDelete(&base); |
---|
| 3432 | return coeff; |
---|
| 3433 | } |
---|
| 3434 | |
---|
| 3435 | /*2 |
---|
| 3436 | *returns a matrix A of coefficients with kbase*A=arg |
---|
| 3437 | *if all monomials in variables of how occur in kbase |
---|
| 3438 | *the other are deleted |
---|
| 3439 | */ |
---|
| 3440 | matrix idCoeffOfKBase(ideal arg, ideal kbase, poly how) |
---|
| 3441 | { |
---|
| 3442 | matrix result; |
---|
| 3443 | ideal tempKbase; |
---|
| 3444 | poly p,q; |
---|
| 3445 | intvec * convert; |
---|
| 3446 | int i=IDELEMS(kbase),j=IDELEMS(arg),k,pos; |
---|
| 3447 | #if 0 |
---|
| 3448 | while ((i>0) && (kbase->m[i-1]==NULL)) i--; |
---|
| 3449 | if (idIs0(arg)) |
---|
| 3450 | return mpNew(i,1); |
---|
| 3451 | while ((j>0) && (arg->m[j-1]==NULL)) j--; |
---|
| 3452 | result = mpNew(i,j); |
---|
| 3453 | #else |
---|
| 3454 | result = mpNew(i, j); |
---|
| 3455 | while ((j>0) && (arg->m[j-1]==NULL)) j--; |
---|
| 3456 | #endif |
---|
| 3457 | |
---|
| 3458 | tempKbase = idCreateSpecialKbase(kbase,&convert); |
---|
| 3459 | for (k=0;k<j;k++) |
---|
| 3460 | { |
---|
| 3461 | p = arg->m[k]; |
---|
| 3462 | while (p!=NULL) |
---|
| 3463 | { |
---|
| 3464 | q = idDecompose(p,how,tempKbase,&pos); |
---|
| 3465 | if (pos>=0) |
---|
| 3466 | { |
---|
| 3467 | MATELEM(result,(*convert)[pos],k+1) = |
---|
| 3468 | pAdd(MATELEM(result,(*convert)[pos],k+1),q); |
---|
| 3469 | } |
---|
| 3470 | else |
---|
| 3471 | pDelete(&q); |
---|
| 3472 | pIter(p); |
---|
| 3473 | } |
---|
| 3474 | } |
---|
| 3475 | idDelete(&tempKbase); |
---|
| 3476 | return result; |
---|
| 3477 | } |
---|
| 3478 | |
---|
| 3479 | /*3 |
---|
| 3480 | * searches for units in the components of the module arg and |
---|
| 3481 | * returns the first one |
---|
| 3482 | */ |
---|
| 3483 | static int idReadOutUnits(ideal arg,int* comp) |
---|
| 3484 | { |
---|
| 3485 | if (idIs0(arg)) return -1; |
---|
| 3486 | int i=0,j,rk_arg=idRankFreeModule(arg),generator=-1; |
---|
| 3487 | intvec * componentIsUsed =new intvec(rk_arg+1); |
---|
| 3488 | poly p,q; |
---|
| 3489 | |
---|
| 3490 | while ((i<IDELEMS(arg)) && (generator<0)) |
---|
| 3491 | { |
---|
| 3492 | for (j=rk_arg;j>=0;j--) |
---|
| 3493 | (*componentIsUsed)[j]=0; |
---|
| 3494 | p = arg->m[i]; |
---|
| 3495 | while (p!=NULL) |
---|
| 3496 | { |
---|
| 3497 | j = pGetComp(p); |
---|
| 3498 | if ((*componentIsUsed)[j]==0) |
---|
| 3499 | { |
---|
| 3500 | if (pLmIsConstantComp(p)) |
---|
| 3501 | { |
---|
| 3502 | generator = i; |
---|
| 3503 | (*componentIsUsed)[j] = 1; |
---|
| 3504 | } |
---|
| 3505 | else |
---|
| 3506 | { |
---|
| 3507 | (*componentIsUsed)[j] = -1; |
---|
| 3508 | } |
---|
| 3509 | } |
---|
| 3510 | else if ((*componentIsUsed)[j]>0) |
---|
| 3511 | { |
---|
| 3512 | ((*componentIsUsed)[j])++; |
---|
| 3513 | } |
---|
| 3514 | pIter(p); |
---|
| 3515 | } |
---|
| 3516 | i++; |
---|
| 3517 | } |
---|
| 3518 | i = 0; |
---|
| 3519 | *comp = -1; |
---|
| 3520 | for (j=0;j<=rk_arg;j++) |
---|
| 3521 | { |
---|
| 3522 | if ((*componentIsUsed)[j]>0) |
---|
| 3523 | { |
---|
| 3524 | if ((*comp==-1) || ((*componentIsUsed)[j]<i)) |
---|
| 3525 | { |
---|
| 3526 | *comp = j; |
---|
| 3527 | i= (*componentIsUsed)[j]; |
---|
| 3528 | } |
---|
| 3529 | } |
---|
| 3530 | } |
---|
| 3531 | return generator; |
---|
| 3532 | } |
---|
| 3533 | |
---|
| 3534 | static void idDeleteComp(ideal arg,int red_comp) |
---|
| 3535 | { |
---|
| 3536 | int i,j; |
---|
| 3537 | poly p; |
---|
| 3538 | |
---|
| 3539 | for (i=IDELEMS(arg)-1;i>=0;i--) |
---|
| 3540 | { |
---|
| 3541 | p = arg->m[i]; |
---|
| 3542 | while (p!=NULL) |
---|
| 3543 | { |
---|
| 3544 | j = pGetComp(p); |
---|
| 3545 | if (j>red_comp) |
---|
| 3546 | { |
---|
| 3547 | pSetComp(p,j-1); |
---|
| 3548 | pSetm(p); |
---|
| 3549 | } |
---|
| 3550 | pIter(p); |
---|
| 3551 | } |
---|
| 3552 | } |
---|
| 3553 | (arg->rank)--; |
---|
| 3554 | } |
---|
| 3555 | |
---|
| 3556 | /*2 |
---|
| 3557 | * returns the presentation of an isomorphic, minimally |
---|
| 3558 | * embedded module (arg represents the quotient!) |
---|
| 3559 | */ |
---|
[cf108d] | 3560 | ideal idMinEmbedding(ideal arg,BOOLEAN inPlace, intvec **w) |
---|
[35aab3] | 3561 | { |
---|
| 3562 | if (idIs0(arg)) return idInit(1,arg->rank); |
---|
| 3563 | int next_gen,next_comp; |
---|
| 3564 | ideal res=arg; |
---|
| 3565 | |
---|
| 3566 | if (!inPlace) res = idCopy(arg); |
---|
| 3567 | loop |
---|
| 3568 | { |
---|
| 3569 | next_gen = idReadOutUnits(res,&next_comp); |
---|
| 3570 | if (next_gen<0) break; |
---|
| 3571 | syGaussForOne(res,next_gen,next_comp,0,IDELEMS(res)); |
---|
| 3572 | idDeleteComp(res,next_comp); |
---|
[cf108d] | 3573 | if ((w !=NULL)&&(*w!=NULL)) |
---|
| 3574 | { |
---|
[b34096] | 3575 | intvec *wtmp; |
---|
| 3576 | if ((*w)->length()==1) |
---|
| 3577 | { |
---|
| 3578 | wtmp=new intvec(1); |
---|
| 3579 | // (*wtmp)[0]=0; |
---|
| 3580 | } |
---|
| 3581 | else |
---|
| 3582 | { |
---|
| 3583 | wtmp=new intvec((*w)->length()-1); |
---|
| 3584 | int i; |
---|
| 3585 | for(i=0;i<next_comp-1;i++) (*wtmp)[i]=(**w)[i]; |
---|
| 3586 | for(i=next_comp;i<(*w)->length();i++) (*wtmp)[i-1]=(**w)[i]; |
---|
| 3587 | } |
---|
[cf108d] | 3588 | delete *w; |
---|
| 3589 | *w=wtmp; |
---|
| 3590 | } |
---|
[35aab3] | 3591 | } |
---|
| 3592 | idSkipZeroes(res); |
---|
| 3593 | return res; |
---|
| 3594 | } |
---|
| 3595 | |
---|
| 3596 | /*2 |
---|
| 3597 | * transpose a module |
---|
| 3598 | */ |
---|
| 3599 | ideal idTransp(ideal a) |
---|
| 3600 | { |
---|
| 3601 | int r = a->rank, c = IDELEMS(a); |
---|
| 3602 | ideal b = idInit(r,c); |
---|
| 3603 | |
---|
| 3604 | for (int i=c; i>0; i--) |
---|
| 3605 | { |
---|
| 3606 | poly p=a->m[i-1]; |
---|
| 3607 | while(p!=NULL) |
---|
| 3608 | { |
---|
| 3609 | poly h=pHead(p); |
---|
| 3610 | int co=pGetComp(h)-1; |
---|
| 3611 | pSetComp(h,i); |
---|
| 3612 | pSetmComp(h); |
---|
| 3613 | b->m[co]=pAdd(b->m[co],h); |
---|
| 3614 | pIter(p); |
---|
| 3615 | } |
---|
| 3616 | } |
---|
| 3617 | return b; |
---|
| 3618 | } |
---|
| 3619 | |
---|
| 3620 | intvec * idQHomWeight(ideal id) |
---|
| 3621 | { |
---|
| 3622 | poly head, tail; |
---|
| 3623 | int k; |
---|
| 3624 | int in=IDELEMS(id)-1, ready=0, all=0, |
---|
| 3625 | coldim=pVariables, rowmax=2*coldim; |
---|
| 3626 | if (in<0) return NULL; |
---|
| 3627 | intvec *imat=new intvec(rowmax+1,coldim,0); |
---|
| 3628 | |
---|
| 3629 | do |
---|
| 3630 | { |
---|
| 3631 | head = id->m[in--]; |
---|
| 3632 | if (head!=NULL) |
---|
| 3633 | { |
---|
| 3634 | tail = pNext(head); |
---|
| 3635 | while (tail!=NULL) |
---|
| 3636 | { |
---|
| 3637 | all++; |
---|
| 3638 | for (k=1;k<=coldim;k++) |
---|
| 3639 | IMATELEM(*imat,all,k) = pGetExpDiff(head,tail,k); |
---|
| 3640 | if (all==rowmax) |
---|
| 3641 | { |
---|
| 3642 | ivTriangIntern(imat, ready, all); |
---|
| 3643 | if (ready==coldim) |
---|
| 3644 | { |
---|
| 3645 | delete imat; |
---|
| 3646 | return NULL; |
---|
| 3647 | } |
---|
| 3648 | } |
---|
| 3649 | pIter(tail); |
---|
| 3650 | } |
---|
| 3651 | } |
---|
| 3652 | } while (in>=0); |
---|
| 3653 | if (all>ready) |
---|
| 3654 | { |
---|
| 3655 | ivTriangIntern(imat, ready, all); |
---|
| 3656 | if (ready==coldim) |
---|
| 3657 | { |
---|
| 3658 | delete imat; |
---|
| 3659 | return NULL; |
---|
| 3660 | } |
---|
| 3661 | } |
---|
| 3662 | intvec *result = ivSolveKern(imat, ready); |
---|
| 3663 | delete imat; |
---|
| 3664 | return result; |
---|
| 3665 | } |
---|
| 3666 | |
---|
| 3667 | BOOLEAN idIsZeroDim(ideal I) |
---|
| 3668 | { |
---|
| 3669 | BOOLEAN *UsedAxis=(BOOLEAN *)omAlloc0(pVariables*sizeof(BOOLEAN)); |
---|
| 3670 | int i,n; |
---|
| 3671 | poly po; |
---|
| 3672 | BOOLEAN res=TRUE; |
---|
| 3673 | for(i=IDELEMS(I)-1;i>=0;i--) |
---|
| 3674 | { |
---|
| 3675 | po=I->m[i]; |
---|
| 3676 | if ((po!=NULL) &&((n=pIsPurePower(po))!=0)) UsedAxis[n-1]=TRUE; |
---|
| 3677 | } |
---|
| 3678 | for(i=pVariables-1;i>=0;i--) |
---|
| 3679 | { |
---|
| 3680 | if(UsedAxis[i]==FALSE) {res=FALSE; break;} // not zero-dim. |
---|
| 3681 | } |
---|
| 3682 | omFreeSize(UsedAxis,pVariables*sizeof(BOOLEAN)); |
---|
| 3683 | return res; |
---|
| 3684 | } |
---|
| 3685 | |
---|
| 3686 | void idNormalize(ideal I) |
---|
| 3687 | { |
---|
| 3688 | if (rField_has_simple_inverse()) return; /* Z/p, GF(p,n), R, long R/C */ |
---|
| 3689 | int i; |
---|
| 3690 | poly p; |
---|
| 3691 | for(i=IDELEMS(I)-1;i>=0;i--) |
---|
| 3692 | { |
---|
| 3693 | p=I->m[i] ; |
---|
| 3694 | while(p!=NULL) |
---|
| 3695 | { |
---|
| 3696 | nNormalize(pGetCoeff(p)); |
---|
| 3697 | pIter(p); |
---|
| 3698 | } |
---|
| 3699 | } |
---|
| 3700 | } |
---|