i i i i i i i ooooo o ooooooo ooooo ooooo I I I I I I I 8 8 8 8 8 o 8 8 I \ `+' / I 8 8 8 8 8 8 \ `-+-' / 8 8 8 ooooo 8oooo `-__|__-' 8 8 8 8 8 | 8 o 8 8 o 8 8 ------+------ ooooo 8oooooo ooo8ooo ooooo 8 Copyright (c) Bruno Haible, Michael Stoll 1992, 1993 Copyright (c) Bruno Haible, Marcus Daniels 1994-1997 Copyright (c) Bruno Haible, Pierpaolo Bernardi, Sam Steingold 1998 Copyright (c) Bruno Haible, Sam Steingold 1999-2000 Copyright (c) Sam Steingold, Bruno Haible 2001-2004 Welcome to the BERGMAN system. (v. 0.988) NIL NIL NEW TEST:simple commutative ("NEW TEST 1:simple commutative ") NIL simple commutative ("simple commutative ") NIL algebraic form input> T #\X - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL Cleaning the variables NIL NIL NEW TEST:simple noncommutative ("NEW TEST 2:simple noncommutative") NIL NIL algebraic form input> T - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL Cleaning the variables NIL NIL NEW TEST:ncpbhgroebner ("NEW TEST 3:ncpbhgroebner") 6 algebraic form input> T % No. of Spolynomials calculated until degree 2: 0 % No. of ReducePol(0) demanded until degree 2: 0 % Time: 110 % No. of Spolynomials calculated until degree 3: 2 % No. of ReducePol(0) demanded until degree 3: 0 % Time: 130 % No. of Spolynomials calculated until degree 4: 8 % No. of ReducePol(0) demanded until degree 4: 5 % Time: 140 NIL Cleaning the variables NIL NIL NEW TEST:Commutative Hilbert series ("NEW TEST 4:Commutative Hilbert series") T NIL 7 algebraic form input> T #\X NIL Cleaning the variables NIL NIL NEW TEST: Hilbert series interrupt strategy: commutative ("NEW TEST 5: Hilbert series interrupt strategy: commutative") ORDINARY T NIL algebraic form input> T #\X - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL Cleaning the variables NIL MINHILBLIMITS NIL NEW TEST: Weights handling: commutative ("NEW TEST 6: Weights handling: commutative") NIL NIL algebraic form input> T - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL (1 1 2) Cleaning the variables NIL NIL NEW TEST: Weights handling: non-commutative ("NEW TEST 7: Weights handling: non-commutative") NIL 6 NIL algebraic form input> T - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL (1 1 2) Cleaning the variables NIL NIL NEW TEST: Eliminating ordering: Groebner basis ("NEW TEST 8: Eliminating ordering: Groebner basis") NIL 6 algebraic form input> T - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL NIL Cleaning the variables NIL NIL NEW TEST: modulehseries ("NEW TEST 9: modulehseries") '(OutModFile ScInput InModFile *HSisLoaded *PBSERIES) WARNING: DEFUN/DEFMACRO: redefining macro MODULEHSERIES in top-level, was defined in /home/guests/sveta/b9881/auxil/topproc.sl 10 2 algebraic form input> T +23*z^2 +106*z^3 +489*z^4 +2256*z^5 +10408*z^6 algebraic form input> T +23*z^2 +105*z^3 +478*z^4 +2175*z^5 +9896*z^6 Here is (1-H)^(-1) for Hilbert series H of the module +1 +2*t^1 +10*t^2 +45*t^3 +204*t^4 +928*t^5 +4222*t^6 Here is the Hilbert series H of the module +2*t^1 +6*t^2 +13*t^3 +28*t^4 +64*t^5 +149*t^6 NIL Cleaning the variables NIL NIL NEW TEST: Anick trivial ("NEW TEST 10: Anick trivial") "../../test_bergman/clisp/anick_tm.out" 4 algebraic form input> T #\X The Anick resolution initialization... B(1,1)=2 The Anick resolution initialization done. Calculating the Anick resolution in degree 2... B(1,1)=2 B(2,2)=2 0 1 2 +---------- 0 | 1 2 2 1 | - - Printing the results ... Printing is done. end of Calculations. Calculating the Anick resolution in degree 3... B(1,1)=2 B(2,2)=2 B(3,3)=1 0 1 2 3 +-------------- 0 | 1 2 2 1 1 | - - - 2 | - - Printing the results ... Printing is done. end of Calculations. Calculating the Anick resolution in degree 4... B(1,1)=2 B(2,2)=2 B(3,3)=1 B(3,4)=1 B(4,4)=1 0 1 2 3 4 +------------------ 0 | 1 2 2 1 1 1 | - - - 1 2 | - - - 3 | - - Printing the results ... Printing is done. end of Calculations. NIL NIL Printing the results ... Printing is done. NIL Closing the streams.Cleaning the variables NIL NIL NEW TEST: Modulebettinumbers ("NEW TEST 11: Modulebettinumbers") "../../test_bergman/clisp/modbtn.out" *** We turn on the MODULE mode 4 1 algebraic form input> T The Anick resolution initialization... B(0,0)=1 The Anick resolution initialization done. Calculating the module Anick resolution in degree 2... B(0,0)=1 B(1,1)=1 0 1 2 +---------- 0 | 1 1 1 | - end of Calculations. Calculating the module Anick resolution in degree 3... B(0,0)=1 B(1,1)=1 B(2,2)=1 0 1 2 3 +-------------- 0 | 1 1 1 1 | - - 2 | - end of Calculations. Groebner basis is finite. If you want to continue calculations until the maximal degree type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG)) NIL Calculating the module Anick resolution in degree 4... B(0,0)=1 B(1,1)=1 B(2,2)=1 B(3,3)=1 0 1 2 3 4 +------------------ 0 | 1 1 1 1 1 | - - - 2 | - - 3 | - end of Calculations. Calculating the module Anick resolution in degree 5... B(0,0)=1 B(1,1)=1 B(2,2)=1 B(3,3)=1 B(4,4)=1 0 1 2 3 4 5 +---------------------- 0 | 1 1 1 1 1 1 | - - - - 2 | - - - 3 | - - 4 | - end of Calculations. NIL Printing the results ... Printing is done. NIL Closing the streams.Cleaning the variables NIL NIL NEW TEST: Factor-algebra ("NEW TEST 12: Factor-algebra ") "../../test_bergman/clisp/fact.out" 5 algebraic form input> T The Anick resolution initialization... B(0,0)=1 The Anick resolution initialization done. Calculating the module Anick resolution in degree 2... B(0,0)=1 B(1,1)=2 0 1 2 +---------- 0 | 1 2 1 | - end of Calculations. Calculating the module Anick resolution in degree 3... B(0,0)=1 B(1,1)=2 B(1,2)=1 B(2,2)=1 0 1 2 3 +-------------- 0 | 1 2 1 1 | - 1 2 | - end of Calculations. Calculating the module Anick resolution in degree 4... B(0,0)=1 B(1,1)=2 B(1,2)=1 B(2,2)=1 B(2,3)=2 0 1 2 3 4 +------------------ 0 | 1 2 1 - 1 | - 1 2 2 | - - 3 | - end of Calculations. Calculating the module Anick resolution in degree 5... B(0,0)=1 B(1,1)=2 B(1,2)=1 B(2,2)=1 B(2,3)=2 B(3,4)=1 0 1 2 3 4 5 +---------------------- 0 | 1 2 1 - - 1 | - 1 2 1 2 | - - - 3 | - - 4 | - end of Calculations. Calculating the module Anick resolution in degree 6... B(0,0)=1 B(1,1)=2 B(1,2)=1 B(2,2)=1 B(2,3)=2 B(3,4)=1 0 1 2 3 4 5 +---------------------- 0 | 1 2 1 - - 1 | - 1 2 1 2 | - - - 3 | - - 4 | - end of Calculations. Calculating the module Anick resolution in degree 7... B(0,0)=1 B(1,1)=2 B(1,2)=1 B(2,2)=1 B(2,3)=2 B(3,4)=1 0 1 2 3 4 5 +---------------------- 0 | 1 2 1 - - 1 | - 1 2 1 2 | - - - 3 | - - 4 | - end of Calculations. Calculating the module Anick resolution in degree 8... B(0,0)=1 B(1,1)=2 B(1,2)=1 B(2,2)=1 B(2,3)=2 B(3,4)=1 0 1 2 3 4 5 +---------------------- 0 | 1 2 1 - - 1 | - 1 2 1 2 | - - - 3 | - - 4 | - end of Calculations. NIL NIL Printing the results ... Printing is done. NIL Closing the streams.Cleaning the variables NIL NIL NEW TEST: Betti numbers for two modules ("NEW TEST 13: Betti numbers for two modules") "../../test_bergman/clisp/two.out" *** We turn on the TWOMODULES mode 8 1 1 algebraic form input> T The Anick resolution initialization (for two modules)... The Anick resolution initialization done. Calculating the module Anick resolution in degree 2... B(0,0)=1 0 1 2 +---------- 0 | 1 end of Calculations. Groebner basis is finite. If you want to continue calculations until the maximal degree type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG)) NIL Calculating the module Anick resolution in degree 3... B(0,0)=1 0 1 2 +---------- 0 | 1 end of Calculations. Calculating the module Anick resolution in degree 4... B(0,0)=1 B(0,2)=1 0 1 2 3 4 +------------------ 0 | 1 - - 1 | - - 2 | 1 end of Calculations. Calculating the module Anick resolution in degree 5... B(0,0)=1 B(0,2)=1 B(0,3)=2 0 1 2 3 4 5 +---------------------- 0 | 1 - - - 1 | - - - 2 | 1 - 3 | 2 end of Calculations. Calculating the module Anick resolution in degree 6... B(0,0)=1 B(0,2)=1 B(0,3)=2 B(0,4)=4 0 1 2 3 4 5 6 +-------------------------- 0 | 1 - - - - 1 | - - - - 2 | 1 - - 3 | 2 - 4 | 4 end of Calculations. NIL Printing the results ... Printing is done. NIL Closing the streams.Cleaning the variables NIL NIL NEW TEST: Betti numbers for two modules: hochschild ("NEW TEST 14: Betti numbers for two modules: hochschild") "../../test_bergman/clisp/hoch.out" 6 1 1 algebraic form input> T The Anick resolution initialization (for two modules)... The Anick resolution initialization done. Calculating the module Anick resolution in degree 2... B(0,0)=1 0 1 2 +---------- 0 | 1 end of Calculations. Calculating the module Anick resolution in degree 3... B(0,0)=1 B(0,1)=2 B(1,1)=2 0 1 2 3 +-------------- 0 | 1 2 1 | 2 end of Calculations. Calculating the module Anick resolution in degree 4... B(0,0)=1 B(0,1)=2 B(1,1)=2 B(0,2)=2 B(1,2)=2 0 1 2 3 4 +------------------ 0 | 1 2 - 1 | 2 2 2 | 2 end of Calculations. Calculating the module Anick resolution in degree 5... B(0,0)=1 B(0,1)=2 B(1,1)=2 B(0,2)=2 B(1,2)=2 B(0,3)=2 B(1,3)=2 0 1 2 3 4 5 +---------------------- 0 | 1 2 - - 1 | 2 2 - 2 | 2 2 3 | 2 end of Calculations. NIL NIL Printing the results ... Printing is done. NIL Closing the streams.Cleaning the variables NIL NIL NEW TEST: Hochschild homology ("NEW TEST 15: Hochschild homology") "../../test_bergman/clisp/hoch1.out" 5 algebraic form input> T The Anick resolution initialization (for two modules)... The Anick resolution initialization done. Calculating the module Anick resolution in degree 2... B(0,0)=1 0 1 2 +---------- 0 | 1 end of Calculations. Calculating the module Anick resolution in degree 3... B(0,0)=1 B(0,1)=2 B(1,1)=2 0 1 2 3 +-------------- 0 | 1 2 1 | 2 end of Calculations. Calculating the module Anick resolution in degree 4... B(0,0)=1 B(0,1)=2 B(1,1)=2 B(0,2)=2 B(1,2)=2 0 1 2 3 4 +------------------ 0 | 1 2 - 1 | 2 2 2 | 2 end of Calculations. Calculating the module Anick resolution in degree 5... B(0,0)=1 B(0,1)=2 B(1,1)=2 B(0,2)=2 B(1,2)=2 B(0,3)=2 B(1,3)=2 0 1 2 3 4 5 +---------------------- 0 | 1 2 - - 1 | 2 2 - 2 | 2 2 3 | 2 end of Calculations. NIL NIL Printing the results ... Printing is done. NIL Closing the streams.Cleaning the variables NIL NIL NEW TEST: simple noncommutative char2 ("NEW TEST 16: simple noncommutative char2 ") ANICK NIL T NIL 5 algebraic form input> T #\X - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL Cleaning the variables NIL NIL NEW TEST: simple noncommutative char5 ("NEW TEST 17: simple noncommutative char5 ") NONE NIL '(GBasis NOOFSPOLCALCS *IMMEDIATEFULLREDUCTION NOOFNILREDUCTIONS) '(*REDEFMSG *USERMODE *PWRDS *MSG) T NIL 6 algebraic form input> T #\X - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL Cleaning the variables NIL NIL NEW TEST: simple with modlogarithms ("NEW TEST 18: simple with modlogarithms") NONE NIL ORDINARY '(GBasis cGBasis NOOFSPOLCALCS *IMMEDIATEFULLREDUCTION LOGVECT EXPVECT *IMMEDIATECRIT NOOFNILREDUCTIONS *SAVEDEGREE &*StgFinalOutputChan *DEGREEPRINTOUTPUT DegGBasis *PBSERIES cPolSubsPri) '(Pek AO+ AO* AO^ AObop+ *REDEFMSG *USERMODE *PWRDS *MSG) T NIL 6 algebraic form input> T #\X - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL Cleaning the variables NIL MODLOGARITHMIC T NIL NEW TEST: Leftmodulebettinumbers ("NEW TEST 19: Leftmodulebettinumbers") T NONE "../../test_bergman/clisp/leftmodbtn.out" *** We turn on the MODULE mode 15 1 algebraic form input> T The Anick resolution initialization... B(0,0)=1 The Anick resolution initialization done. Calculating the module Anick resolution in degree 2... B(0,0)=1 B(1,1)=1 0 1 2 +---------- 0 | 1 1 1 | - end of Calculations. Calculating the module Anick resolution in degree 3... B(0,0)=1 B(1,1)=1 B(2,2)=1 0 1 2 3 +-------------- 0 | 1 1 1 1 | - - 2 | - end of Calculations. Groebner basis is finite. If you want to continue calculations until the maximal degree type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG)) NIL Calculating the module Anick resolution in degree 4... B(0,0)=1 B(1,1)=1 B(2,2)=1 B(3,3)=1 0 1 2 3 4 +------------------ 0 | 1 1 1 1 1 | - - - 2 | - - 3 | - end of Calculations. Calculating the module Anick resolution in degree 5... B(0,0)=1 B(1,1)=1 B(2,2)=1 B(3,3)=1 B(4,4)=1 0 1 2 3 4 5 +---------------------- 0 | 1 1 1 1 1 1 | - - - - 2 | - - - 3 | - - 4 | - end of Calculations. NIL Printing the results ... Printing is done. NIL ANICK Closing the streams.Cleaning the variables NIL NIL NEW TEST: Rabbit with setrabbit ("NEW TEST 21: Rabbit with setrabbit") 8 algebraic form input> T #\X steps: 2,2,8 Cleaning the variables RABBIT: Added step, Maxdegree=4 Jump number 1 Cleaning the variables RABBIT: Jump number 2 Cleaning the variables RABBIT: Jump number 3 Cleaning the variables RABBIT: Added step, Maxdegree=6 Jump number 4 GB is completely calculated Rabbit has finishied jumping. NIL Cleaning the variables NIL NIL NIL NEW TEST 21: Skipcdeg - test N1 ("NEW TEST 21: Skipcdeg - test N1") ORDINARY T NIL 6 algebraic form input> T #\X % No. of Spolynomials calculated until degree 2: 0 % Time: 1830 % No. of Spolynomials calculated until degree 3: 0 % Time: 1850 % No. of Spolynomials calculated until degree 4: 0 % Time: 1870 % No. of Spolynomials calculated until degree 5: 0 % Time: 1880 % No. of Spolynomials calculated until degree 6: 4 % Time: 1900 % No. of Spolynomials calculated until degree 7: 9 % Time: 1910 % No. of Spolynomials calculated until degree 8: 15 % Time: 1930 % No. of Spolynomials calculated until degree 9: 22 % Time: 1940 % No. of Spolynomials calculated until degree 10: 30 % Time: 1950 - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL Cleaning the variables NIL NIL NEW TEST 22:Ignorecdeg ("NEW TEST 22:Ignorecdeg") MINHILBLIMITS T NIL 10 algebraic form input> T #\X % No. of Spolynomials calculated until degree 2: 0 % Time: 1990 % No. of Spolynomials calculated until degree 3: 0 % Time: 2000 % No. of Spolynomials calculated until degree 4: 0 % Time: 2020 % No. of Spolynomials calculated until degree 5: 1 % Time: 2030 % No. of Spolynomials calculated until degree 6: 3 % Time: 2050 % No. of Spolynomials calculated until degree 7: 6 % Time: 2060 % No. of Spolynomials calculated until degree 8: 10 % Time: 2080 % No. of Spolynomials calculated until degree 9: 15 % Time: 2090 % No. of Spolynomials calculated until degree 10: 21 % Time: 2110 - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL MINHILBLIMITS Cleaning the variables NIL NIL NEW TEST 22: Matrix ordering ("NEW TEST 22: Matrix ordering") NIL NIL NIL NIL algebraic form input> T #\X % No. of Spolynomials calculated until degree 3: 0 % Time: 2060 % No. of Spolynomials calculated until degree 5: 0 % Time: 2080 % No. of Spolynomials calculated until degree 6: 0 % Time: 2090 % No. of Spolynomials calculated until degree 7: 1 % Time: 2100 % No. of Spolynomials calculated until degree 8: 3 % Time: 2110 % No. of Spolynomials calculated until degree 9: 6 % Time: 2120 % No. of Spolynomials calculated until degree 10: 7 % Time: 2140 - All is OK (I hope). Now you may (e. g.): - kill bergman with (QUIT); or - interrupt bergman with ^Z; or - clear the memory with (CLEARIDEAL), and run a new (SIMPLE). NIL Cleaning the variables NIL NIL NIL NEW TEST 24: Test input data ("NEW TEST 24: Test input data") NIL NIL algebraic form input> T ((4 4) (5 NIL 5 5 5 5) (6)) #\X T Cleaning the variables NIL NIL Last test finished ("Last test finished") Bye.