| 1 |
Loading image file :/home/guests/sveta/b1002s/bin/Linux_elf/bergman.img |
| 2 |
Bergman 1.001, 22-Aug-20 |
| 3 |
1 lisp> nil |
| 4 |
2 lisp> 0 |
| 5 |
((objecttype ring (autoaddrelationstate nil nil) (lowtermshandling quick)) ( |
| 6 |
resolutiontype none) (variablesetup (ringtype commutative) (commutativeorder |
| 7 |
tdegrevlex) (ordermatrix nil) (noncommutativeorder tdegleftlex) (variablenumber |
| 8 |
nil) (invariables nil) (outvariables nil) (variableweights nil) ( |
| 9 |
homogenisationvariable nil)) (strategy default (process degreewise) (stability t |
| 10 |
) (mindeg nil) (maxdeg nil) (interruption ordinary) (customised nil)) ( |
| 11 |
coefficientdomain nil (oddprimesmoduli ordinary)) (inputformat casesensalgin) ( |
| 12 |
outputformat alg (printtimes (degreeprintoutput nil) (itemprintoutput nil)) |
| 13 |
exptsprint (immediateassocringpbdisplay nil) (overwrite nil) (customised nil)) ( |
| 14 |
debugstate (directalertclosing nil) (checkfailuredisplay t) (activetracebreaks |
| 15 |
nil)) (variousflags (dynamiclogtables off) (immediatecrit off) ( |
| 16 |
immediatefullreduction on) (immediaterecdefine off) (nobignum off) ( |
| 17 |
obsoletenamesinform off) (oldprintmodes1 off) (oldseriesmodes1 off) ( |
| 18 |
standardanickmodes on) (pbseries off) (reductivity on) (savedegree off) ( |
| 19 |
saverecvalues on))) |
| 20 |
|
| 21 |
nil |
| 22 |
simple commutative |
| 23 |
"simple commutative" |
| 24 |
0 |
| 25 |
nil |
| 26 |
t |
| 27 |
SetupGlobals |
| 28 |
... done |
| 29 |
- All is OK (I hope). Now you may (e. g.): |
| 30 |
- kill bergman with (QUIT); or |
| 31 |
- interrupt bergman with ^Z; or |
| 32 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 33 |
nil |
| 34 |
0 |
| 35 |
0 |
| 36 |
0 |
| 37 |
0 |
| 38 |
nil |
| 39 |
|
| 40 |
nil |
| 41 |
simple noncommutative |
| 42 |
"simple noncommutative" |
| 43 |
0 |
| 44 |
nil |
| 45 |
nil |
| 46 |
t |
| 47 |
- All is OK (I hope). Now you may (e. g.): |
| 48 |
- kill bergman with (QUIT); or |
| 49 |
- interrupt bergman with ^Z; or |
| 50 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 51 |
nil |
| 52 |
0 |
| 53 |
0 |
| 54 |
0 |
| 55 |
0 |
| 56 |
nil |
| 57 |
|
| 58 |
nil |
| 59 |
ncpbhgroebner |
| 60 |
"ncpbhgroebner" |
| 61 |
0 |
| 62 |
0 |
| 63 |
0 |
| 64 |
6 |
| 65 |
t |
| 66 |
*** Function `!O!L!D!D!E!D' has been redefined |
| 67 |
*** Function `degreeenddisplay' has been redefined |
| 68 |
|
| 69 |
% No. of Spolynomials calculated until degree 2: 0 |
| 70 |
% No. of ReducePol(0) demanded until degree 2: 0 |
| 71 |
% Time: 30 |
| 72 |
|
| 73 |
% No. of Spolynomials calculated until degree 3: 2 |
| 74 |
% No. of ReducePol(0) demanded until degree 3: 0 |
| 75 |
% Time: 30 |
| 76 |
|
| 77 |
% No. of Spolynomials calculated until degree 4: 8 |
| 78 |
% No. of ReducePol(0) demanded until degree 4: 5 |
| 79 |
% Time: 30 |
| 80 |
*** Function `degreeenddisplay' has been redefined |
| 81 |
nil |
| 82 |
0 |
| 83 |
0 |
| 84 |
256 |
| 85 |
0 |
| 86 |
0 |
| 87 |
0 |
| 88 |
nil |
| 89 |
t |
| 90 |
|
| 91 |
nil |
| 92 |
Commutative Hilbert series |
| 93 |
"Commutative Hilbert series" |
| 94 |
0 |
| 95 |
0 |
| 96 |
nil |
| 97 |
nil |
| 98 |
7 |
| 99 |
t |
| 100 |
nil |
| 101 |
0 |
| 102 |
0 |
| 103 |
0 |
| 104 |
0 |
| 105 |
0 |
| 106 |
nil |
| 107 |
t |
| 108 |
|
| 109 |
nil |
| 110 |
Hilbert series interrupt strategy: commutative |
| 111 |
"Hilbert series interrupt strategy: commutative" |
| 112 |
0 |
| 113 |
ordinary |
| 114 |
t |
| 115 |
nil |
| 116 |
t |
| 117 |
- All is OK (I hope). Now you may (e. g.): |
| 118 |
- kill bergman with (QUIT); or |
| 119 |
- interrupt bergman with ^Z; or |
| 120 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 121 |
nil |
| 122 |
nil |
| 123 |
minhilblimits |
| 124 |
0 |
| 125 |
0 |
| 126 |
0 |
| 127 |
0 |
| 128 |
t |
| 129 |
|
| 130 |
nil |
| 131 |
Weights handling: commutative |
| 132 |
"Weights handling: commutative" |
| 133 |
0 |
| 134 |
nil |
| 135 |
nil |
| 136 |
t |
| 137 |
- All is OK (I hope). Now you may (e. g.): |
| 138 |
- kill bergman with (QUIT); or |
| 139 |
- interrupt bergman with ^Z; or |
| 140 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 141 |
nil |
| 142 |
(1 1 2) |
| 143 |
nil |
| 144 |
0 |
| 145 |
0 |
| 146 |
0 |
| 147 |
0 |
| 148 |
t |
| 149 |
|
| 150 |
nil |
| 151 |
Weights handling: non-commutative |
| 152 |
"Weights handling: non-commutative" |
| 153 |
0 |
| 154 |
nil |
| 155 |
nil |
| 156 |
nil |
| 157 |
t |
| 158 |
- All is OK (I hope). Now you may (e. g.): |
| 159 |
- kill bergman with (QUIT); or |
| 160 |
- interrupt bergman with ^Z; or |
| 161 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 162 |
nil |
| 163 |
(1 1 2) |
| 164 |
nil |
| 165 |
0 |
| 166 |
0 |
| 167 |
0 |
| 168 |
0 |
| 169 |
t |
| 170 |
|
| 171 |
nil |
| 172 |
Eliminating ordering: Groebner basis |
| 173 |
"Eliminating ordering: Groebner basis" |
| 174 |
0 |
| 175 |
nil |
| 176 |
nil |
| 177 |
t |
| 178 |
- All is OK (I hope). Now you may (e. g.): |
| 179 |
- kill bergman with (QUIT); or |
| 180 |
- interrupt bergman with ^Z; or |
| 181 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 182 |
nil |
| 183 |
nil |
| 184 |
0 |
| 185 |
0 |
| 186 |
0 |
| 187 |
0 |
| 188 |
nil |
| 189 |
t |
| 190 |
|
| 191 |
nil |
| 192 |
modulehseries |
| 193 |
"modulehseries" |
| 194 |
0 |
| 195 |
0 |
| 196 |
*** Function `modulehseries' has been redefined |
| 197 |
*** I turn on noncommutativity |
| 198 |
nil |
| 199 |
2 |
| 200 |
t |
| 201 |
+23*z^2 |
| 202 |
+106*z^3 |
| 203 |
+489*z^4 |
| 204 |
+2256*z^5 |
| 205 |
+10408*z^6 |
| 206 |
t |
| 207 |
+23*z^2 |
| 208 |
+105*z^3 |
| 209 |
+478*z^4 |
| 210 |
+2175*z^5 |
| 211 |
+9896*z^6 |
| 212 |
|
| 213 |
Here is (1-H)^(-1) for Hilbert series H of the module |
| 214 |
|
| 215 |
+1 |
| 216 |
+2*t^1 |
| 217 |
+10*t^2 |
| 218 |
+45*t^3 |
| 219 |
+204*t^4 |
| 220 |
+928*t^5 |
| 221 |
+4222*t^6 |
| 222 |
Here is the Hilbert series H of the module |
| 223 |
+2*t^1 |
| 224 |
+6*t^2 |
| 225 |
+13*t^3 |
| 226 |
+28*t^4 |
| 227 |
+64*t^5 |
| 228 |
+149*t^6 |
| 229 |
nil |
| 230 |
nil |
| 231 |
0 |
| 232 |
256 |
| 233 |
0 |
| 234 |
0 |
| 235 |
0 |
| 236 |
t |
| 237 |
|
| 238 |
nil |
| 239 |
Anick trivial |
| 240 |
"Anick trivial" |
| 241 |
0 |
| 242 |
0 |
| 243 |
"../test_bergman/anick_tm.out" |
| 244 |
*** We turn on noncommutativity |
| 245 |
|
| 246 |
*** We turn on PBSERIES |
| 247 |
nil |
| 248 |
t |
| 249 |
The Anick resolution initialization... |
| 250 |
B(1,1)=2 |
| 251 |
The Anick resolution initialization done. |
| 252 |
Calculating the Anick resolution in degree 2... |
| 253 |
B(1,1)=2 |
| 254 |
B(2,2)=2 |
| 255 |
0 1 2 |
| 256 |
+---------- |
| 257 |
0 | 1 2 2 |
| 258 |
1 | - - |
| 259 |
Printing the results ... |
| 260 |
Printing is done. |
| 261 |
end of Calculations. |
| 262 |
Calculating the Anick resolution in degree 3... |
| 263 |
B(1,1)=2 |
| 264 |
B(2,2)=2 |
| 265 |
B(3,3)=1 |
| 266 |
0 1 2 3 |
| 267 |
+-------------- |
| 268 |
0 | 1 2 2 1 |
| 269 |
1 | - - - |
| 270 |
2 | - - |
| 271 |
Printing the results ... |
| 272 |
Printing is done. |
| 273 |
end of Calculations. |
| 274 |
Calculating the Anick resolution in degree 4... |
| 275 |
B(1,1)=2 |
| 276 |
B(2,2)=2 |
| 277 |
B(3,3)=1 |
| 278 |
B(3,4)=1 |
| 279 |
B(4,4)=1 |
| 280 |
0 1 2 3 4 |
| 281 |
+------------------ |
| 282 |
0 | 1 2 2 1 1 |
| 283 |
1 | - - - 1 |
| 284 |
2 | - - - |
| 285 |
3 | - - |
| 286 |
Printing the results ... |
| 287 |
Printing is done. |
| 288 |
end of Calculations. |
| 289 |
|
| 290 |
nil |
| 291 |
nil |
| 292 |
Printing the results ... |
| 293 |
Printing is done. |
| 294 |
nil |
| 295 |
Closing the streams.Cleaning the variables |
| 296 |
nil |
| 297 |
0 |
| 298 |
0 |
| 299 |
0 |
| 300 |
0 |
| 301 |
0 |
| 302 |
t |
| 303 |
|
| 304 |
nil |
| 305 |
Modulebettinumbers |
| 306 |
"Modulebettinumbers" |
| 307 |
0 |
| 308 |
0 |
| 309 |
"../test_bergman/modbtn.out" |
| 310 |
|
| 311 |
*** We turn on the MODULE mode |
| 312 |
*** We turn on noncommutativity |
| 313 |
|
| 314 |
*** We turn on PBSERIES |
| 315 |
nil |
| 316 |
1 |
| 317 |
t |
| 318 |
The Anick resolution initialization... |
| 319 |
B(0,0)=1 |
| 320 |
The Anick resolution initialization done. |
| 321 |
Calculating the module Anick resolution in degree 2... |
| 322 |
B(0,0)=1 |
| 323 |
B(1,1)=1 |
| 324 |
0 1 2 |
| 325 |
+---------- |
| 326 |
0 | 1 1 |
| 327 |
1 | - |
| 328 |
end of Calculations. |
| 329 |
Calculating the module Anick resolution in degree 3... |
| 330 |
B(0,0)=1 |
| 331 |
B(1,1)=1 |
| 332 |
B(2,2)=1 |
| 333 |
0 1 2 3 |
| 334 |
+-------------- |
| 335 |
0 | 1 1 1 |
| 336 |
1 | - - |
| 337 |
2 | - |
| 338 |
end of Calculations. |
| 339 |
|
| 340 |
Groebner basis is finite. |
| 341 |
If you want to continue calculations until the maximal degree |
| 342 |
type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG)) |
| 343 |
nil |
| 344 |
Calculating the module Anick resolution in degree 4... |
| 345 |
B(0,0)=1 |
| 346 |
B(1,1)=1 |
| 347 |
B(2,2)=1 |
| 348 |
B(3,3)=1 |
| 349 |
0 1 2 3 4 |
| 350 |
+------------------ |
| 351 |
0 | 1 1 1 1 |
| 352 |
1 | - - - |
| 353 |
2 | - - |
| 354 |
3 | - |
| 355 |
end of Calculations. |
| 356 |
Calculating the module Anick resolution in degree 5... |
| 357 |
B(0,0)=1 |
| 358 |
B(1,1)=1 |
| 359 |
B(2,2)=1 |
| 360 |
B(3,3)=1 |
| 361 |
B(4,4)=1 |
| 362 |
0 1 2 3 4 5 |
| 363 |
+---------------------- |
| 364 |
0 | 1 1 1 1 1 |
| 365 |
1 | - - - - |
| 366 |
2 | - - - |
| 367 |
3 | - - |
| 368 |
4 | - |
| 369 |
end of Calculations. |
| 370 |
nil |
| 371 |
Printing the results ... |
| 372 |
Printing is done. |
| 373 |
nil |
| 374 |
Closing the streams.Cleaning the variables |
| 375 |
nil |
| 376 |
0 |
| 377 |
0 |
| 378 |
0 |
| 379 |
0 |
| 380 |
0 |
| 381 |
t |
| 382 |
|
| 383 |
nil |
| 384 |
Factor-algebra |
| 385 |
"Factor-algebra" |
| 386 |
0 |
| 387 |
0 |
| 388 |
"../test_bergman/fact.out" |
| 389 |
|
| 390 |
*** We turn on the MODULE mode |
| 391 |
|
| 392 |
*** We turn on PBSERIES |
| 393 |
*** We turn on noncommutativity |
| 394 |
nil |
| 395 |
t |
| 396 |
The Anick resolution initialization... |
| 397 |
B(0,0)=1 |
| 398 |
The Anick resolution initialization done. |
| 399 |
Calculating the module Anick resolution in degree 2... |
| 400 |
B(0,0)=1 |
| 401 |
B(1,1)=2 |
| 402 |
0 1 2 |
| 403 |
+---------- |
| 404 |
0 | 1 2 |
| 405 |
1 | - |
| 406 |
end of Calculations. |
| 407 |
Calculating the module Anick resolution in degree 3... |
| 408 |
B(0,0)=1 |
| 409 |
B(1,1)=2 |
| 410 |
B(1,2)=1 |
| 411 |
B(2,2)=1 |
| 412 |
0 1 2 3 |
| 413 |
+-------------- |
| 414 |
0 | 1 2 1 |
| 415 |
1 | - 1 |
| 416 |
2 | - |
| 417 |
end of Calculations. |
| 418 |
Calculating the module Anick resolution in degree 4... |
| 419 |
B(0,0)=1 |
| 420 |
B(1,1)=2 |
| 421 |
B(1,2)=1 |
| 422 |
B(2,2)=1 |
| 423 |
B(2,3)=2 |
| 424 |
0 1 2 3 4 |
| 425 |
+------------------ |
| 426 |
0 | 1 2 1 - |
| 427 |
1 | - 1 2 |
| 428 |
2 | - - |
| 429 |
3 | - |
| 430 |
end of Calculations. |
| 431 |
Calculating the module Anick resolution in degree 5... |
| 432 |
B(0,0)=1 |
| 433 |
B(1,1)=2 |
| 434 |
B(1,2)=1 |
| 435 |
B(2,2)=1 |
| 436 |
B(2,3)=2 |
| 437 |
B(3,4)=1 |
| 438 |
0 1 2 3 4 5 |
| 439 |
+---------------------- |
| 440 |
0 | 1 2 1 - - |
| 441 |
1 | - 1 2 1 |
| 442 |
2 | - - - |
| 443 |
3 | - - |
| 444 |
4 | - |
| 445 |
end of Calculations. |
| 446 |
Calculating the module Anick resolution in degree 6... |
| 447 |
B(0,0)=1 |
| 448 |
B(1,1)=2 |
| 449 |
B(1,2)=1 |
| 450 |
B(2,2)=1 |
| 451 |
B(2,3)=2 |
| 452 |
B(3,4)=1 |
| 453 |
0 1 2 3 4 5 |
| 454 |
+---------------------- |
| 455 |
0 | 1 2 1 - - |
| 456 |
1 | - 1 2 1 |
| 457 |
2 | - - - |
| 458 |
3 | - - |
| 459 |
4 | - |
| 460 |
end of Calculations. |
| 461 |
Calculating the module Anick resolution in degree 7... |
| 462 |
B(0,0)=1 |
| 463 |
B(1,1)=2 |
| 464 |
B(1,2)=1 |
| 465 |
B(2,2)=1 |
| 466 |
B(2,3)=2 |
| 467 |
B(3,4)=1 |
| 468 |
0 1 2 3 4 5 |
| 469 |
+---------------------- |
| 470 |
0 | 1 2 1 - - |
| 471 |
1 | - 1 2 1 |
| 472 |
2 | - - - |
| 473 |
3 | - - |
| 474 |
4 | - |
| 475 |
end of Calculations. |
| 476 |
Calculating the module Anick resolution in degree 8... |
| 477 |
B(0,0)=1 |
| 478 |
B(1,1)=2 |
| 479 |
B(1,2)=1 |
| 480 |
B(2,2)=1 |
| 481 |
B(2,3)=2 |
| 482 |
B(3,4)=1 |
| 483 |
0 1 2 3 4 5 |
| 484 |
+---------------------- |
| 485 |
0 | 1 2 1 - - |
| 486 |
1 | - 1 2 1 |
| 487 |
2 | - - - |
| 488 |
3 | - - |
| 489 |
4 | - |
| 490 |
end of Calculations. |
| 491 |
|
| 492 |
nil |
| 493 |
nil |
| 494 |
Printing the results ... |
| 495 |
Printing is done. |
| 496 |
nil |
| 497 |
Closing the streams.Cleaning the variables |
| 498 |
nil |
| 499 |
0 |
| 500 |
0 |
| 501 |
0 |
| 502 |
0 |
| 503 |
0 |
| 504 |
t |
| 505 |
|
| 506 |
nil |
| 507 |
Betti numbers for two modules |
| 508 |
"Betti numbers for two modules" |
| 509 |
0 |
| 510 |
0 |
| 511 |
"../test_bergman/two.out" |
| 512 |
|
| 513 |
*** We turn on the TWOMODULES mode |
| 514 |
*** We turn on noncommutativity |
| 515 |
|
| 516 |
*** We turn on PBSERIES |
| 517 |
nil |
| 518 |
1 |
| 519 |
1 |
| 520 |
t |
| 521 |
The Anick resolution initialization (for two modules)... |
| 522 |
The Anick resolution initialization done. |
| 523 |
Calculating the module Anick resolution in degree 2... |
| 524 |
B(0,0)=1 |
| 525 |
0 1 2 |
| 526 |
+---------- |
| 527 |
0 | 1 |
| 528 |
end of Calculations. |
| 529 |
|
| 530 |
Groebner basis is finite. |
| 531 |
If you want to continue calculations until the maximal degree |
| 532 |
type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG)) |
| 533 |
nil |
| 534 |
Calculating the module Anick resolution in degree 3... |
| 535 |
B(0,0)=1 |
| 536 |
0 1 2 |
| 537 |
+---------- |
| 538 |
0 | 1 |
| 539 |
end of Calculations. |
| 540 |
Calculating the module Anick resolution in degree 4... |
| 541 |
B(0,0)=1 |
| 542 |
B(0,2)=1 |
| 543 |
0 1 2 3 4 |
| 544 |
+------------------ |
| 545 |
0 | 1 - - |
| 546 |
1 | - - |
| 547 |
2 | 1 |
| 548 |
end of Calculations. |
| 549 |
Calculating the module Anick resolution in degree 5... |
| 550 |
B(0,0)=1 |
| 551 |
B(0,2)=1 |
| 552 |
B(0,3)=2 |
| 553 |
0 1 2 3 4 5 |
| 554 |
+---------------------- |
| 555 |
0 | 1 - - - |
| 556 |
1 | - - - |
| 557 |
2 | 1 - |
| 558 |
3 | 2 |
| 559 |
end of Calculations. |
| 560 |
Calculating the module Anick resolution in degree 6... |
| 561 |
B(0,0)=1 |
| 562 |
B(0,2)=1 |
| 563 |
B(0,3)=2 |
| 564 |
B(0,4)=4 |
| 565 |
0 1 2 3 4 5 6 |
| 566 |
+-------------------------- |
| 567 |
0 | 1 - - - - |
| 568 |
1 | - - - - |
| 569 |
2 | 1 - - |
| 570 |
3 | 2 - |
| 571 |
4 | 4 |
| 572 |
end of Calculations. |
| 573 |
nil |
| 574 |
Printing the results ... |
| 575 |
Printing is done. |
| 576 |
nil |
| 577 |
Closing the streams.Cleaning the variables |
| 578 |
nil |
| 579 |
0 |
| 580 |
0 |
| 581 |
0 |
| 582 |
0 |
| 583 |
0 |
| 584 |
t |
| 585 |
|
| 586 |
nil |
| 587 |
Betti numbers for two modules: hochschild |
| 588 |
"Betti numbers for two modules: hochschild" |
| 589 |
0 |
| 590 |
0 |
| 591 |
"../test_bergman/hoch.out" |
| 592 |
|
| 593 |
*** We turn on the TWOMODULES mode |
| 594 |
*** We turn on noncommutativity |
| 595 |
|
| 596 |
*** We turn on PBSERIES |
| 597 |
nil |
| 598 |
1 |
| 599 |
1 |
| 600 |
t |
| 601 |
The Anick resolution initialization (for two modules)... |
| 602 |
The Anick resolution initialization done. |
| 603 |
Calculating the module Anick resolution in degree 2... |
| 604 |
B(0,0)=1 |
| 605 |
0 1 2 |
| 606 |
+---------- |
| 607 |
0 | 1 |
| 608 |
end of Calculations. |
| 609 |
Calculating the module Anick resolution in degree 3... |
| 610 |
B(0,0)=1 |
| 611 |
B(0,1)=2 |
| 612 |
B(1,1)=2 |
| 613 |
0 1 2 3 |
| 614 |
+-------------- |
| 615 |
0 | 1 2 |
| 616 |
1 | 2 |
| 617 |
end of Calculations. |
| 618 |
Calculating the module Anick resolution in degree 4... |
| 619 |
B(0,0)=1 |
| 620 |
B(0,1)=2 |
| 621 |
B(1,1)=2 |
| 622 |
B(0,2)=2 |
| 623 |
B(1,2)=2 |
| 624 |
0 1 2 3 4 |
| 625 |
+------------------ |
| 626 |
0 | 1 2 - |
| 627 |
1 | 2 2 |
| 628 |
2 | 2 |
| 629 |
end of Calculations. |
| 630 |
Calculating the module Anick resolution in degree 5... |
| 631 |
B(0,0)=1 |
| 632 |
B(0,1)=2 |
| 633 |
B(1,1)=2 |
| 634 |
B(0,2)=2 |
| 635 |
B(1,2)=2 |
| 636 |
B(0,3)=2 |
| 637 |
B(1,3)=2 |
| 638 |
0 1 2 3 4 5 |
| 639 |
+---------------------- |
| 640 |
0 | 1 2 - - |
| 641 |
1 | 2 2 - |
| 642 |
2 | 2 2 |
| 643 |
3 | 2 |
| 644 |
end of Calculations. |
| 645 |
|
| 646 |
nil |
| 647 |
nil |
| 648 |
Printing the results ... |
| 649 |
Printing is done. |
| 650 |
nil |
| 651 |
Closing the streams.Cleaning the variables |
| 652 |
nil |
| 653 |
0 |
| 654 |
0 |
| 655 |
0 |
| 656 |
0 |
| 657 |
0 |
| 658 |
t |
| 659 |
|
| 660 |
nil |
| 661 |
Hochschild homology |
| 662 |
"Hochschild homology" |
| 663 |
0 |
| 664 |
0 |
| 665 |
"../test_bergman/hoch1.out" |
| 666 |
|
| 667 |
*** We turn on the TWOMODULES mode |
| 668 |
|
| 669 |
*** We turn on PBSERIES |
| 670 |
*** We turn on noncommutativity |
| 671 |
nil |
| 672 |
t |
| 673 |
The Anick resolution initialization (for two modules)... |
| 674 |
The Anick resolution initialization done. |
| 675 |
Calculating the module Anick resolution in degree 2... |
| 676 |
B(0,0)=1 |
| 677 |
0 1 2 |
| 678 |
+---------- |
| 679 |
0 | 1 |
| 680 |
end of Calculations. |
| 681 |
Calculating the module Anick resolution in degree 3... |
| 682 |
B(0,0)=1 |
| 683 |
B(0,1)=2 |
| 684 |
B(1,1)=2 |
| 685 |
0 1 2 3 |
| 686 |
+-------------- |
| 687 |
0 | 1 2 |
| 688 |
1 | 2 |
| 689 |
end of Calculations. |
| 690 |
Calculating the module Anick resolution in degree 4... |
| 691 |
B(0,0)=1 |
| 692 |
B(0,1)=2 |
| 693 |
B(1,1)=2 |
| 694 |
B(0,2)=2 |
| 695 |
B(1,2)=2 |
| 696 |
0 1 2 3 4 |
| 697 |
+------------------ |
| 698 |
0 | 1 2 - |
| 699 |
1 | 2 2 |
| 700 |
2 | 2 |
| 701 |
end of Calculations. |
| 702 |
Calculating the module Anick resolution in degree 5... |
| 703 |
B(0,0)=1 |
| 704 |
B(0,1)=2 |
| 705 |
B(1,1)=2 |
| 706 |
B(0,2)=2 |
| 707 |
B(1,2)=2 |
| 708 |
B(0,3)=2 |
| 709 |
B(1,3)=2 |
| 710 |
0 1 2 3 4 5 |
| 711 |
+---------------------- |
| 712 |
0 | 1 2 - - |
| 713 |
1 | 2 2 - |
| 714 |
2 | 2 2 |
| 715 |
3 | 2 |
| 716 |
end of Calculations. |
| 717 |
|
| 718 |
nil |
| 719 |
nil |
| 720 |
Printing the results ... |
| 721 |
Printing is done. |
| 722 |
nil |
| 723 |
Closing the streams.Cleaning the variables |
| 724 |
nil |
| 725 |
0 |
| 726 |
0 |
| 727 |
0 |
| 728 |
0 |
| 729 |
0 |
| 730 |
t |
| 731 |
|
| 732 |
nil |
| 733 |
simple noncommutative char2 |
| 734 |
"simple noncommutative char2" |
| 735 |
0 |
| 736 |
none |
| 737 |
nil |
| 738 |
t |
| 739 |
nil |
| 740 |
nil |
| 741 |
t |
| 742 |
- All is OK (I hope). Now you may (e. g.): |
| 743 |
- kill bergman with (QUIT); or |
| 744 |
- interrupt bergman with ^Z; or |
| 745 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 746 |
nil |
| 747 |
Cleaning the variables |
| 748 |
nil |
| 749 |
0 |
| 750 |
0 |
| 751 |
0 |
| 752 |
0 |
| 753 |
t |
| 754 |
|
| 755 |
nil |
| 756 |
simple noncommutative char5 |
| 757 |
"simple noncommutative char5" |
| 758 |
0 |
| 759 |
none |
| 760 |
nil |
| 761 |
*** (dm!A!Y!B!E): base 16#8154D60, length 10#57 bytes |
| 762 |
t |
| 763 |
nil |
| 764 |
nil |
| 765 |
t |
| 766 |
- All is OK (I hope). Now you may (e. g.): |
| 767 |
- kill bergman with (QUIT); or |
| 768 |
- interrupt bergman with ^Z; or |
| 769 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 770 |
nil |
| 771 |
Cleaning the variables |
| 772 |
nil |
| 773 |
0 |
| 774 |
0 |
| 775 |
0 |
| 776 |
0 |
| 777 |
t |
| 778 |
|
| 779 |
nil |
| 780 |
simple with modlogarithms |
| 781 |
"simple with modlogarithms" |
| 782 |
0 |
| 783 |
none |
| 784 |
nil |
| 785 |
ordinary |
| 786 |
*** Function `g!E!T!Cm!O!D' has been redefined |
| 787 |
*** Function `g!E!Th!A!L!F!Cm!O!D' has been redefined |
| 788 |
*** Function `g!E!Tp!R!E!D!Cm!O!D' has been redefined |
| 789 |
t |
| 790 |
nil |
| 791 |
nil |
| 792 |
t |
| 793 |
- All is OK (I hope). Now you may (e. g.): |
| 794 |
- kill bergman with (QUIT); or |
| 795 |
- interrupt bergman with ^Z; or |
| 796 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 797 |
nil |
| 798 |
Cleaning the variables |
| 799 |
nil |
| 800 |
modlogarithmic |
| 801 |
t |
| 802 |
0 |
| 803 |
0 |
| 804 |
0 |
| 805 |
0 |
| 806 |
t |
| 807 |
|
| 808 |
nil |
| 809 |
Leftmodulebettinumbers |
| 810 |
"Leftmodulebettinumbers" |
| 811 |
0 |
| 812 |
0 |
| 813 |
nil |
| 814 |
none |
| 815 |
"../test_bergman/leftmodbtn.out" |
| 816 |
|
| 817 |
*** We turn on the MODULE mode |
| 818 |
*** We turn on noncommutativity |
| 819 |
|
| 820 |
*** We turn on PBSERIES |
| 821 |
*** Function `p!O!La!L!Gr!E!A!D' has been redefined |
| 822 |
nil |
| 823 |
1 |
| 824 |
t |
| 825 |
The Anick resolution initialization... |
| 826 |
B(0,0)=1 |
| 827 |
The Anick resolution initialization done. |
| 828 |
Calculating the module Anick resolution in degree 2... |
| 829 |
B(0,0)=1 |
| 830 |
B(1,1)=1 |
| 831 |
0 1 2 |
| 832 |
+---------- |
| 833 |
0 | 1 1 |
| 834 |
1 | - |
| 835 |
end of Calculations. |
| 836 |
Calculating the module Anick resolution in degree 3... |
| 837 |
B(0,0)=1 |
| 838 |
B(1,1)=1 |
| 839 |
B(2,2)=1 |
| 840 |
0 1 2 3 |
| 841 |
+-------------- |
| 842 |
0 | 1 1 1 |
| 843 |
1 | - - |
| 844 |
2 | - |
| 845 |
end of Calculations. |
| 846 |
|
| 847 |
Groebner basis is finite. |
| 848 |
If you want to continue calculations until the maximal degree |
| 849 |
type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG)) |
| 850 |
nil |
| 851 |
Calculating the module Anick resolution in degree 4... |
| 852 |
B(0,0)=1 |
| 853 |
B(1,1)=1 |
| 854 |
B(2,2)=1 |
| 855 |
B(3,3)=1 |
| 856 |
0 1 2 3 4 |
| 857 |
+------------------ |
| 858 |
0 | 1 1 1 1 |
| 859 |
1 | - - - |
| 860 |
2 | - - |
| 861 |
3 | - |
| 862 |
end of Calculations. |
| 863 |
Calculating the module Anick resolution in degree 5... |
| 864 |
B(0,0)=1 |
| 865 |
B(1,1)=1 |
| 866 |
B(2,2)=1 |
| 867 |
B(3,3)=1 |
| 868 |
B(4,4)=1 |
| 869 |
0 1 2 3 4 5 |
| 870 |
+---------------------- |
| 871 |
0 | 1 1 1 1 1 |
| 872 |
1 | - - - - |
| 873 |
2 | - - - |
| 874 |
3 | - - |
| 875 |
4 | - |
| 876 |
end of Calculations. |
| 877 |
nil |
| 878 |
Printing the results ... |
| 879 |
Printing is done. |
| 880 |
nil |
| 881 |
Closing the streams.Cleaning the variables |
| 882 |
nil |
| 883 |
anick |
| 884 |
0 |
| 885 |
256 |
| 886 |
0 |
| 887 |
0 |
| 888 |
0 |
| 889 |
t |
| 890 |
|
| 891 |
nil |
| 892 |
Rabbit with setrabbit |
| 893 |
"Rabbit with setrabbit" |
| 894 |
0 |
| 895 |
8 |
| 896 |
t |
| 897 |
steps: 2,2,8 |
| 898 |
Cleaning the variables |
| 899 |
RABBIT: Added step, Maxdegree=4 |
| 900 |
Jump number 1 |
| 901 |
|
| 902 |
Cleaning the variables |
| 903 |
RABBIT: Jump number 2 |
| 904 |
|
| 905 |
Cleaning the variables |
| 906 |
RABBIT: Jump number 3 |
| 907 |
|
| 908 |
Cleaning the variables |
| 909 |
RABBIT: Added step, Maxdegree=6 |
| 910 |
Jump number 4 |
| 911 |
|
| 912 |
GB is completely calculated |
| 913 |
Rabbit has finishied jumping. |
| 914 |
nil |
| 915 |
Cleaning the variables |
| 916 |
nil |
| 917 |
nil |
| 918 |
nil |
| 919 |
0 |
| 920 |
0 |
| 921 |
0 |
| 922 |
0 |
| 923 |
t |
| 924 |
|
| 925 |
nil |
| 926 |
Skipcdeg - test N1 |
| 927 |
"Skipcdeg - test N1" |
| 928 |
0 |
| 929 |
ordinary |
| 930 |
t |
| 931 |
nil |
| 932 |
nil |
| 933 |
t |
| 934 |
- All is OK (I hope). Now you may (e. g.): |
| 935 |
- kill bergman with (QUIT); or |
| 936 |
- interrupt bergman with ^Z; or |
| 937 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 938 |
nil |
| 939 |
Cleaning the variables |
| 940 |
nil |
| 941 |
0 |
| 942 |
0 |
| 943 |
0 |
| 944 |
0 |
| 945 |
t |
| 946 |
|
| 947 |
nil |
| 948 |
Ignorecdeg |
| 949 |
"Ignorecdeg" |
| 950 |
0 |
| 951 |
ordinary |
| 952 |
t |
| 953 |
nil |
| 954 |
nil |
| 955 |
t |
| 956 |
- All is OK (I hope). Now you may (e. g.): |
| 957 |
- kill bergman with (QUIT); or |
| 958 |
- interrupt bergman with ^Z; or |
| 959 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 960 |
nil |
| 961 |
Cleaning the variables |
| 962 |
nil |
| 963 |
minhilblimits |
| 964 |
0 |
| 965 |
0 |
| 966 |
0 |
| 967 |
0 |
| 968 |
t |
| 969 |
|
| 970 |
nil |
| 971 |
Matrix ordering |
| 972 |
"Matrix ordering" |
| 973 |
0 |
| 974 |
nil |
| 975 |
nil |
| 976 |
nil |
| 977 |
nil |
| 978 |
t |
| 979 |
- All is OK (I hope). Now you may (e. g.): |
| 980 |
- kill bergman with (QUIT); or |
| 981 |
- interrupt bergman with ^Z; or |
| 982 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 983 |
nil |
| 984 |
Cleaning the variables |
| 985 |
nil |
| 986 |
nil |
| 987 |
0 |
| 988 |
0 |
| 989 |
0 |
| 990 |
0 |
| 991 |
t |
| 992 |
|
| 993 |
nil |
| 994 |
Test input data |
| 995 |
"Test input data" |
| 996 |
nil |
| 997 |
nil |
| 998 |
t |
| 999 |
((4 4) (5 nil 5 5 5 5) (6)) |
| 1000 |
nil |
| 1001 |
Cleaning the variables |
| 1002 |
nil |
| 1003 |
0 |
| 1004 |
|
| 1005 |
nil |
| 1006 |
Linear relations |
| 1007 |
"Linear relations" |
| 1008 |
0 |
| 1009 |
nil |
| 1010 |
quick |
| 1011 |
t |
| 1012 |
- All is OK (I hope). Now you may (e. g.): |
| 1013 |
- kill bergman with (QUIT); or |
| 1014 |
- interrupt bergman with ^Z; or |
| 1015 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 1016 |
nil |
| 1017 |
Cleaning the variables |
| 1018 |
nil |
| 1019 |
0 |
| 1020 |
0 |
| 1021 |
0 |
| 1022 |
0 |
| 1023 |
t |
| 1024 |
|
| 1025 |
nil |
| 1026 |
Linear relations - non-commutative |
| 1027 |
"Linear relations - non-commutative" |
| 1028 |
0 |
| 1029 |
nil |
| 1030 |
quick |
| 1031 |
t |
| 1032 |
- All is OK (I hope). Now you may (e. g.): |
| 1033 |
- kill bergman with (QUIT); or |
| 1034 |
- interrupt bergman with ^Z; or |
| 1035 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 1036 |
nil |
| 1037 |
Cleaning the variables |
| 1038 |
nil |
| 1039 |
safe |
| 1040 |
0 |
| 1041 |
0 |
| 1042 |
0 |
| 1043 |
0 |
| 1044 |
t |
| 1045 |
|
| 1046 |
nil |
| 1047 |
Minimal resolution |
| 1048 |
"Minimal resolution" |
| 1049 |
0 |
| 1050 |
nil |
| 1051 |
nil |
| 1052 |
1 |
| 1053 |
t |
| 1054 |
t |
| 1055 |
|
| 1056 |
*** We turn on the MODULE mode |
| 1057 |
Cleaning the variables |
| 1058 |
Cleaning the variables |
| 1059 |
|
| 1060 |
Current homological degree=2 |
| 1061 |
Current Poincare-Betti series is |
| 1062 |
1t+3t^2z+2t^3z^2+1t^4z^2 |
| 1063 |
Cleaning the variables |
| 1064 |
Cleaning the variables |
| 1065 |
Cleaning the variables |
| 1066 |
|
| 1067 |
Current homological degree=3 |
| 1068 |
Current Poincare-Betti series is |
| 1069 |
1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3+2t^6z^3 |
| 1070 |
+1t^7z^3 |
| 1071 |
Cleaning the variables |
| 1072 |
Cleaning the variables |
| 1073 |
Cleaning the variables |
| 1074 |
|
| 1075 |
Current homological degree=4 |
| 1076 |
Current Poincare-Betti series is |
| 1077 |
1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3+2t^6z^3 |
| 1078 |
+1t^7z^3+4t^7z^4+3t^8z^4 |
| 1079 |
Cleaning the variables |
| 1080 |
Cleaning the variables |
| 1081 |
Cleaning the variables |
| 1082 |
|
| 1083 |
Current homological degree=5 |
| 1084 |
Current Poincare-Betti series is |
| 1085 |
1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3+2t^6z^3 |
| 1086 |
+1t^7z^3+4t^7z^4+3t^8z^4+2t^8z^5 |
| 1087 |
Cleaning the variables |
| 1088 |
Cleaning the variables |
| 1089 |
|
| 1090 |
Calculated Poincare-Betti series is |
| 1091 |
1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3+2t^6z^3 |
| 1092 |
+1t^7z^3+4t^7z^4+3t^8z^4+2t^8z^5 |
| 1093 |
nil |
| 1094 |
Cleaning the variables |
| 1095 |
nil |
| 1096 |
nil |
| 1097 |
0 |
| 1098 |
0 |
| 1099 |
0 |
| 1100 |
0 |
| 1101 |
t |
| 1102 |
|
| 1103 |
nil |
| 1104 |
Combination: weights and maxdeg |
| 1105 |
"Combination: weights and maxdeg" |
| 1106 |
0 |
| 1107 |
nil |
| 1108 |
nil |
| 1109 |
nil |
| 1110 |
t |
| 1111 |
- All is OK (I hope). Now you may (e. g.): |
| 1112 |
- kill bergman with (QUIT); or |
| 1113 |
- interrupt bergman with ^Z; or |
| 1114 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 1115 |
nil |
| 1116 |
(2 1 1) |
| 1117 |
Cleaning the variables |
| 1118 |
nil |
| 1119 |
0 |
| 1120 |
0 |
| 1121 |
0 |
| 1122 |
0 |
| 1123 |
t |
| 1124 |
|
| 1125 |
nil |
| 1126 |
Nonhomogeneity |
| 1127 |
"Nonhomogeneity" |
| 1128 |
0 |
| 1129 |
nil |
| 1130 |
t |
| 1131 |
t |
| 1132 |
quick |
| 1133 |
none |
| 1134 |
t |
| 1135 |
x*y-z, |
| 1136 |
y^2-x^2, |
| 1137 |
y*z-x, |
| 1138 |
z*x-y, |
| 1139 |
-z^2+x^2, |
| 1140 |
x^3-z*y, |
| 1141 |
-x^2*z+y*x, |
| 1142 |
y*x^2-x*z, |
| 1143 |
y*x*z-x*z*y, |
| 1144 |
-z*y*x+x*z*y, |
| 1145 |
- All is OK (I hope). Now you may (e. g.): |
| 1146 |
- kill bergman with (QUIT); or |
| 1147 |
- interrupt bergman with ^Z; or |
| 1148 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 1149 |
nil |
| 1150 |
Cleaning the variables |
| 1151 |
nil |
| 1152 |
0 |
| 1153 |
0 |
| 1154 |
0 |
| 1155 |
0 |
| 1156 |
nil |
| 1157 |
nil |
| 1158 |
safe |
| 1159 |
t |
| 1160 |
|
| 1161 |
nil |
| 1162 |
Anick in characteristic 5 |
| 1163 |
"Anick in characteristic 5" |
| 1164 |
0 |
| 1165 |
0 |
| 1166 |
"../test_bergman/anick_5.out" |
| 1167 |
*** We turn on noncommutativity |
| 1168 |
|
| 1169 |
*** We turn on PBSERIES |
| 1170 |
nil |
| 1171 |
*** Function `g!E!T!Cm!O!D' has been redefined |
| 1172 |
*** Function `g!E!Th!A!L!F!Cm!O!D' has been redefined |
| 1173 |
*** Function `g!E!Tp!R!E!D!Cm!O!D' has been redefined |
| 1174 |
t |
| 1175 |
t |
| 1176 |
The Anick resolution initialization... |
| 1177 |
B(1,1)=2 |
| 1178 |
The Anick resolution initialization done. |
| 1179 |
Calculating the Anick resolution in degree 2... |
| 1180 |
B(1,1)=2 |
| 1181 |
B(2,2)=1 |
| 1182 |
0 1 2 |
| 1183 |
+---------- |
| 1184 |
0 | 1 2 1 |
| 1185 |
1 | - - |
| 1186 |
Printing the results ... |
| 1187 |
Printing is done. |
| 1188 |
end of Calculations. |
| 1189 |
Calculating the Anick resolution in degree 3... |
| 1190 |
B(1,1)=2 |
| 1191 |
B(2,2)=1 |
| 1192 |
0 1 2 |
| 1193 |
+---------- |
| 1194 |
0 | 1 2 1 |
| 1195 |
1 | - - |
| 1196 |
Printing the results ... |
| 1197 |
Printing is done. |
| 1198 |
end of Calculations. |
| 1199 |
Calculating the Anick resolution in degree 4... |
| 1200 |
B(1,1)=2 |
| 1201 |
B(2,2)=1 |
| 1202 |
0 1 2 |
| 1203 |
+---------- |
| 1204 |
0 | 1 2 1 |
| 1205 |
1 | - - |
| 1206 |
Printing the results ... |
| 1207 |
Printing is done. |
| 1208 |
end of Calculations. |
| 1209 |
|
| 1210 |
nil |
| 1211 |
nil |
| 1212 |
Printing the results ... |
| 1213 |
Printing is done. |
| 1214 |
nil |
| 1215 |
Closing the streams.Cleaning the variables |
| 1216 |
nil |
| 1217 |
0 |
| 1218 |
0 |
| 1219 |
0 |
| 1220 |
0 |
| 1221 |
0 |
| 1222 |
t |
| 1223 |
|
| 1224 |
nil |
| 1225 |
Last test finished |
| 1226 |
"Last test finished" |
| 1227 |
256 |
| 1228 |
nil |
| 1229 |
3 lisp> Exiting lisp |