*----* MuPAD 2.0.0 -- The Open Computer Algebra System /| /| *----* | Copyright (c) 1997 - 2000 by SciFace Software | *--|-* All rights reserved. |/ |/ *----* Licensed to: Nicolas M. Thiery >> read("testDegreeBounds.mu"): compTGroupF(5,1,0):quit proc InvariantRingTransitiveGroup(n, i, p) ... end Info: Computation of the invariant ring of the 1st transitive permutation \ group on 5 variables in characteristic 0. Info: Module GLIP version 0.4 ready. Type GLIP::doc(); for usage informati\ on. Info: ====================================================================\ ========== Info: Computation of a minimal generating set using SAGBI+linear algebra. Info: Version: $Id: comphead.mu,v 1.2 2001/03/21 17:51:40 nthiery Exp $ Date: Wed May 2 19:56:55 CEST 2001 Host: giulia3.medicis.polytechnique.fr Info: ====================================================================\ ========== Info: degreeBound: from the dimension of the space: 10 Info: secondaryInvariantsSeries: Computation from cycle types Info: secondaryInvariantsSeries: working on cycletype, [5, 0, 0, 0, 0] Info: secondaryInvariantsSeries: working on cycletype, [0, 0, 0, 0, 1] Info: degreeBound: enhancement from the degrees of the primary invariants:\ 8 Info: degreeBound: enhancement from the size of the group: 5 Info: Constructing a minimal generating set at degree 0 Info: No generators at degree 0 Info: Constructing a minimal generating set at degree 1 Info: Constructing the initial poset at degree 1 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 1 initial monomials . Info: Applying Gauss Elimination Info: Extracting initial monomials that are not hit Info: Dim: 1 Skiped: 0 Char Col: 0 Mgs: 1 Info: 1 20 2403681 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 1: Date: Wed May 2 19:56:55 CEST 2001 Info: Time: 20 ms Info: Memory: 2403 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 1 Info: -------------------------------------- Info: [1, 0, 0, 0, 0] Info: -------------------------------------- Info: Constructing a minimal generating set at degree 2 Info: Constructing the initial poset at degree 1 Info: Constructing the initial poset at degree 2 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 3 initial monomials ... Info: Applying Gauss Elimination Info: Extracting initial monomials that are not hit Info: Dim: 3 Skiped: 1 Char Col: 0 Mgs: 2 Info: 2 10 2403681 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 2: Date: Wed May 2 19:56:55 CEST 2001 Info: Time: 10 ms Info: Memory: 2403 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 2 Info: -------------------------------------- Info: [1, 0, 1, 0, 0] Info: [1, 1, 0, 0, 0] Info: -------------------------------------- Info: Constructing a minimal generating set at degree 3 Info: Constructing the initial poset at degree 3 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 7 initial monomials ....... Info: Applying Gauss Elimination Info: Extracting initial monomials that are not hit Info: Dim: 7 Skiped: 3 Char Col: 0 Mgs: 4 Info: 3 0 2403681 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 3: Date: Wed May 2 19:56:55 CEST 2001 Info: Time: 0 ms Info: Memory: 2403 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 4 Info: -------------------------------------- Info: [1, 1, 0, 1, 0] Info: [1, 1, 1, 0, 0] Info: [2, 0, 0, 0, 1] Info: [2, 0, 0, 1, 0] Info: -------------------------------------- Info: Constructing a minimal generating set at degree 4 Info: Constructing the initial poset at degree 4 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 14 initial monomials .......pp.p...... Info: Applying Gauss Elimination [6:2][7:2]. Info: Extracting initial monomials that are not hit Info: Dim: 14 Skiped: 7 Char Col: 3 Mgs: 4 Info: 4 30 2436449 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 4: Date: Wed May 2 19:56:56 CEST 2001 Info: Time: 30 ms Info: Memory: 2436 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 4 Info: -------------------------------------- Info: [1, 1, 1, 1, 0] Info: [2, 0, 0, 1, 1] Info: [2, 0, 1, 0, 1] Info: [2, 0, 1, 1, 0] Info: -------------------------------------- Info: Constructing a minimal generating set at degree 5 Info: Constructing the initial poset at degree 5 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 26 initial monomials ........pp.pp..pp.pp..p..p.p..p.pp...... Info: Applying Gauss Elimination [7:2][8:2][10:2][11:2].[13:3].[15:2][16:2][17:2][18:2][19:3][20:2]. Info: Extracting initial monomials that are not hit Info: Dim: 26 Skiped: 8 Char Col: 14 Mgs: 4 Info: 5 60 2452833 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 5: Date: Wed May 2 19:56:56 CEST 2001 Info: Time: 60 ms Info: Memory: 2452 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 4 Info: -------------------------------------- Info: [1, 1, 1, 1, 1] Info: [2, 0, 1, 1, 1] Info: [2, 0, 2, 0, 1] Info: [2, 1, 0, 2, 0] Info: -------------------------------------- Info: Total time: 410 ms Info: ====================================================================\ ========== Info: Computation of a minimal generating set using SAGBI+linear algebra. Info: Version: $Id: comphead.mu,v 1.2 2001/03/21 17:51:40 nthiery Exp $ Date: Wed May 2 19:56:56 CEST 2001 Host: giulia3.medicis.polytechnique.fr Info: ====================================================================\ ========== Info: Total time: 0 ms