######## Lehrstuhl D fuer Mathematik ### #### RWTH Aachen ## ## ## # ####### ######### ## # ## ## # ## ## # # ## # ## #### ## ## # # ## ##### ### ## ## ## ## ######### # ######### ####### # # ## Version 3 # ### Release 4.4 # ## # 18 Apr 97 # ## # ## # Alice Niemeyer, Werner Nickel, Martin Schoenert ## # Johannes Meier, Alex Wegner, Thomas Bischops ## # Frank Celler, Juergen Mnich, Udo Polis ### ## Thomas Breuer, Goetz Pfeiffer, Hans U. Besche ###### Volkmar Felsch, Heiko Theissen, Alexander Hulpke Ansgar Kaup, Akos Seress, Erzsebet Horvath Bettina Eick For help enter: ? #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) WELCOME to the CHEVIE package, Version 4.devel (April 2004) http://www.math.rwth-aachen.de/~CHEVIE for the stable version 3.1 http://www.math.jussieu.fr/~jmichel/chevie for this version Meinolf Geck, Frank Luebeck, Gerhard Hiss, Gunter Malle, Jean Michel, Goetz Pfeiffer Lehrstuhl D fuer Mathematik, RWTH Aachen Universit'e Paris VII AG Computational Mathematics Universit"at Kassel Galway University This replaces the former weyl package. For first help type ?CHEVIE Version 4 -- a short introduction #I ReadChv( "lib/polycyc" ) #I ReadLib( "numfield" ) #I ReadLib( "abattoir" ) #I ReadLib( "field" ) #I ReadLib( "domain" ) #I ReadLib( "mapping" ) #I ReadLib( "grpelms" ) #I ReadLib( "group" ) #I ReadLib( "grphomom" ) #I ReadLib( "dispatch" ) #I ReadLib( "operatio" ) #I ReadLib( "grplatt" ) #I ReadLib( "grpcoset" ) #I ReadLib( "grpprods" ) #I ReadLib( "grpctbl" ) #I ReadLib( "monomial" ) #I ReadLib( "classfun" ) #I ReadLib( "integer" ) #I ReadLib( "ring" ) #I ReadLib( "rational" ) #I ReadLib( "polynom" ) #I ReadLib( "polyfld" ) #I ReadChv( "lib/patch" ) #I ReadLib( "matgrp" ) #I ReadLib( "matrix" ) #I ReadLib( "algebra" ) #I ReadLib( "module" ) #I ReadLib( "rowspace" ) #I ReadLib( "vecspace" ) #I ReadLib( "matgrp" ) #I ReadLib( "matring" ) #I ReadLib( "finfield" ) #I ReadChv( "lib/classinv" ) #I ReadLib( "permgrp" ) #I ReadLib( "permutat" ) #I ReadLib( "permgrp" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "aggroup" ) #I ReadLib( "agprops" ) #I ReadLib( "agsubgrp" ) #I ReadLib( "aghomomo" ) #I ReadLib( "agcoset" ) #I ReadLib( "agnorm" ) #I ReadLib( "aghall" ) #I ReadLib( "aginters" ) #I ReadLib( "agcomple" ) #I ReadLib( "agclass" ) #I ReadLib( "agcent" ) #I ReadLib( "agctbl" ) #I ReadLib( "onecohom" ) #I ReadLib( "saggroup" ) #I ReadLib( "sagsbgrp" ) #I ReadLib( "permprod" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "permprod" ) #I ReadChv( "auto" ) #I ReadChv( "tbl/compat3" ) #I ReadLib( "ctbasic" ) #I ReadChv( "prg/hecke" ) #I ReadChv( "prg/abscox" ) #I ReadChv( "prg/abshecke" ) #I ReadChv( "prg/permroot" ) #I ReadChv( "prg/heckeelt" ) #I ReadChv( "lib/util" ) #I ReadChv( "prg/kl" ) #I ReadChv( "prg/heckemod" ) #I ReadChv( "prg/complexr" ) #I ReadChv( "prg/hastype" ) #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "prg/refltype" ) #I ReadChv( "unip/families" ) #I ReadLib( "cyclotom" ) #I ReadLib( "string" ) #I ReadChv( "tbl/cmplximp" ) #I ReadChv( "prg/coxeter" ) #I ReadChv( "unip/lusztig" ) #I ReadChv( "prg/wclsinv" ) #I ReadChv( "prg/dispatch" ) #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) done #I ReadChv( "work/init" ) #I ReadChv( "work/init" ) done #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "unip/init" ) done #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) #I ReadVK( "patch" ) #I ReadLib( "polyrat" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpgrp" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpsgpres" ) #I ReadVK( "pres" ) Welcome to the VKCURVE package, Version 1.2 (16-10-2003) http://www.math.jussieu.fr/~jmichel/vkcurve.html David Bessis, Jean Michel CNRS -- Universities Lyon I, Paris VII and Picardie #I ReadVK( "mvp" ) #I ReadVK( "mvrf" ) #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) done gap> #I ReadVK( "global" ) #I ReadVK( "global" ) done #I ReadChv( "lib/complex" ) #I ReadChv( "lib/complex" ) done #I ReadVK( "util" ) #I ReadVK( "util" ) done Discriminant has 35 roots, of which 1 are distinct #I ReadLib( "gaussian" ) #I ReadLib( "gaussian" ) done Computing roots of discriminant... #I ReadVK( "polyroot" ) #I ReadVK( "polyroot" ) done #I ReadVK( "loops" ) #I ReadVK( "loops" ) done # There are 4 segments in 1 loops #I ReadChv( "lib/decimal" ) #I ReadChv( "lib/decimal" ) done Computing zeros of curve at the 4 segment extremities... <1/4>11.12.7.10.8.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] <2/4>21.12.11.8. ######## Lehrstuhl D fuer Mathematik ### #### RWTH Aachen ## ## ## # ####### ######### ## # ## ## # ## ## # # ## # ## #### ## ## # # ## ##### ### ## ## ## ## ######### # ######### ####### # # ## Version 3 # ### Release 4.4 # ## # 18 Apr 97 # ## # ## # Alice Niemeyer, Werner Nickel, Martin Schoenert ## # Johannes Meier, Alex Wegner, Thomas Bischops ## # Frank Celler, Juergen Mnich, Udo Polis ### ## Thomas Breuer, Goetz Pfeiffer, Hans U. Besche ###### Volkmar Felsch, Heiko Theissen, Alexander Hulpke Ansgar Kaup, Akos Seress, Erzsebet Horvath Bettina Eick For help enter: ? #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) WELCOME to the CHEVIE package, Version 4.devel (April 2004) http://www.math.rwth-aachen.de/~CHEVIE for the stable version 3.1 http://www.math.jussieu.fr/~jmichel/chevie for this version Meinolf Geck, Frank Luebeck, Gerhard Hiss, Gunter Malle, Jean Michel, Goetz Pfeiffer Lehrstuhl D fuer Mathematik, RWTH Aachen Universit'e Paris VII AG Computational Mathematics Universit"at Kassel Galway University This replaces the former weyl package. For first help type ?CHEVIE Version 4 -- a short introduction #I ReadChv( "lib/polycyc" ) #I ReadLib( "numfield" ) #I ReadLib( "abattoir" ) #I ReadLib( "field" ) #I ReadLib( "domain" ) #I ReadLib( "mapping" ) #I ReadLib( "grpelms" ) #I ReadLib( "group" ) #I ReadLib( "grphomom" ) #I ReadLib( "dispatch" ) #I ReadLib( "operatio" ) #I ReadLib( "grplatt" ) #I ReadLib( "grpcoset" ) #I ReadLib( "grpprods" ) #I ReadLib( "grpctbl" ) #I ReadLib( "monomial" ) #I ReadLib( "classfun" ) #I ReadLib( "integer" ) #I ReadLib( "ring" ) #I ReadLib( "rational" ) #I ReadLib( "polynom" ) #I ReadLib( "polyfld" ) #I ReadChv( "lib/patch" ) #I ReadLib( "matgrp" ) #I ReadLib( "matrix" ) #I ReadLib( "algebra" ) #I ReadLib( "module" ) #I ReadLib( "rowspace" ) #I ReadLib( "vecspace" ) #I ReadLib( "matgrp" ) #I ReadLib( "matring" ) #I ReadLib( "finfield" ) #I ReadChv( "lib/classinv" ) #I ReadLib( "permgrp" ) #I ReadLib( "permutat" ) #I ReadLib( "permgrp" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "aggroup" ) #I ReadLib( "agprops" ) #I ReadLib( "agsubgrp" ) #I ReadLib( "aghomomo" ) #I ReadLib( "agcoset" ) #I ReadLib( "agnorm" ) #I ReadLib( "aghall" ) #I ReadLib( "aginters" ) #I ReadLib( "agcomple" ) #I ReadLib( "agclass" ) #I ReadLib( "agcent" ) #I ReadLib( "agctbl" ) #I ReadLib( "onecohom" ) #I ReadLib( "saggroup" ) #I ReadLib( "sagsbgrp" ) #I ReadLib( "permprod" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "permprod" ) #I ReadChv( "auto" ) #I ReadChv( "tbl/compat3" ) #I ReadLib( "ctbasic" ) #I ReadChv( "prg/hecke" ) #I ReadChv( "prg/abscox" ) #I ReadChv( "prg/abshecke" ) #I ReadChv( "prg/permroot" ) #I ReadChv( "prg/heckeelt" ) #I ReadChv( "lib/util" ) #I ReadChv( "prg/kl" ) #I ReadChv( "prg/heckemod" ) #I ReadChv( "prg/complexr" ) #I ReadChv( "prg/hastype" ) #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "prg/refltype" ) #I ReadChv( "unip/families" ) #I ReadLib( "cyclotom" ) #I ReadLib( "string" ) #I ReadChv( "tbl/cmplximp" ) #I ReadChv( "prg/coxeter" ) #I ReadChv( "unip/lusztig" ) #I ReadChv( "prg/wclsinv" ) #I ReadChv( "prg/dispatch" ) #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) done #I ReadChv( "work/init" ) #I ReadChv( "work/init" ) done #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "unip/init" ) done #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) #I ReadVK( "patch" ) #I ReadLib( "polyrat" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpgrp" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpsgpres" ) #I ReadVK( "pres" ) Welcome to the VKCURVE package, Version 1.2 (16-10-2003) http://www.math.jussieu.fr/~jmichel/vkcurve.html David Bessis, Jean Michel CNRS -- Universities Lyon I, Paris VII and Picardie #I ReadVK( "mvp" ) #I ReadVK( "mvrf" ) #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) done gap> #I ReadVK( "global" ) #I ReadVK( "global" ) done #I ReadChv( "lib/complex" ) #I ReadChv( "lib/complex" ) done #I ReadVK( "util" ) #I ReadVK( "util" ) done Discriminant has 35 roots, of which 1 are distinct #I ReadLib( "gaussian" ) #I ReadLib( "gaussian" ) done Computing roots of discriminant... #I ReadVK( "polyroot" ) #I ReadVK( "polyroot" ) done #I ReadVK( "loops" ) #I ReadVK( "loops" ) done # There are 4 segments in 1 loops #I ReadChv( "lib/decimal" ) #I ReadChv( "lib/decimal" ) done Computing zeros of curve at the 4 segment extremities... <1/4>11.12.7.10.8.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] <2/4>21.12.11.8.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 1, 5 ] ] <3/4>7.14.12.15.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 2, 3 ] ] <4/4>6.14.13.10.10.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] #I ReadChv( "prg/garside" ) #I ReadChv( "prg/garside" ) done #I ReadChv( "prg/gencox" ) #I ReadChv( "prg/gencox" ) done #I ReadGrp( "basic" ) #I ReadGrp( "basic" ) done #I ReadGrp( "permgrp" ) #I ReadGrp( "permgrp" ) done #I ReadChv( "tbl/weyla" ) #I ReadLib( "ctsymmet" ) #I ReadLib( "combinat" ) #I ReadChv( "tbl/weyla" ) done #I ReadVK( "truemono" ) #I ReadVK( "truemono" ) done Initializing monodromy data <1/4> 1 time= 0 ?5?5?5?5?5?5 #I ReadVK( "plbraid" ) #I ReadVK( "plbraid" ) done <1/4> 2 time= 0.03125 ?5?5?5?5?5?5 <1/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <1/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <1/4> 5 time= 0.140625 ?5?5?5?5?5?5 <1/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 7 time= 0.203125 ?5?5?5?5?5?5 <1/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <1/4> 9 time= 0.26171875 ?5?5?5?5?5?5 ######## Lehrstuhl D fuer Mathematik ### #### RWTH Aachen ## ## ## # ####### ######### ## # ## ## # ## ## # # ## # ## #### ## ## # # ## ##### ### ## ## ## ## ######### # ######### ####### # # ## Version 3 # ### Release 4.4 # ## # 18 Apr 97 # ## # ## # Alice Niemeyer, Werner Nickel, Martin Schoenert ## # Johannes Meier, Alex Wegner, Thomas Bischops ## # Frank Celler, Juergen Mnich, Udo Polis ### ## Thomas Breuer, Goetz Pfeiffer, Hans U. Besche ###### Volkmar Felsch, Heiko Theissen, Alexander Hulpke Ansgar Kaup, Akos Seress, Erzsebet Horvath Bettina Eick For help enter: ? #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) WELCOME to the CHEVIE package, Version 4.devel (April 2004) http://www.math.rwth-aachen.de/~CHEVIE for the stable version 3.1 http://www.math.jussieu.fr/~jmichel/chevie for this version Meinolf Geck, Frank Luebeck, Gerhard Hiss, Gunter Malle, Jean Michel, Goetz Pfeiffer Lehrstuhl D fuer Mathematik, RWTH Aachen Universit'e Paris VII AG Computational Mathematics Universit"at Kassel Galway University This replaces the former weyl package. For first help type ?CHEVIE Version 4 -- a short introduction #I ReadChv( "lib/polycyc" ) #I ReadLib( "numfield" ) #I ReadLib( "abattoir" ) #I ReadLib( "field" ) #I ReadLib( "domain" ) #I ReadLib( "mapping" ) #I ReadLib( "grpelms" ) #I ReadLib( "group" ) #I ReadLib( "grphomom" ) #I ReadLib( "dispatch" ) #I ReadLib( "operatio" ) #I ReadLib( "grplatt" ) #I ReadLib( "grpcoset" ) #I ReadLib( "grpprods" ) #I ReadLib( "grpctbl" ) #I ReadLib( "monomial" ) #I ReadLib( "classfun" ) #I ReadLib( "integer" ) #I ReadLib( "ring" ) #I ReadLib( "rational" ) #I ReadLib( "polynom" ) #I ReadLib( "polyfld" ) #I ReadChv( "lib/patch" ) #I ReadLib( "matgrp" ) #I ReadLib( "matrix" ) #I ReadLib( "algebra" ) #I ReadLib( "module" ) #I ReadLib( "rowspace" ) #I ReadLib( "vecspace" ) #I ReadLib( "matgrp" ) #I ReadLib( "matring" ) #I ReadLib( "finfield" ) #I ReadChv( "lib/classinv" ) #I ReadLib( "permgrp" ) #I ReadLib( "permutat" ) #I ReadLib( "permgrp" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "aggroup" ) #I ReadLib( "agprops" ) #I ReadLib( "agsubgrp" ) #I ReadLib( "aghomomo" ) #I ReadLib( "agcoset" ) #I ReadLib( "agnorm" ) #I ReadLib( "aghall" ) #I ReadLib( "aginters" ) #I ReadLib( "agcomple" ) #I ReadLib( "agclass" ) #I ReadLib( "agcent" ) #I ReadLib( "agctbl" ) #I ReadLib( "onecohom" ) #I ReadLib( "saggroup" ) #I ReadLib( "sagsbgrp" ) #I ReadLib( "permprod" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "permprod" ) #I ReadChv( "auto" ) #I ReadChv( "tbl/compat3" ) #I ReadLib( "ctbasic" ) #I ReadChv( "prg/hecke" ) #I ReadChv( "prg/abscox" ) #I ReadChv( "prg/abshecke" ) #I ReadChv( "prg/permroot" ) #I ReadChv( "prg/heckeelt" ) #I ReadChv( "lib/util" ) #I ReadChv( "prg/kl" ) #I ReadChv( "prg/heckemod" ) #I ReadChv( "prg/complexr" ) #I ReadChv( "prg/hastype" ) #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "prg/refltype" ) #I ReadChv( "unip/families" ) #I ReadLib( "cyclotom" ) #I ReadLib( "string" ) #I ReadChv( "tbl/cmplximp" ) #I ReadChv( "prg/coxeter" ) #I ReadChv( "unip/lusztig" ) #I ReadChv( "prg/wclsinv" ) #I ReadChv( "prg/dispatch" ) #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) done #I ReadChv( "work/init" ) #I ReadChv( "work/init" ) done #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "unip/init" ) done #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) #I ReadVK( "patch" ) #I ReadLib( "polyrat" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpgrp" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpsgpres" ) #I ReadVK( "pres" ) Welcome to the VKCURVE package, Version 1.2 (16-10-2003) http://www.math.jussieu.fr/~jmichel/vkcurve.html David Bessis, Jean Michel CNRS -- Universities Lyon I, Paris VII and Picardie #I ReadVK( "mvp" ) #I ReadVK( "mvrf" ) #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) done gap> #I ReadVK( "global" ) #I ReadVK( "global" ) done #I ReadChv( "lib/complex" ) #I ReadChv( "lib/complex" ) done #I ReadVK( "util" ) #I ReadVK( "util" ) done Discriminant has 35 roots, of which 1 are distinct #I ReadLib( "gaussian" ) #I ReadLib( "gaussian" ) done Computing roots of discriminant... #I ReadVK( "polyroot" ) #I ReadVK( "polyroot" ) done #I ReadVK( "loops" ) #I ReadVK( "loops" ) done # There are 4 segments in 1 loops #I ReadChv( "lib/decimal" ) #I ReadChv( "lib/decimal" ) done Computing zeros of curve at the 4 segment extremities... <1/4>11.12.7.10.8.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] <2/4>21.12.11.8.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 1, 5 ] ] <3/4>7.14.12.15.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 2, 3 ] ] <4/4>6.14.13.10.10.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] #I ReadChv( "prg/garside" ) #I ReadChv( "prg/garside" ) done #I ReadChv( "prg/gencox" ) #I ReadChv( "prg/gencox" ) done #I ReadGrp( "basic" ) #I ReadGrp( "basic" ) done #I ReadGrp( "permgrp" ) #I ReadGrp( "permgrp" ) done #I ReadChv( "tbl/weyla" ) #I ReadLib( "ctsymmet" ) #I ReadLib( "combinat" ) #I ReadChv( "tbl/weyla" ) done #I ReadVK( "truemono" ) #I ReadVK( "truemono" ) done Initializing monodromy data <1/4> 1 time= 0 ?5?5?5?5?5?5 #I ReadVK( "plbraid" ) #I ReadVK( "plbraid" ) done <1/4> 2 time= 0.03125 ?5?5?5?5?5?5 <1/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <1/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <1/4> 5 time= 0.140625 ?5?5?5?5?5?5 <1/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 7 time= 0.203125 ?5?5?5?5?5?5 <1/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <1/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <1/4> 10 time=0.283203125 ?5?5?5?5?5?5 <1/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <1/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <1/4> 13 time=0.365234375 ?5?5?5?5?5?5 <1/4> 14 time=0.384765625 ?5?5?5?5?5?5 <1/4> 15 time=0.412109375 ?5?5?5?5?5?5 <1/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <1/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <1/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <1/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <1/4> 20 time=0.541015625 ?4?4?4?4?4?4 <1/4> 21 time=0.568359375 ?4?4?4?4?4?4 <1/4> 22 time= 0.59375 ?4?4?4?4?4?4 <1/4> 23 time=0.619140625 ?4?4?4?4?4?4 <1/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <1/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <1/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <1/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <1/4> 29 time=0.783203125 ?3?3?3?3?3?3 <1/4> 30 time= 0.80859375 ?3?3?3?3?3?3 ######## Lehrstuhl D fuer Mathematik ### #### RWTH Aachen ## ## ## # ####### ######### ## # ## ## # ## ## # # ## # ## #### ## ## # # ## ##### ### ## ## ## ## ######### # ######### ####### # # ## Version 3 # ### Release 4.4 # ## # 18 Apr 97 # ## # ## # Alice Niemeyer, Werner Nickel, Martin Schoenert ## # Johannes Meier, Alex Wegner, Thomas Bischops ## # Frank Celler, Juergen Mnich, Udo Polis ### ## Thomas Breuer, Goetz Pfeiffer, Hans U. Besche ###### Volkmar Felsch, Heiko Theissen, Alexander Hulpke Ansgar Kaup, Akos Seress, Erzsebet Horvath Bettina Eick For help enter: ? #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) WELCOME to the CHEVIE package, Version 4.devel (April 2004) http://www.math.rwth-aachen.de/~CHEVIE for the stable version 3.1 http://www.math.jussieu.fr/~jmichel/chevie for this version Meinolf Geck, Frank Luebeck, Gerhard Hiss, Gunter Malle, Jean Michel, Goetz Pfeiffer Lehrstuhl D fuer Mathematik, RWTH Aachen Universit'e Paris VII AG Computational Mathematics Universit"at Kassel Galway University This replaces the former weyl package. For first help type ?CHEVIE Version 4 -- a short introduction #I ReadChv( "lib/polycyc" ) #I ReadLib( "numfield" ) #I ReadLib( "abattoir" ) #I ReadLib( "field" ) #I ReadLib( "domain" ) #I ReadLib( "mapping" ) #I ReadLib( "grpelms" ) #I ReadLib( "group" ) #I ReadLib( "grphomom" ) #I ReadLib( "dispatch" ) #I ReadLib( "operatio" ) #I ReadLib( "grplatt" ) #I ReadLib( "grpcoset" ) #I ReadLib( "grpprods" ) #I ReadLib( "grpctbl" ) #I ReadLib( "monomial" ) #I ReadLib( "classfun" ) #I ReadLib( "integer" ) #I ReadLib( "ring" ) #I ReadLib( "rational" ) #I ReadLib( "polynom" ) #I ReadLib( "polyfld" ) #I ReadChv( "lib/patch" ) #I ReadLib( "matgrp" ) #I ReadLib( "matrix" ) #I ReadLib( "algebra" ) #I ReadLib( "module" ) #I ReadLib( "rowspace" ) #I ReadLib( "vecspace" ) #I ReadLib( "matgrp" ) #I ReadLib( "matring" ) #I ReadLib( "finfield" ) #I ReadChv( "lib/classinv" ) #I ReadLib( "permgrp" ) #I ReadLib( "permutat" ) #I ReadLib( "permgrp" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "aggroup" ) #I ReadLib( "agprops" ) #I ReadLib( "agsubgrp" ) #I ReadLib( "aghomomo" ) #I ReadLib( "agcoset" ) #I ReadLib( "agnorm" ) #I ReadLib( "aghall" ) #I ReadLib( "aginters" ) #I ReadLib( "agcomple" ) #I ReadLib( "agclass" ) #I ReadLib( "agcent" ) #I ReadLib( "agctbl" ) #I ReadLib( "onecohom" ) #I ReadLib( "saggroup" ) #I ReadLib( "sagsbgrp" ) #I ReadLib( "permprod" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "permprod" ) #I ReadChv( "auto" ) #I ReadChv( "tbl/compat3" ) #I ReadLib( "ctbasic" ) #I ReadChv( "prg/hecke" ) #I ReadChv( "prg/abscox" ) #I ReadChv( "prg/abshecke" ) #I ReadChv( "prg/permroot" ) #I ReadChv( "prg/heckeelt" ) #I ReadChv( "lib/util" ) #I ReadChv( "prg/kl" ) #I ReadChv( "prg/heckemod" ) #I ReadChv( "prg/complexr" ) #I ReadChv( "prg/hastype" ) #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "prg/refltype" ) #I ReadChv( "unip/families" ) #I ReadLib( "cyclotom" ) #I ReadLib( "string" ) #I ReadChv( "tbl/cmplximp" ) #I ReadChv( "prg/coxeter" ) #I ReadChv( "unip/lusztig" ) #I ReadChv( "prg/wclsinv" ) #I ReadChv( "prg/dispatch" ) #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) done #I ReadChv( "work/init" ) #I ReadChv( "work/init" ) done #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "unip/init" ) done #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) #I ReadVK( "patch" ) #I ReadLib( "polyrat" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpgrp" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpsgpres" ) #I ReadVK( "pres" ) Welcome to the VKCURVE package, Version 1.2 (16-10-2003) http://www.math.jussieu.fr/~jmichel/vkcurve.html David Bessis, Jean Michel CNRS -- Universities Lyon I, Paris VII and Picardie #I ReadVK( "mvp" ) #I ReadVK( "mvrf" ) #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) done gap> #I ReadVK( "global" ) #I ReadVK( "global" ) done #I ReadChv( "lib/complex" ) #I ReadChv( "lib/complex" ) done #I ReadVK( "util" ) #I ReadVK( "util" ) done Discriminant has 35 roots, of which 1 are distinct #I ReadLib( "gaussian" ) #I ReadLib( "gaussian" ) done Computing roots of discriminant... #I ReadVK( "polyroot" ) #I ReadVK( "polyroot" ) done #I ReadVK( "loops" ) #I ReadVK( "loops" ) done # There are 4 segments in 1 loops #I ReadChv( "lib/decimal" ) #I ReadChv( "lib/decimal" ) done Computing zeros of curve at the 4 segment extremities... <1/4>11.12.7.10.8.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] <2/4>21.12.11.8.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 1, 5 ] ] <3/4>7.14.12.15.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 2, 3 ] ] <4/4>6.14.13.10.10.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] #I ReadChv( "prg/garside" ) #I ReadChv( "prg/garside" ) done #I ReadChv( "prg/gencox" ) #I ReadChv( "prg/gencox" ) done #I ReadGrp( "basic" ) #I ReadGrp( "basic" ) done #I ReadGrp( "permgrp" ) #I ReadGrp( "permgrp" ) done #I ReadChv( "tbl/weyla" ) #I ReadLib( "ctsymmet" ) #I ReadLib( "combinat" ) #I ReadChv( "tbl/weyla" ) done #I ReadVK( "truemono" ) #I ReadVK( "truemono" ) done Initializing monodromy data <1/4> 1 time= 0 ?5?5?5?5?5?5 #I ReadVK( "plbraid" ) #I ReadVK( "plbraid" ) done <1/4> 2 time= 0.03125 ?5?5?5?5?5?5 <1/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <1/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <1/4> 5 time= 0.140625 ?5?5?5?5?5?5 <1/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 7 time= 0.203125 ?5?5?5?5?5?5 <1/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <1/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <1/4> 10 time=0.283203125 ?5?5?5?5?5?5 <1/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <1/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <1/4> 13 time=0.365234375 ?5?5?5?5?5?5 <1/4> 14 time=0.384765625 ?5?5?5?5?5?5 <1/4> 15 time=0.412109375 ?5?5?5?5?5?5 <1/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <1/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <1/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <1/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <1/4> 20 time=0.541015625 ?4?4?4?4?4?4 <1/4> 21 time=0.568359375 ?4?4?4?4?4?4 <1/4> 22 time= 0.59375 ?4?4?4?4?4?4 <1/4> 23 time=0.619140625 ?4?4?4?4?4?4 <1/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <1/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <1/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <1/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <1/4> 29 time=0.783203125 ?3?3?3?3?3?3 <1/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <1/4> 31 time= 0.84375 ?2?2?2?2?2?2 <1/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <1/4> 33 time=0.912109375 ?2?2?2?2?2?2 <1/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <1/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== WARNING: singular projection (resolved) # The following braid was computed by FollowMonodromy in 35 steps. monodromy[1]:=B(-2,-3,-4,-5,-3,-4,-1,-2,-3,-1); # segment 1/4 Time=4.7sec <2/4> 1 time= 0 ?5?5?5?5?5?5 <2/4> 2 time= 0.03125 ?5?5?5?5?5?5 <2/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <2/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <2/4> 5 time= 0.140625 ?5?5?5?5?5?5 <2/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 7 time= 0.203125 ?5?5?5?5?5?5 <2/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <2/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <2/4> 10 time=0.283203125 ?5?5?5?5?5?5 <2/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <2/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <2/4> 13 time=0.365234375 ?5?5?5?5?5?5 <2/4> 14 time=0.384765625 ?5?5?5?5?5?5 <2/4> 15 time=0.412109375 ?5?5?5?5?5?5 <2/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 24 = ====================================== ######## Lehrstuhl D fuer Mathematik ### #### RWTH Aachen ## ## ## # ####### ######### ## # ## ## # ## ## # # ## # ## #### ## ## # # ## ##### ### ## ## ## ## ######### # ######### ####### # # ## Version 3 # ### Release 4.4 # ## # 18 Apr 97 # ## # ## # Alice Niemeyer, Werner Nickel, Martin Schoenert ## # Johannes Meier, Alex Wegner, Thomas Bischops ## # Frank Celler, Juergen Mnich, Udo Polis ### ## Thomas Breuer, Goetz Pfeiffer, Hans U. Besche ###### Volkmar Felsch, Heiko Theissen, Alexander Hulpke Ansgar Kaup, Akos Seress, Erzsebet Horvath Bettina Eick For help enter: ? #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) WELCOME to the CHEVIE package, Version 4.devel (April 2004) http://www.math.rwth-aachen.de/~CHEVIE for the stable version 3.1 http://www.math.jussieu.fr/~jmichel/chevie for this version Meinolf Geck, Frank Luebeck, Gerhard Hiss, Gunter Malle, Jean Michel, Goetz Pfeiffer Lehrstuhl D fuer Mathematik, RWTH Aachen Universit'e Paris VII AG Computational Mathematics Universit"at Kassel Galway University This replaces the former weyl package. For first help type ?CHEVIE Version 4 -- a short introduction #I ReadChv( "lib/polycyc" ) #I ReadLib( "numfield" ) #I ReadLib( "abattoir" ) #I ReadLib( "field" ) #I ReadLib( "domain" ) #I ReadLib( "mapping" ) #I ReadLib( "grpelms" ) #I ReadLib( "group" ) #I ReadLib( "grphomom" ) #I ReadLib( "dispatch" ) #I ReadLib( "operatio" ) #I ReadLib( "grplatt" ) #I ReadLib( "grpcoset" ) #I ReadLib( "grpprods" ) #I ReadLib( "grpctbl" ) #I ReadLib( "monomial" ) #I ReadLib( "classfun" ) #I ReadLib( "integer" ) #I ReadLib( "ring" ) #I ReadLib( "rational" ) #I ReadLib( "polynom" ) #I ReadLib( "polyfld" ) #I ReadChv( "lib/patch" ) #I ReadLib( "matgrp" ) #I ReadLib( "matrix" ) #I ReadLib( "algebra" ) #I ReadLib( "module" ) #I ReadLib( "rowspace" ) #I ReadLib( "vecspace" ) #I ReadLib( "matgrp" ) #I ReadLib( "matring" ) #I ReadLib( "finfield" ) #I ReadChv( "lib/classinv" ) #I ReadLib( "permgrp" ) #I ReadLib( "permutat" ) #I ReadLib( "permgrp" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "aggroup" ) #I ReadLib( "agprops" ) #I ReadLib( "agsubgrp" ) #I ReadLib( "aghomomo" ) #I ReadLib( "agcoset" ) #I ReadLib( "agnorm" ) #I ReadLib( "aghall" ) #I ReadLib( "aginters" ) #I ReadLib( "agcomple" ) #I ReadLib( "agclass" ) #I ReadLib( "agcent" ) #I ReadLib( "agctbl" ) #I ReadLib( "onecohom" ) #I ReadLib( "saggroup" ) #I ReadLib( "sagsbgrp" ) #I ReadLib( "permprod" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "permprod" ) #I ReadChv( "auto" ) #I ReadChv( "tbl/compat3" ) #I ReadLib( "ctbasic" ) #I ReadChv( "prg/hecke" ) #I ReadChv( "prg/abscox" ) #I ReadChv( "prg/abshecke" ) #I ReadChv( "prg/permroot" ) #I ReadChv( "prg/heckeelt" ) #I ReadChv( "lib/util" ) #I ReadChv( "prg/kl" ) #I ReadChv( "prg/heckemod" ) #I ReadChv( "prg/complexr" ) #I ReadChv( "prg/hastype" ) #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "prg/refltype" ) #I ReadChv( "unip/families" ) #I ReadLib( "cyclotom" ) #I ReadLib( "string" ) #I ReadChv( "tbl/cmplximp" ) #I ReadChv( "prg/coxeter" ) #I ReadChv( "unip/lusztig" ) #I ReadChv( "prg/wclsinv" ) #I ReadChv( "prg/dispatch" ) #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) done #I ReadChv( "work/init" ) #I ReadChv( "work/init" ) done #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "unip/init" ) done #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) #I ReadVK( "patch" ) #I ReadLib( "polyrat" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpgrp" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpsgpres" ) #I ReadVK( "pres" ) Welcome to the VKCURVE package, Version 1.2 (16-10-2003) http://www.math.jussieu.fr/~jmichel/vkcurve.html David Bessis, Jean Michel CNRS -- Universities Lyon I, Paris VII and Picardie #I ReadVK( "mvp" ) #I ReadVK( "mvrf" ) #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) done gap> #I ReadVK( "global" ) #I ReadVK( "global" ) done #I ReadChv( "lib/complex" ) #I ReadChv( "lib/complex" ) done #I ReadVK( "util" ) #I ReadVK( "util" ) done Discriminant has 35 roots, of which 1 are distinct #I ReadLib( "gaussian" ) #I ReadLib( "gaussian" ) done Computing roots of discriminant... #I ReadVK( "polyroot" ) #I ReadVK( "polyroot" ) done #I ReadVK( "loops" ) #I ReadVK( "loops" ) done # There are 4 segments in 1 loops #I ReadChv( "lib/decimal" ) #I ReadChv( "lib/decimal" ) done Computing zeros of curve at the 4 segment extremities... <1/4>11.12.7.10.8.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] <2/4>21.12.11.8.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 1, 5 ] ] <3/4>7.14.12.15.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 2, 3 ] ] <4/4>6.14.13.10.10.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] #I ReadChv( "prg/garside" ) #I ReadChv( "prg/garside" ) done #I ReadChv( "prg/gencox" ) #I ReadChv( "prg/gencox" ) done #I ReadGrp( "basic" ) #I ReadGrp( "basic" ) done #I ReadGrp( "permgrp" ) #I ReadGrp( "permgrp" ) done #I ReadChv( "tbl/weyla" ) #I ReadLib( "ctsymmet" ) #I ReadLib( "combinat" ) #I ReadChv( "tbl/weyla" ) done #I ReadVK( "truemono" ) #I ReadVK( "truemono" ) done Initializing monodromy data <1/4> 1 time= 0 ?5?5?5?5?5?5 #I ReadVK( "plbraid" ) #I ReadVK( "plbraid" ) done <1/4> 2 time= 0.03125 ?5?5?5?5?5?5 <1/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <1/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <1/4> 5 time= 0.140625 ?5?5?5?5?5?5 <1/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 7 time= 0.203125 ?5?5?5?5?5?5 <1/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <1/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <1/4> 10 time=0.283203125 ?5?5?5?5?5?5 <1/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <1/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <1/4> 13 time=0.365234375 ?5?5?5?5?5?5 <1/4> 14 time=0.384765625 ?5?5?5?5?5?5 <1/4> 15 time=0.412109375 ?5?5?5?5?5?5 <1/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <1/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <1/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <1/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <1/4> 20 time=0.541015625 ?4?4?4?4?4?4 <1/4> 21 time=0.568359375 ?4?4?4?4?4?4 <1/4> 22 time= 0.59375 ?4?4?4?4?4?4 <1/4> 23 time=0.619140625 ?4?4?4?4?4?4 <1/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <1/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <1/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <1/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <1/4> 29 time=0.783203125 ?3?3?3?3?3?3 <1/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <1/4> 31 time= 0.84375 ?2?2?2?2?2?2 <1/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <1/4> 33 time=0.912109375 ?2?2?2?2?2?2 <1/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <1/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== WARNING: singular projection (resolved) # The following braid was computed by FollowMonodromy in 35 steps. monodromy[1]:=B(-2,-3,-4,-5,-3,-4,-1,-2,-3,-1); # segment 1/4 Time=4.7sec <2/4> 1 time= 0 ?5?5?5?5?5?5 <2/4> 2 time= 0.03125 ?5?5?5?5?5?5 <2/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <2/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <2/4> 5 time= 0.140625 ?5?5?5?5?5?5 <2/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 7 time= 0.203125 ?5?5?5?5?5?5 <2/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <2/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <2/4> 10 time=0.283203125 ?5?5?5?5?5?5 <2/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <2/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <2/4> 13 time=0.365234375 ?5?5?5?5?5?5 <2/4> 14 time=0.384765625 ?5?5?5?5?5?5 <2/4> 15 time=0.412109375 ?5?5?5?5?5?5 <2/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 24 = ====================================== <2/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <2/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <2/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <2/4> 20 time=0.541015625 ?4?4?4?4?4?4 <2/4> 21 time=0.568359375 ?4?4?4?4?4?4 <2/4> 22 time= 0.59375 ?4?4?4?4?4?4 <2/4> 23 time=0.619140625 ?4?4?4?4?4?4 <2/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <2/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <2/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <2/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <2/4> 29 time=0.783203125 ?3?3?3?3?3?3 <2/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <2/4> 31 time= 0.84375 ?2?2?2?2?2?2 <2/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <2/4> 33 time=0.912109375 ?2?2?2?2?2?2 <2/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <2/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = 24 = ====================================== WARNING: singular projection (resolved) ====================================== = Nontrivial braiding = (24)^-1 = ====================================== # The following braid was computed by FollowMonodromy in 35 steps. monodromy[2]:=B(1,3,2,1,4,5,4,3); # segment 2/4 Time=4.7sec <3/4> 1 time= 0 ?5?5?5?5?5?5 WARNING: singular projection (resolved) <3/4> 2 time= 0.03125 ?5?5?5?5?5?5 <3/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <3/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <3/4> 5 time= 0.140625 ?5?5?5?5?5?5 ######## Lehrstuhl D fuer Mathematik ### #### RWTH Aachen ## ## ## # ####### ######### ## # ## ## # ## ## # # ## # ## #### ## ## # # ## ##### ### ## ## ## ## ######### # ######### ####### # # ## Version 3 # ### Release 4.4 # ## # 18 Apr 97 # ## # ## # Alice Niemeyer, Werner Nickel, Martin Schoenert ## # Johannes Meier, Alex Wegner, Thomas Bischops ## # Frank Celler, Juergen Mnich, Udo Polis ### ## Thomas Breuer, Goetz Pfeiffer, Hans U. Besche ###### Volkmar Felsch, Heiko Theissen, Alexander Hulpke Ansgar Kaup, Akos Seress, Erzsebet Horvath Bettina Eick For help enter: ? #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) WELCOME to the CHEVIE package, Version 4.devel (April 2004) http://www.math.rwth-aachen.de/~CHEVIE for the stable version 3.1 http://www.math.jussieu.fr/~jmichel/chevie for this version Meinolf Geck, Frank Luebeck, Gerhard Hiss, Gunter Malle, Jean Michel, Goetz Pfeiffer Lehrstuhl D fuer Mathematik, RWTH Aachen Universit'e Paris VII AG Computational Mathematics Universit"at Kassel Galway University This replaces the former weyl package. For first help type ?CHEVIE Version 4 -- a short introduction #I ReadChv( "lib/polycyc" ) #I ReadLib( "numfield" ) #I ReadLib( "abattoir" ) #I ReadLib( "field" ) #I ReadLib( "domain" ) #I ReadLib( "mapping" ) #I ReadLib( "grpelms" ) #I ReadLib( "group" ) #I ReadLib( "grphomom" ) #I ReadLib( "dispatch" ) #I ReadLib( "operatio" ) #I ReadLib( "grplatt" ) #I ReadLib( "grpcoset" ) #I ReadLib( "grpprods" ) #I ReadLib( "grpctbl" ) #I ReadLib( "monomial" ) #I ReadLib( "classfun" ) #I ReadLib( "integer" ) #I ReadLib( "ring" ) #I ReadLib( "rational" ) #I ReadLib( "polynom" ) #I ReadLib( "polyfld" ) #I ReadChv( "lib/patch" ) #I ReadLib( "matgrp" ) #I ReadLib( "matrix" ) #I ReadLib( "algebra" ) #I ReadLib( "module" ) #I ReadLib( "rowspace" ) #I ReadLib( "vecspace" ) #I ReadLib( "matgrp" ) #I ReadLib( "matring" ) #I ReadLib( "finfield" ) #I ReadChv( "lib/classinv" ) #I ReadLib( "permgrp" ) #I ReadLib( "permutat" ) #I ReadLib( "permgrp" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "aggroup" ) #I ReadLib( "agprops" ) #I ReadLib( "agsubgrp" ) #I ReadLib( "aghomomo" ) #I ReadLib( "agcoset" ) #I ReadLib( "agnorm" ) #I ReadLib( "aghall" ) #I ReadLib( "aginters" ) #I ReadLib( "agcomple" ) #I ReadLib( "agclass" ) #I ReadLib( "agcent" ) #I ReadLib( "agctbl" ) #I ReadLib( "onecohom" ) #I ReadLib( "saggroup" ) #I ReadLib( "sagsbgrp" ) #I ReadLib( "permprod" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "permprod" ) #I ReadChv( "auto" ) #I ReadChv( "tbl/compat3" ) #I ReadLib( "ctbasic" ) #I ReadChv( "prg/hecke" ) #I ReadChv( "prg/abscox" ) #I ReadChv( "prg/abshecke" ) #I ReadChv( "prg/permroot" ) #I ReadChv( "prg/heckeelt" ) #I ReadChv( "lib/util" ) #I ReadChv( "prg/kl" ) #I ReadChv( "prg/heckemod" ) #I ReadChv( "prg/complexr" ) #I ReadChv( "prg/hastype" ) #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "prg/refltype" ) #I ReadChv( "unip/families" ) #I ReadLib( "cyclotom" ) #I ReadLib( "string" ) #I ReadChv( "tbl/cmplximp" ) #I ReadChv( "prg/coxeter" ) #I ReadChv( "unip/lusztig" ) #I ReadChv( "prg/wclsinv" ) #I ReadChv( "prg/dispatch" ) #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) done #I ReadChv( "work/init" ) #I ReadChv( "work/init" ) done #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "unip/init" ) done #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) #I ReadVK( "patch" ) #I ReadLib( "polyrat" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpgrp" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpsgpres" ) #I ReadVK( "pres" ) Welcome to the VKCURVE package, Version 1.2 (16-10-2003) http://www.math.jussieu.fr/~jmichel/vkcurve.html David Bessis, Jean Michel CNRS -- Universities Lyon I, Paris VII and Picardie #I ReadVK( "mvp" ) #I ReadVK( "mvrf" ) #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) done gap> #I ReadVK( "global" ) #I ReadVK( "global" ) done #I ReadChv( "lib/complex" ) #I ReadChv( "lib/complex" ) done #I ReadVK( "util" ) #I ReadVK( "util" ) done Discriminant has 35 roots, of which 1 are distinct #I ReadLib( "gaussian" ) #I ReadLib( "gaussian" ) done Computing roots of discriminant... #I ReadVK( "polyroot" ) #I ReadVK( "polyroot" ) done #I ReadVK( "loops" ) #I ReadVK( "loops" ) done # There are 4 segments in 1 loops #I ReadChv( "lib/decimal" ) #I ReadChv( "lib/decimal" ) done Computing zeros of curve at the 4 segment extremities... <1/4>11.12.7.10.8.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] <2/4>21.12.11.8.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 1, 5 ] ] <3/4>7.14.12.15.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 2, 3 ] ] <4/4>6.14.13.10.10.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] #I ReadChv( "prg/garside" ) #I ReadChv( "prg/garside" ) done #I ReadChv( "prg/gencox" ) #I ReadChv( "prg/gencox" ) done #I ReadGrp( "basic" ) #I ReadGrp( "basic" ) done #I ReadGrp( "permgrp" ) #I ReadGrp( "permgrp" ) done #I ReadChv( "tbl/weyla" ) #I ReadLib( "ctsymmet" ) #I ReadLib( "combinat" ) #I ReadChv( "tbl/weyla" ) done #I ReadVK( "truemono" ) #I ReadVK( "truemono" ) done Initializing monodromy data <1/4> 1 time= 0 ?5?5?5?5?5?5 #I ReadVK( "plbraid" ) #I ReadVK( "plbraid" ) done <1/4> 2 time= 0.03125 ?5?5?5?5?5?5 <1/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <1/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <1/4> 5 time= 0.140625 ?5?5?5?5?5?5 <1/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 7 time= 0.203125 ?5?5?5?5?5?5 <1/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <1/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <1/4> 10 time=0.283203125 ?5?5?5?5?5?5 <1/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <1/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <1/4> 13 time=0.365234375 ?5?5?5?5?5?5 <1/4> 14 time=0.384765625 ?5?5?5?5?5?5 <1/4> 15 time=0.412109375 ?5?5?5?5?5?5 <1/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <1/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <1/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <1/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <1/4> 20 time=0.541015625 ?4?4?4?4?4?4 <1/4> 21 time=0.568359375 ?4?4?4?4?4?4 <1/4> 22 time= 0.59375 ?4?4?4?4?4?4 <1/4> 23 time=0.619140625 ?4?4?4?4?4?4 <1/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <1/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <1/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <1/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <1/4> 29 time=0.783203125 ?3?3?3?3?3?3 <1/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <1/4> 31 time= 0.84375 ?2?2?2?2?2?2 <1/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <1/4> 33 time=0.912109375 ?2?2?2?2?2?2 <1/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <1/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== WARNING: singular projection (resolved) # The following braid was computed by FollowMonodromy in 35 steps. monodromy[1]:=B(-2,-3,-4,-5,-3,-4,-1,-2,-3,-1); # segment 1/4 Time=4.7sec <2/4> 1 time= 0 ?5?5?5?5?5?5 <2/4> 2 time= 0.03125 ?5?5?5?5?5?5 <2/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <2/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <2/4> 5 time= 0.140625 ?5?5?5?5?5?5 <2/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 7 time= 0.203125 ?5?5?5?5?5?5 <2/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <2/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <2/4> 10 time=0.283203125 ?5?5?5?5?5?5 <2/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <2/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <2/4> 13 time=0.365234375 ?5?5?5?5?5?5 <2/4> 14 time=0.384765625 ?5?5?5?5?5?5 <2/4> 15 time=0.412109375 ?5?5?5?5?5?5 <2/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 24 = ====================================== <2/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <2/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <2/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <2/4> 20 time=0.541015625 ?4?4?4?4?4?4 <2/4> 21 time=0.568359375 ?4?4?4?4?4?4 <2/4> 22 time= 0.59375 ?4?4?4?4?4?4 <2/4> 23 time=0.619140625 ?4?4?4?4?4?4 <2/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <2/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <2/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <2/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <2/4> 29 time=0.783203125 ?3?3?3?3?3?3 <2/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <2/4> 31 time= 0.84375 ?2?2?2?2?2?2 <2/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <2/4> 33 time=0.912109375 ?2?2?2?2?2?2 <2/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <2/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = 24 = ====================================== WARNING: singular projection (resolved) ====================================== = Nontrivial braiding = (24)^-1 = ====================================== # The following braid was computed by FollowMonodromy in 35 steps. monodromy[2]:=B(1,3,2,1,4,5,4,3); # segment 2/4 Time=4.7sec <3/4> 1 time= 0 ?5?5?5?5?5?5 WARNING: singular projection (resolved) <3/4> 2 time= 0.03125 ?5?5?5?5?5?5 <3/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <3/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <3/4> 5 time= 0.140625 ?5?5?5?5?5?5 <3/4> 6 time=0.166015625 ?5?5?5?5?5?5 <3/4> 7 time= 0.203125 ?5?5?5?5?5?5 <3/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <3/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <3/4> 10 time=0.283203125 ?5?5?5?5?5?5 <3/4> 11 time= 0.31640625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <3/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <3/4> 13 time=0.365234375 ?5?5?5?5?5?5 <3/4> 14 time=0.384765625 ?5?5?5?5?5?5 <3/4> 15 time=0.412109375 ?5?5?5?5?5?5 <3/4> 16 time= 0.4296875 ?5?5?5?5?5?5 <3/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <3/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <3/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <3/4> 20 time=0.541015625 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <3/4> 21 time=0.568359375 ?4?4?4?4?4?4 <3/4> 22 time= 0.59375 ?4?4?4?4?4?4 <3/4> 23 time=0.619140625 ?4?4?4?4?4?4 <3/4> 24 time=0.642578125 ?4?4?4?4?4?4 <3/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <3/4> 26 time= 0.6953125 ?4?4?4?4?4?4 ######## Lehrstuhl D fuer Mathematik ### #### RWTH Aachen ## ## ## # ####### ######### ## # ## ## # ## ## # # ## # ## #### ## ## # # ## ##### ### ## ## ## ## ######### # ######### ####### # # ## Version 3 # ### Release 4.4 # ## # 18 Apr 97 # ## # ## # Alice Niemeyer, Werner Nickel, Martin Schoenert ## # Johannes Meier, Alex Wegner, Thomas Bischops ## # Frank Celler, Juergen Mnich, Udo Polis ### ## Thomas Breuer, Goetz Pfeiffer, Hans U. Besche ###### Volkmar Felsch, Heiko Theissen, Alexander Hulpke Ansgar Kaup, Akos Seress, Erzsebet Horvath Bettina Eick For help enter: ? #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) WELCOME to the CHEVIE package, Version 4.devel (April 2004) http://www.math.rwth-aachen.de/~CHEVIE for the stable version 3.1 http://www.math.jussieu.fr/~jmichel/chevie for this version Meinolf Geck, Frank Luebeck, Gerhard Hiss, Gunter Malle, Jean Michel, Goetz Pfeiffer Lehrstuhl D fuer Mathematik, RWTH Aachen Universit'e Paris VII AG Computational Mathematics Universit"at Kassel Galway University This replaces the former weyl package. For first help type ?CHEVIE Version 4 -- a short introduction #I ReadChv( "lib/polycyc" ) #I ReadLib( "numfield" ) #I ReadLib( "abattoir" ) #I ReadLib( "field" ) #I ReadLib( "domain" ) #I ReadLib( "mapping" ) #I ReadLib( "grpelms" ) #I ReadLib( "group" ) #I ReadLib( "grphomom" ) #I ReadLib( "dispatch" ) #I ReadLib( "operatio" ) #I ReadLib( "grplatt" ) #I ReadLib( "grpcoset" ) #I ReadLib( "grpprods" ) #I ReadLib( "grpctbl" ) #I ReadLib( "monomial" ) #I ReadLib( "classfun" ) #I ReadLib( "integer" ) #I ReadLib( "ring" ) #I ReadLib( "rational" ) #I ReadLib( "polynom" ) #I ReadLib( "polyfld" ) #I ReadChv( "lib/patch" ) #I ReadLib( "matgrp" ) #I ReadLib( "matrix" ) #I ReadLib( "algebra" ) #I ReadLib( "module" ) #I ReadLib( "rowspace" ) #I ReadLib( "vecspace" ) #I ReadLib( "matgrp" ) #I ReadLib( "matring" ) #I ReadLib( "finfield" ) #I ReadChv( "lib/classinv" ) #I ReadLib( "permgrp" ) #I ReadLib( "permutat" ) #I ReadLib( "permgrp" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "aggroup" ) #I ReadLib( "agprops" ) #I ReadLib( "agsubgrp" ) #I ReadLib( "aghomomo" ) #I ReadLib( "agcoset" ) #I ReadLib( "agnorm" ) #I ReadLib( "aghall" ) #I ReadLib( "aginters" ) #I ReadLib( "agcomple" ) #I ReadLib( "agclass" ) #I ReadLib( "agcent" ) #I ReadLib( "agctbl" ) #I ReadLib( "onecohom" ) #I ReadLib( "saggroup" ) #I ReadLib( "sagsbgrp" ) #I ReadLib( "permprod" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "permprod" ) #I ReadChv( "auto" ) #I ReadChv( "tbl/compat3" ) #I ReadLib( "ctbasic" ) #I ReadChv( "prg/hecke" ) #I ReadChv( "prg/abscox" ) #I ReadChv( "prg/abshecke" ) #I ReadChv( "prg/permroot" ) #I ReadChv( "prg/heckeelt" ) #I ReadChv( "lib/util" ) #I ReadChv( "prg/kl" ) #I ReadChv( "prg/heckemod" ) #I ReadChv( "prg/complexr" ) #I ReadChv( "prg/hastype" ) #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "prg/refltype" ) #I ReadChv( "unip/families" ) #I ReadLib( "cyclotom" ) #I ReadLib( "string" ) #I ReadChv( "tbl/cmplximp" ) #I ReadChv( "prg/coxeter" ) #I ReadChv( "unip/lusztig" ) #I ReadChv( "prg/wclsinv" ) #I ReadChv( "prg/dispatch" ) #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) done #I ReadChv( "work/init" ) #I ReadChv( "work/init" ) done #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "unip/init" ) done #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) #I ReadVK( "patch" ) #I ReadLib( "polyrat" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpgrp" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpsgpres" ) #I ReadVK( "pres" ) Welcome to the VKCURVE package, Version 1.2 (16-10-2003) http://www.math.jussieu.fr/~jmichel/vkcurve.html David Bessis, Jean Michel CNRS -- Universities Lyon I, Paris VII and Picardie #I ReadVK( "mvp" ) #I ReadVK( "mvrf" ) #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) done gap> #I ReadVK( "global" ) #I ReadVK( "global" ) done #I ReadChv( "lib/complex" ) #I ReadChv( "lib/complex" ) done #I ReadVK( "util" ) #I ReadVK( "util" ) done Discriminant has 35 roots, of which 1 are distinct #I ReadLib( "gaussian" ) #I ReadLib( "gaussian" ) done Computing roots of discriminant... #I ReadVK( "polyroot" ) #I ReadVK( "polyroot" ) done #I ReadVK( "loops" ) #I ReadVK( "loops" ) done # There are 4 segments in 1 loops #I ReadChv( "lib/decimal" ) #I ReadChv( "lib/decimal" ) done Computing zeros of curve at the 4 segment extremities... <1/4>11.12.7.10.8.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] <2/4>21.12.11.8.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 1, 5 ] ] <3/4>7.14.12.15.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 2, 3 ] ] <4/4>6.14.13.10.10.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] #I ReadChv( "prg/garside" ) #I ReadChv( "prg/garside" ) done #I ReadChv( "prg/gencox" ) #I ReadChv( "prg/gencox" ) done #I ReadGrp( "basic" ) #I ReadGrp( "basic" ) done #I ReadGrp( "permgrp" ) #I ReadGrp( "permgrp" ) done #I ReadChv( "tbl/weyla" ) #I ReadLib( "ctsymmet" ) #I ReadLib( "combinat" ) #I ReadChv( "tbl/weyla" ) done #I ReadVK( "truemono" ) #I ReadVK( "truemono" ) done Initializing monodromy data <1/4> 1 time= 0 ?5?5?5?5?5?5 #I ReadVK( "plbraid" ) #I ReadVK( "plbraid" ) done <1/4> 2 time= 0.03125 ?5?5?5?5?5?5 <1/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <1/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <1/4> 5 time= 0.140625 ?5?5?5?5?5?5 <1/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 7 time= 0.203125 ?5?5?5?5?5?5 <1/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <1/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <1/4> 10 time=0.283203125 ?5?5?5?5?5?5 <1/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <1/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <1/4> 13 time=0.365234375 ?5?5?5?5?5?5 <1/4> 14 time=0.384765625 ?5?5?5?5?5?5 <1/4> 15 time=0.412109375 ?5?5?5?5?5?5 <1/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <1/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <1/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <1/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <1/4> 20 time=0.541015625 ?4?4?4?4?4?4 <1/4> 21 time=0.568359375 ?4?4?4?4?4?4 <1/4> 22 time= 0.59375 ?4?4?4?4?4?4 <1/4> 23 time=0.619140625 ?4?4?4?4?4?4 <1/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <1/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <1/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <1/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <1/4> 29 time=0.783203125 ?3?3?3?3?3?3 <1/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <1/4> 31 time= 0.84375 ?2?2?2?2?2?2 <1/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <1/4> 33 time=0.912109375 ?2?2?2?2?2?2 <1/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <1/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== WARNING: singular projection (resolved) # The following braid was computed by FollowMonodromy in 35 steps. monodromy[1]:=B(-2,-3,-4,-5,-3,-4,-1,-2,-3,-1); # segment 1/4 Time=4.7sec <2/4> 1 time= 0 ?5?5?5?5?5?5 <2/4> 2 time= 0.03125 ?5?5?5?5?5?5 <2/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <2/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <2/4> 5 time= 0.140625 ?5?5?5?5?5?5 <2/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 7 time= 0.203125 ?5?5?5?5?5?5 <2/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <2/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <2/4> 10 time=0.283203125 ?5?5?5?5?5?5 <2/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <2/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <2/4> 13 time=0.365234375 ?5?5?5?5?5?5 <2/4> 14 time=0.384765625 ?5?5?5?5?5?5 <2/4> 15 time=0.412109375 ?5?5?5?5?5?5 <2/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 24 = ====================================== <2/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <2/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <2/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <2/4> 20 time=0.541015625 ?4?4?4?4?4?4 <2/4> 21 time=0.568359375 ?4?4?4?4?4?4 <2/4> 22 time= 0.59375 ?4?4?4?4?4?4 <2/4> 23 time=0.619140625 ?4?4?4?4?4?4 <2/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <2/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <2/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <2/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <2/4> 29 time=0.783203125 ?3?3?3?3?3?3 <2/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <2/4> 31 time= 0.84375 ?2?2?2?2?2?2 <2/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <2/4> 33 time=0.912109375 ?2?2?2?2?2?2 <2/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <2/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = 24 = ====================================== WARNING: singular projection (resolved) ====================================== = Nontrivial braiding = (24)^-1 = ====================================== # The following braid was computed by FollowMonodromy in 35 steps. monodromy[2]:=B(1,3,2,1,4,5,4,3); # segment 2/4 Time=4.7sec <3/4> 1 time= 0 ?5?5?5?5?5?5 WARNING: singular projection (resolved) <3/4> 2 time= 0.03125 ?5?5?5?5?5?5 <3/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <3/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <3/4> 5 time= 0.140625 ?5?5?5?5?5?5 <3/4> 6 time=0.166015625 ?5?5?5?5?5?5 <3/4> 7 time= 0.203125 ?5?5?5?5?5?5 <3/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <3/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <3/4> 10 time=0.283203125 ?5?5?5?5?5?5 <3/4> 11 time= 0.31640625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <3/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <3/4> 13 time=0.365234375 ?5?5?5?5?5?5 <3/4> 14 time=0.384765625 ?5?5?5?5?5?5 <3/4> 15 time=0.412109375 ?5?5?5?5?5?5 <3/4> 16 time= 0.4296875 ?5?5?5?5?5?5 <3/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <3/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <3/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <3/4> 20 time=0.541015625 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <3/4> 21 time=0.568359375 ?4?4?4?4?4?4 <3/4> 22 time= 0.59375 ?4?4?4?4?4?4 <3/4> 23 time=0.619140625 ?4?4?4?4?4?4 <3/4> 24 time=0.642578125 ?4?4?4?4?4?4 <3/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <3/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <3/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <3/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <3/4> 29 time=0.783203125 ?3?3?3?3?3?3 <3/4> 30 time= 0.80859375 ?3?3?3?3?3?3 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <3/4> 31 time= 0.84375 ?2?2?2?2?2?2 <3/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <3/4> 33 time=0.912109375 ?2?2?2?2?2?2 <3/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <3/4> 35 time= 0.984375 ?0?0?0?0?0?0 # The following braid was computed by FollowMonodromy in 35 steps. monodromy[3]:=B(-4,-5,-2,-3,-4,-1,-2); # segment 3/4 Time=4.7sec <4/4> 1 time= 0 ?5?5?5?5?5?5 WARNING: singular projection (resolved) ====================================== = Nontrivial braiding = 24 = ====================================== <4/4> 2 time= 0.03125 ?5?5?5?5?5?5 <4/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <4/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <4/4> 5 time= 0.140625 ?5?5?5?5?5?5 <4/4> 6 time=0.166015625 ?5?5?5?5?5?5 <4/4> 7 time= 0.203125 ?5?5?5?5?5?5 <4/4> 8 time= 0.2265625 ?5?5?5?5?5?5 ######## Lehrstuhl D fuer Mathematik ### #### RWTH Aachen ## ## ## # ####### ######### ## # ## ## # ## ## # # ## # ## #### ## ## # # ## ##### ### ## ## ## ## ######### # ######### ####### # # ## Version 3 # ### Release 4.4 # ## # 18 Apr 97 # ## # ## # Alice Niemeyer, Werner Nickel, Martin Schoenert ## # Johannes Meier, Alex Wegner, Thomas Bischops ## # Frank Celler, Juergen Mnich, Udo Polis ### ## Thomas Breuer, Goetz Pfeiffer, Hans U. Besche ###### Volkmar Felsch, Heiko Theissen, Alexander Hulpke Ansgar Kaup, Akos Seress, Erzsebet Horvath Bettina Eick For help enter: ? #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) WELCOME to the CHEVIE package, Version 4.devel (April 2004) http://www.math.rwth-aachen.de/~CHEVIE for the stable version 3.1 http://www.math.jussieu.fr/~jmichel/chevie for this version Meinolf Geck, Frank Luebeck, Gerhard Hiss, Gunter Malle, Jean Michel, Goetz Pfeiffer Lehrstuhl D fuer Mathematik, RWTH Aachen Universit'e Paris VII AG Computational Mathematics Universit"at Kassel Galway University This replaces the former weyl package. For first help type ?CHEVIE Version 4 -- a short introduction #I ReadChv( "lib/polycyc" ) #I ReadLib( "numfield" ) #I ReadLib( "abattoir" ) #I ReadLib( "field" ) #I ReadLib( "domain" ) #I ReadLib( "mapping" ) #I ReadLib( "grpelms" ) #I ReadLib( "group" ) #I ReadLib( "grphomom" ) #I ReadLib( "dispatch" ) #I ReadLib( "operatio" ) #I ReadLib( "grplatt" ) #I ReadLib( "grpcoset" ) #I ReadLib( "grpprods" ) #I ReadLib( "grpctbl" ) #I ReadLib( "monomial" ) #I ReadLib( "classfun" ) #I ReadLib( "integer" ) #I ReadLib( "ring" ) #I ReadLib( "rational" ) #I ReadLib( "polynom" ) #I ReadLib( "polyfld" ) #I ReadChv( "lib/patch" ) #I ReadLib( "matgrp" ) #I ReadLib( "matrix" ) #I ReadLib( "algebra" ) #I ReadLib( "module" ) #I ReadLib( "rowspace" ) #I ReadLib( "vecspace" ) #I ReadLib( "matgrp" ) #I ReadLib( "matring" ) #I ReadLib( "finfield" ) #I ReadChv( "lib/classinv" ) #I ReadLib( "permgrp" ) #I ReadLib( "permutat" ) #I ReadLib( "permgrp" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "aggroup" ) #I ReadLib( "agprops" ) #I ReadLib( "agsubgrp" ) #I ReadLib( "aghomomo" ) #I ReadLib( "agcoset" ) #I ReadLib( "agnorm" ) #I ReadLib( "aghall" ) #I ReadLib( "aginters" ) #I ReadLib( "agcomple" ) #I ReadLib( "agclass" ) #I ReadLib( "agcent" ) #I ReadLib( "agctbl" ) #I ReadLib( "onecohom" ) #I ReadLib( "saggroup" ) #I ReadLib( "sagsbgrp" ) #I ReadLib( "permprod" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "permprod" ) #I ReadChv( "auto" ) #I ReadChv( "tbl/compat3" ) #I ReadLib( "ctbasic" ) #I ReadChv( "prg/hecke" ) #I ReadChv( "prg/abscox" ) #I ReadChv( "prg/abshecke" ) #I ReadChv( "prg/permroot" ) #I ReadChv( "prg/heckeelt" ) #I ReadChv( "lib/util" ) #I ReadChv( "prg/kl" ) #I ReadChv( "prg/heckemod" ) #I ReadChv( "prg/complexr" ) #I ReadChv( "prg/hastype" ) #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "prg/refltype" ) #I ReadChv( "unip/families" ) #I ReadLib( "cyclotom" ) #I ReadLib( "string" ) #I ReadChv( "tbl/cmplximp" ) #I ReadChv( "prg/coxeter" ) #I ReadChv( "unip/lusztig" ) #I ReadChv( "prg/wclsinv" ) #I ReadChv( "prg/dispatch" ) #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) done #I ReadChv( "work/init" ) #I ReadChv( "work/init" ) done #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "unip/init" ) done #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) #I ReadVK( "patch" ) #I ReadLib( "polyrat" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpgrp" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpsgpres" ) #I ReadVK( "pres" ) Welcome to the VKCURVE package, Version 1.2 (16-10-2003) http://www.math.jussieu.fr/~jmichel/vkcurve.html David Bessis, Jean Michel CNRS -- Universities Lyon I, Paris VII and Picardie #I ReadVK( "mvp" ) #I ReadVK( "mvrf" ) #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) done gap> #I ReadVK( "global" ) #I ReadVK( "global" ) done #I ReadChv( "lib/complex" ) #I ReadChv( "lib/complex" ) done #I ReadVK( "util" ) #I ReadVK( "util" ) done Discriminant has 35 roots, of which 1 are distinct #I ReadLib( "gaussian" ) #I ReadLib( "gaussian" ) done Computing roots of discriminant... #I ReadVK( "polyroot" ) #I ReadVK( "polyroot" ) done #I ReadVK( "loops" ) #I ReadVK( "loops" ) done # There are 4 segments in 1 loops #I ReadChv( "lib/decimal" ) #I ReadChv( "lib/decimal" ) done Computing zeros of curve at the 4 segment extremities... <1/4>11.12.7.10.8.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] <2/4>21.12.11.8.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 1, 5 ] ] <3/4>7.14.12.15.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 2, 3 ] ] <4/4>6.14.13.10.10.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] #I ReadChv( "prg/garside" ) #I ReadChv( "prg/garside" ) done #I ReadChv( "prg/gencox" ) #I ReadChv( "prg/gencox" ) done #I ReadGrp( "basic" ) #I ReadGrp( "basic" ) done #I ReadGrp( "permgrp" ) #I ReadGrp( "permgrp" ) done #I ReadChv( "tbl/weyla" ) #I ReadLib( "ctsymmet" ) #I ReadLib( "combinat" ) #I ReadChv( "tbl/weyla" ) done #I ReadVK( "truemono" ) #I ReadVK( "truemono" ) done Initializing monodromy data <1/4> 1 time= 0 ?5?5?5?5?5?5 #I ReadVK( "plbraid" ) #I ReadVK( "plbraid" ) done <1/4> 2 time= 0.03125 ?5?5?5?5?5?5 <1/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <1/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <1/4> 5 time= 0.140625 ?5?5?5?5?5?5 <1/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 7 time= 0.203125 ?5?5?5?5?5?5 <1/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <1/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <1/4> 10 time=0.283203125 ?5?5?5?5?5?5 <1/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <1/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <1/4> 13 time=0.365234375 ?5?5?5?5?5?5 <1/4> 14 time=0.384765625 ?5?5?5?5?5?5 <1/4> 15 time=0.412109375 ?5?5?5?5?5?5 <1/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <1/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <1/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <1/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <1/4> 20 time=0.541015625 ?4?4?4?4?4?4 <1/4> 21 time=0.568359375 ?4?4?4?4?4?4 <1/4> 22 time= 0.59375 ?4?4?4?4?4?4 <1/4> 23 time=0.619140625 ?4?4?4?4?4?4 <1/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <1/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <1/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <1/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <1/4> 29 time=0.783203125 ?3?3?3?3?3?3 <1/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <1/4> 31 time= 0.84375 ?2?2?2?2?2?2 <1/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <1/4> 33 time=0.912109375 ?2?2?2?2?2?2 <1/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <1/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== WARNING: singular projection (resolved) # The following braid was computed by FollowMonodromy in 35 steps. monodromy[1]:=B(-2,-3,-4,-5,-3,-4,-1,-2,-3,-1); # segment 1/4 Time=4.7sec <2/4> 1 time= 0 ?5?5?5?5?5?5 <2/4> 2 time= 0.03125 ?5?5?5?5?5?5 <2/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <2/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <2/4> 5 time= 0.140625 ?5?5?5?5?5?5 <2/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 7 time= 0.203125 ?5?5?5?5?5?5 <2/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <2/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <2/4> 10 time=0.283203125 ?5?5?5?5?5?5 <2/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <2/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <2/4> 13 time=0.365234375 ?5?5?5?5?5?5 <2/4> 14 time=0.384765625 ?5?5?5?5?5?5 <2/4> 15 time=0.412109375 ?5?5?5?5?5?5 <2/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 24 = ====================================== <2/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <2/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <2/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <2/4> 20 time=0.541015625 ?4?4?4?4?4?4 <2/4> 21 time=0.568359375 ?4?4?4?4?4?4 <2/4> 22 time= 0.59375 ?4?4?4?4?4?4 <2/4> 23 time=0.619140625 ?4?4?4?4?4?4 <2/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <2/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <2/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <2/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <2/4> 29 time=0.783203125 ?3?3?3?3?3?3 <2/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <2/4> 31 time= 0.84375 ?2?2?2?2?2?2 <2/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <2/4> 33 time=0.912109375 ?2?2?2?2?2?2 <2/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <2/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = 24 = ====================================== WARNING: singular projection (resolved) ====================================== = Nontrivial braiding = (24)^-1 = ====================================== # The following braid was computed by FollowMonodromy in 35 steps. monodromy[2]:=B(1,3,2,1,4,5,4,3); # segment 2/4 Time=4.7sec <3/4> 1 time= 0 ?5?5?5?5?5?5 WARNING: singular projection (resolved) <3/4> 2 time= 0.03125 ?5?5?5?5?5?5 <3/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <3/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <3/4> 5 time= 0.140625 ?5?5?5?5?5?5 <3/4> 6 time=0.166015625 ?5?5?5?5?5?5 <3/4> 7 time= 0.203125 ?5?5?5?5?5?5 <3/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <3/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <3/4> 10 time=0.283203125 ?5?5?5?5?5?5 <3/4> 11 time= 0.31640625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <3/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <3/4> 13 time=0.365234375 ?5?5?5?5?5?5 <3/4> 14 time=0.384765625 ?5?5?5?5?5?5 <3/4> 15 time=0.412109375 ?5?5?5?5?5?5 <3/4> 16 time= 0.4296875 ?5?5?5?5?5?5 <3/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <3/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <3/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <3/4> 20 time=0.541015625 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <3/4> 21 time=0.568359375 ?4?4?4?4?4?4 <3/4> 22 time= 0.59375 ?4?4?4?4?4?4 <3/4> 23 time=0.619140625 ?4?4?4?4?4?4 <3/4> 24 time=0.642578125 ?4?4?4?4?4?4 <3/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <3/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <3/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <3/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <3/4> 29 time=0.783203125 ?3?3?3?3?3?3 <3/4> 30 time= 0.80859375 ?3?3?3?3?3?3 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <3/4> 31 time= 0.84375 ?2?2?2?2?2?2 <3/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <3/4> 33 time=0.912109375 ?2?2?2?2?2?2 <3/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <3/4> 35 time= 0.984375 ?0?0?0?0?0?0 # The following braid was computed by FollowMonodromy in 35 steps. monodromy[3]:=B(-4,-5,-2,-3,-4,-1,-2); # segment 3/4 Time=4.7sec <4/4> 1 time= 0 ?5?5?5?5?5?5 WARNING: singular projection (resolved) ====================================== = Nontrivial braiding = 24 = ====================================== <4/4> 2 time= 0.03125 ?5?5?5?5?5?5 <4/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <4/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <4/4> 5 time= 0.140625 ?5?5?5?5?5?5 <4/4> 6 time=0.166015625 ?5?5?5?5?5?5 <4/4> 7 time= 0.203125 ?5?5?5?5?5?5 <4/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <4/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <4/4> 10 time=0.283203125 ?5?5?5?5?5?5 <4/4> 11 time= 0.31640625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 135 = ====================================== <4/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <4/4> 13 time=0.365234375 ?5?5?5?5?5?5 <4/4> 14 time=0.384765625 ?5?5?5?5?5?5 <4/4> 15 time=0.412109375 ?5?5?5?5?5?5 <4/4> 16 time= 0.4296875 ?5?5?5?5?5?5 <4/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <4/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <4/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <4/4> 20 time=0.541015625 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = 24 = ====================================== <4/4> 21 time=0.568359375 ?4?4?4?4?4?4 <4/4> 22 time= 0.59375 ?4?4?4?4?4?4 <4/4> 23 time=0.619140625 ?4?4?4?4?4?4 <4/4> 24 time=0.642578125 ?4?4?4?4?4?4 <4/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <4/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <4/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <4/4> 28 time= 0.75390625 ?3?3?3?3?3?3 ######## Lehrstuhl D fuer Mathematik ### #### RWTH Aachen ## ## ## # ####### ######### ## # ## ## # ## ## # # ## # ## #### ## ## # # ## ##### ### ## ## ## ## ######### # ######### ####### # # ## Version 3 # ### Release 4.4 # ## # 18 Apr 97 # ## # ## # Alice Niemeyer, Werner Nickel, Martin Schoenert ## # Johannes Meier, Alex Wegner, Thomas Bischops ## # Frank Celler, Juergen Mnich, Udo Polis ### ## Thomas Breuer, Goetz Pfeiffer, Hans U. Besche ###### Volkmar Felsch, Heiko Theissen, Alexander Hulpke Ansgar Kaup, Akos Seress, Erzsebet Horvath Bettina Eick For help enter: ? #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) WELCOME to the CHEVIE package, Version 4.devel (April 2004) http://www.math.rwth-aachen.de/~CHEVIE for the stable version 3.1 http://www.math.jussieu.fr/~jmichel/chevie for this version Meinolf Geck, Frank Luebeck, Gerhard Hiss, Gunter Malle, Jean Michel, Goetz Pfeiffer Lehrstuhl D fuer Mathematik, RWTH Aachen Universit'e Paris VII AG Computational Mathematics Universit"at Kassel Galway University This replaces the former weyl package. For first help type ?CHEVIE Version 4 -- a short introduction #I ReadChv( "lib/polycyc" ) #I ReadLib( "numfield" ) #I ReadLib( "abattoir" ) #I ReadLib( "field" ) #I ReadLib( "domain" ) #I ReadLib( "mapping" ) #I ReadLib( "grpelms" ) #I ReadLib( "group" ) #I ReadLib( "grphomom" ) #I ReadLib( "dispatch" ) #I ReadLib( "operatio" ) #I ReadLib( "grplatt" ) #I ReadLib( "grpcoset" ) #I ReadLib( "grpprods" ) #I ReadLib( "grpctbl" ) #I ReadLib( "monomial" ) #I ReadLib( "classfun" ) #I ReadLib( "integer" ) #I ReadLib( "ring" ) #I ReadLib( "rational" ) #I ReadLib( "polynom" ) #I ReadLib( "polyfld" ) #I ReadChv( "lib/patch" ) #I ReadLib( "matgrp" ) #I ReadLib( "matrix" ) #I ReadLib( "algebra" ) #I ReadLib( "module" ) #I ReadLib( "rowspace" ) #I ReadLib( "vecspace" ) #I ReadLib( "matgrp" ) #I ReadLib( "matring" ) #I ReadLib( "finfield" ) #I ReadChv( "lib/classinv" ) #I ReadLib( "permgrp" ) #I ReadLib( "permutat" ) #I ReadLib( "permgrp" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "aggroup" ) #I ReadLib( "agprops" ) #I ReadLib( "agsubgrp" ) #I ReadLib( "aghomomo" ) #I ReadLib( "agcoset" ) #I ReadLib( "agnorm" ) #I ReadLib( "aghall" ) #I ReadLib( "aginters" ) #I ReadLib( "agcomple" ) #I ReadLib( "agclass" ) #I ReadLib( "agcent" ) #I ReadLib( "agctbl" ) #I ReadLib( "onecohom" ) #I ReadLib( "saggroup" ) #I ReadLib( "sagsbgrp" ) #I ReadLib( "permprod" ) #I ReadLib( "permstbc" ) #I ReadLib( "permoper" ) #I ReadLib( "permbckt" ) #I ReadLib( "permnorm" ) #I ReadLib( "permcose" ) #I ReadLib( "permhomo" ) #I ReadLib( "permcser" ) #I ReadLib( "permag" ) #I ReadLib( "permctbl" ) #I ReadLib( "ratclass" ) #I ReadLib( "permprod" ) #I ReadChv( "auto" ) #I ReadChv( "tbl/compat3" ) #I ReadLib( "ctbasic" ) #I ReadChv( "prg/hecke" ) #I ReadChv( "prg/abscox" ) #I ReadChv( "prg/abshecke" ) #I ReadChv( "prg/permroot" ) #I ReadChv( "prg/heckeelt" ) #I ReadChv( "lib/util" ) #I ReadChv( "prg/kl" ) #I ReadChv( "prg/heckemod" ) #I ReadChv( "prg/complexr" ) #I ReadChv( "prg/hastype" ) #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "prg/refltype" ) #I ReadChv( "unip/families" ) #I ReadLib( "cyclotom" ) #I ReadLib( "string" ) #I ReadChv( "tbl/cmplximp" ) #I ReadChv( "prg/coxeter" ) #I ReadChv( "unip/lusztig" ) #I ReadChv( "prg/wclsinv" ) #I ReadChv( "prg/dispatch" ) #I Read( "/share/nfs/users/imj-gf/jmichel/chevie/init.g" ) done #I ReadChv( "work/init" ) #I ReadChv( "work/init" ) done #I ReadChv( "unip/init" ) #I ReadChv( "unip/uc" ) #I ReadChv( "unip/init" ) done #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) #I ReadVK( "patch" ) #I ReadLib( "polyrat" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpgrp" ) #I ReadLib( "fptietze" ) #I ReadLib( "fpsgpres" ) #I ReadVK( "pres" ) Welcome to the VKCURVE package, Version 1.2 (16-10-2003) http://www.math.jussieu.fr/~jmichel/vkcurve.html David Bessis, Jean Michel CNRS -- Universities Lyon I, Paris VII and Picardie #I ReadVK( "mvp" ) #I ReadVK( "mvrf" ) #I Read( "/share/nfs/users/imj-gf/jmichel/vkcurve/init.g" ) done gap> #I ReadVK( "global" ) #I ReadVK( "global" ) done #I ReadChv( "lib/complex" ) #I ReadChv( "lib/complex" ) done #I ReadVK( "util" ) #I ReadVK( "util" ) done Discriminant has 35 roots, of which 1 are distinct #I ReadLib( "gaussian" ) #I ReadLib( "gaussian" ) done Computing roots of discriminant... #I ReadVK( "polyroot" ) #I ReadVK( "polyroot" ) done #I ReadVK( "loops" ) #I ReadVK( "loops" ) done # There are 4 segments in 1 loops #I ReadChv( "lib/decimal" ) #I ReadChv( "lib/decimal" ) done Computing zeros of curve at the 4 segment extremities... <1/4>11.12.7.10.8.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] <2/4>21.12.11.8.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 1, 5 ] ] <3/4>7.14.12.15.7.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1, [ 2, 3 ] ] <4/4>6.14.13.10.10.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1. d=[ 1.225, [ 1, 3 ] ] #I ReadChv( "prg/garside" ) #I ReadChv( "prg/garside" ) done #I ReadChv( "prg/gencox" ) #I ReadChv( "prg/gencox" ) done #I ReadGrp( "basic" ) #I ReadGrp( "basic" ) done #I ReadGrp( "permgrp" ) #I ReadGrp( "permgrp" ) done #I ReadChv( "tbl/weyla" ) #I ReadLib( "ctsymmet" ) #I ReadLib( "combinat" ) #I ReadChv( "tbl/weyla" ) done #I ReadVK( "truemono" ) #I ReadVK( "truemono" ) done Initializing monodromy data <1/4> 1 time= 0 ?5?5?5?5?5?5 #I ReadVK( "plbraid" ) #I ReadVK( "plbraid" ) done <1/4> 2 time= 0.03125 ?5?5?5?5?5?5 <1/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <1/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <1/4> 5 time= 0.140625 ?5?5?5?5?5?5 <1/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 7 time= 0.203125 ?5?5?5?5?5?5 <1/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <1/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <1/4> 10 time=0.283203125 ?5?5?5?5?5?5 <1/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <1/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <1/4> 13 time=0.365234375 ?5?5?5?5?5?5 <1/4> 14 time=0.384765625 ?5?5?5?5?5?5 <1/4> 15 time=0.412109375 ?5?5?5?5?5?5 <1/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <1/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <1/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <1/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <1/4> 20 time=0.541015625 ?4?4?4?4?4?4 <1/4> 21 time=0.568359375 ?4?4?4?4?4?4 <1/4> 22 time= 0.59375 ?4?4?4?4?4?4 <1/4> 23 time=0.619140625 ?4?4?4?4?4?4 <1/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <1/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <1/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <1/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <1/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <1/4> 29 time=0.783203125 ?3?3?3?3?3?3 <1/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <1/4> 31 time= 0.84375 ?2?2?2?2?2?2 <1/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <1/4> 33 time=0.912109375 ?2?2?2?2?2?2 <1/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <1/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== WARNING: singular projection (resolved) # The following braid was computed by FollowMonodromy in 35 steps. monodromy[1]:=B(-2,-3,-4,-5,-3,-4,-1,-2,-3,-1); # segment 1/4 Time=4.7sec <2/4> 1 time= 0 ?5?5?5?5?5?5 <2/4> 2 time= 0.03125 ?5?5?5?5?5?5 <2/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <2/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <2/4> 5 time= 0.140625 ?5?5?5?5?5?5 <2/4> 6 time=0.166015625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 7 time= 0.203125 ?5?5?5?5?5?5 <2/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <2/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <2/4> 10 time=0.283203125 ?5?5?5?5?5?5 <2/4> 11 time= 0.31640625 ?5?5?5?5?5?5 <2/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <2/4> 13 time=0.365234375 ?5?5?5?5?5?5 <2/4> 14 time=0.384765625 ?5?5?5?5?5?5 <2/4> 15 time=0.412109375 ?5?5?5?5?5?5 <2/4> 16 time= 0.4296875 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 24 = ====================================== <2/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <2/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <2/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <2/4> 20 time=0.541015625 ?4?4?4?4?4?4 <2/4> 21 time=0.568359375 ?4?4?4?4?4?4 <2/4> 22 time= 0.59375 ?4?4?4?4?4?4 <2/4> 23 time=0.619140625 ?4?4?4?4?4?4 <2/4> 24 time=0.642578125 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = 135 = ====================================== <2/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <2/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <2/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <2/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <2/4> 29 time=0.783203125 ?3?3?3?3?3?3 <2/4> 30 time= 0.80859375 ?3?3?3?3?3?3 <2/4> 31 time= 0.84375 ?2?2?2?2?2?2 <2/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <2/4> 33 time=0.912109375 ?2?2?2?2?2?2 <2/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <2/4> 35 time= 0.984375 ?0?0?0?0?0?0 ====================================== = Nontrivial braiding = 24 = ====================================== WARNING: singular projection (resolved) ====================================== = Nontrivial braiding = (24)^-1 = ====================================== # The following braid was computed by FollowMonodromy in 35 steps. monodromy[2]:=B(1,3,2,1,4,5,4,3); # segment 2/4 Time=4.7sec <3/4> 1 time= 0 ?5?5?5?5?5?5 WARNING: singular projection (resolved) <3/4> 2 time= 0.03125 ?5?5?5?5?5?5 <3/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <3/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <3/4> 5 time= 0.140625 ?5?5?5?5?5?5 <3/4> 6 time=0.166015625 ?5?5?5?5?5?5 <3/4> 7 time= 0.203125 ?5?5?5?5?5?5 <3/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <3/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <3/4> 10 time=0.283203125 ?5?5?5?5?5?5 <3/4> 11 time= 0.31640625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <3/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <3/4> 13 time=0.365234375 ?5?5?5?5?5?5 <3/4> 14 time=0.384765625 ?5?5?5?5?5?5 <3/4> 15 time=0.412109375 ?5?5?5?5?5?5 <3/4> 16 time= 0.4296875 ?5?5?5?5?5?5 <3/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <3/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <3/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <3/4> 20 time=0.541015625 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = (135)^-1 = ====================================== <3/4> 21 time=0.568359375 ?4?4?4?4?4?4 <3/4> 22 time= 0.59375 ?4?4?4?4?4?4 <3/4> 23 time=0.619140625 ?4?4?4?4?4?4 <3/4> 24 time=0.642578125 ?4?4?4?4?4?4 <3/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <3/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <3/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <3/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <3/4> 29 time=0.783203125 ?3?3?3?3?3?3 <3/4> 30 time= 0.80859375 ?3?3?3?3?3?3 ====================================== = Nontrivial braiding = (24)^-1 = ====================================== <3/4> 31 time= 0.84375 ?2?2?2?2?2?2 <3/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <3/4> 33 time=0.912109375 ?2?2?2?2?2?2 <3/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <3/4> 35 time= 0.984375 ?0?0?0?0?0?0 # The following braid was computed by FollowMonodromy in 35 steps. monodromy[3]:=B(-4,-5,-2,-3,-4,-1,-2); # segment 3/4 Time=4.7sec <4/4> 1 time= 0 ?5?5?5?5?5?5 WARNING: singular projection (resolved) ====================================== = Nontrivial braiding = 24 = ====================================== <4/4> 2 time= 0.03125 ?5?5?5?5?5?5 <4/4> 3 time= 0.07421875 ?5?5?5?5?5?5 <4/4> 4 time= 0.1015625 ?5?5?5?5?5?5 <4/4> 5 time= 0.140625 ?5?5?5?5?5?5 <4/4> 6 time=0.166015625 ?5?5?5?5?5?5 <4/4> 7 time= 0.203125 ?5?5?5?5?5?5 <4/4> 8 time= 0.2265625 ?5?5?5?5?5?5 <4/4> 9 time= 0.26171875 ?5?5?5?5?5?5 <4/4> 10 time=0.283203125 ?5?5?5?5?5?5 <4/4> 11 time= 0.31640625 ?5?5?5?5?5?5 ====================================== = Nontrivial braiding = 135 = ====================================== <4/4> 12 time= 0.3359375 ?5?5?5?5?5?5 <4/4> 13 time=0.365234375 ?5?5?5?5?5?5 <4/4> 14 time=0.384765625 ?5?5?5?5?5?5 <4/4> 15 time=0.412109375 ?5?5?5?5?5?5 <4/4> 16 time= 0.4296875 ?5?5?5?5?5?5 <4/4> 17 time= 0.46484375 ?5?5?5?5?5?5 <4/4> 18 time= 0.48046875 ?5?5?5?5?5?5 <4/4> 19 time= 0.51171875 ?4?4?4?4?4?4 <4/4> 20 time=0.541015625 ?4?4?4?4?4?4 ====================================== = Nontrivial braiding = 24 = ====================================== <4/4> 21 time=0.568359375 ?4?4?4?4?4?4 <4/4> 22 time= 0.59375 ?4?4?4?4?4?4 <4/4> 23 time=0.619140625 ?4?4?4?4?4?4 <4/4> 24 time=0.642578125 ?4?4?4?4?4?4 <4/4> 25 time= 0.67578125 ?4?4?4?4?4?4 <4/4> 26 time= 0.6953125 ?4?4?4?4?4?4 <4/4> 27 time= 0.72265625 ?3?3?3?3?3?3 <4/4> 28 time= 0.75390625 ?3?3?3?3?3?3 <4/4> 29 time=0.783203125 ?3?3?3?3?3?3 <4/4> 30 time= 0.80859375 ?3?3?3?3?3?3 ====================================== = Nontrivial braiding = 135 = ====================================== <4/4> 31 time= 0.84375 ?2?2?2?2?2?2 <4/4> 32 time= 0.8828125 ?2?2?2?2?2?2 <4/4> 33 time=0.912109375 ?2?2?2?2?2?2 <4/4> 34 time= 0.94140625 ?1?1?1?1?1?1 <4/4> 35 time= 0.984375 ?0?0?0?0?0?0 # The following braid was computed by FollowMonodromy in 35 steps. monodromy[4]:=B(2,1,3,4,3,2,1,5,4,3); # segment 4/4 Time=5sec # Computing monodromy braids # loop[1]=w0.w0.21435 #I ReadVK( "action" ) #I ReadVK( "action" ) done #I there are 6 generators and 5 relators of total length 70 1: cdefabc=dabcdef 2: efabcde=abcdefd 3: dabcdef=abcdefb 4: fabcdef=efabcde 5: babcdef=abcdefa