*----* 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(6,10,0):quit proc InvariantRingTransitiveGroup(n, i, p) ... end Info: Computation of the invariant ring of the 10th transitive permutation\ group on 6 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:57:12 CEST 2001 Host: giulia3.medicis.polytechnique.fr Info: ====================================================================\ ========== Info: degreeBound: from the dimension of the space: 15 Info: secondaryInvariantsSeries: Computation from cycle types Info: secondaryInvariantsSeries: working on cycletype, [0, 0, 2, 0, 0, 0] Info: secondaryInvariantsSeries: working on cycletype, [6, 0, 0, 0, 0, 0] Info: secondaryInvariantsSeries: working on cycletype, [3, 0, 1, 0, 0, 0] Info: secondaryInvariantsSeries: working on cycletype, [2, 2, 0, 0, 0, 0] Info: secondaryInvariantsSeries: working on cycletype, [0, 1, 0, 1, 0, 0] Info: degreeBound: enhancement from the degrees of the primary invariants:\ 13 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 30 2862433 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 1: Date: Wed May 2 19:57:13 CEST 2001 Info: Time: 30 ms Info: Memory: 2862 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, 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 2862433 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 2: Date: Wed May 2 19:57:13 CEST 2001 Info: Time: 10 ms Info: Memory: 2862 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, 0] Info: [1, 1, 0, 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 5 initial monomials ..... Info: Applying Gauss Elimination Info: Extracting initial monomials that are not hit Info: Dim: 5 Skiped: 3 Char Col: 0 Mgs: 2 Info: 3 10 2862433 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 3: Date: Wed May 2 19:57:13 CEST 2001 Info: Time: 10 ms Info: Memory: 2862 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, 1, 0] Info: [1, 1, 1, 0, 0, 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 10 initial monomials .....pp..... Info: Applying Gauss Elimination [4:2]. Info: Extracting initial monomials that are not hit Info: Dim: 10 Skiped: 6 Char Col: 2 Mgs: 2 Info: 4 20 2862433 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 4: Date: Wed May 2 19:57:13 CEST 2001 Info: Time: 20 ms Info: Memory: 2862 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 2 Info: -------------------------------------- Info: [1, 1, 1, 0, 1, 0] Info: [1, 1, 1, 1, 0, 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 15 initial monomials ............pp... Info: Applying Gauss Elimination [11:2]. Info: Extracting initial monomials that are not hit Info: Dim: 15 Skiped: 12 Char Col: 2 Mgs: 1 Info: 5 30 2878817 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 5: Date: Wed May 2 19:57:13 CEST 2001 Info: Time: 30 ms Info: Memory: 2878 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 1 Info: -------------------------------------- Info: [1, 1, 1, 1, 1, 0] Info: -------------------------------------- Info: Constructing a minimal generating set at degree 6 Info: Constructing the initial poset at degree 6 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 26 initial monomials .............pp.....p.p.p.p.pp.p... Info: Applying Gauss Elimination [12:2][17:2][18:2].[20:2][21:2][22:3][23:2]Info: Extracting initial monomials that are not hit Info: Dim: 26 Skiped: 17 Char Col: 8 Mgs: 1 Info: 6 80 2895201 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 6: Date: Wed May 2 19:57:14 CEST 2001 Info: Time: 80 ms Info: Memory: 2895 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 1 Info: -------------------------------------- Info: [1, 1, 1, 1, 1, 1] Info: -------------------------------------- Info: Constructing a minimal generating set at degree 7 Info: Constructing the initial poset at degree 7 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 38 initial monomials ....................pp....p....pp.pp...p.p.p.pp...p Info: Applying Gauss Elimination [19:2]..[27:2][28:2].[32:3][33:2][34:4][35:2][37:2]Info: Extracting initial monomials that are not hit Info: Dim: 38 Skiped: 26 Char Col: 11 Mgs: 1 Info: 7 110 2911585 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 7: Date: Wed May 2 19:57:14 CEST 2001 Info: Time: 110 ms Info: Memory: 2911 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 1 Info: -------------------------------------- Info: [3, 2, 1, 0, 0, 1] Info: -------------------------------------- Info: Constructing a minimal generating set at degree 8 Info: Constructing the initial poset at degree 8 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 59 initial monomials .........................pp.p.........p.p.p..p...p.pp.pp.....pp..pp..p.pp.\ .p.p.p.p Info: Applying Gauss Elimination [24:2][25:2][34:2][35:2][36:2][38:2][41:2][42:3][43:4][44:3][48:2][50:4][52:2][53:4][54:3][55:4][56:4][57:2][58:2]Info: Extracting initial monomials that are not hit Info: Dim: 59 Skiped: 39 Char Col: 19 Mgs: 1 Info: 8 210 2960737 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 8: Date: Wed May 2 19:57:14 CEST 2001 Info: Time: 210 ms Info: Memory: 2960 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 1 Info: -------------------------------------- Info: [3, 2, 2, 0, 0, 1] Info: -------------------------------------- Info: Constructing a minimal generating set at degree 9 Info: Constructing the initial poset at degree 9 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 84 initial monomials .............................................pp.pp.p..pp..........p.p.p..p\ .p..p.p.ppp...p.p.pp......pp..p.p.p.p Info: Applying Gauss Elimination [44:2][45:2][46:2][48:2][58:2][59:3][60:2].[62:2][63:2][65:2][66:2][67:4][70:4][71:4][72:5].[78:2][80:4][81:2][82:3][83:2]Info: Extracting initial monomials that are not hit Info: Dim: 84 Skiped: 61 Char Col: 22 Mgs: 1 Info: 9 290 3026273 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 9: Date: Wed May 2 19:57:15 CEST 2001 Info: Time: 300 ms Info: Memory: 3026 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 1 Info: -------------------------------------- Info: [3, 2, 2, 0, 1, 1] Info: -------------------------------------- Info: Constructing a minimal generating set at degree 10 Info: Constructing the initial poset at degree 10 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 121 initial monomials ....................................................................ppp.pp\ .p.p...p.....p..p..pp.pp.ppp.p.pp..........p.p.p.p.p.p..p.p.p.pp..p.p.p.pp\ p.pp...pp..p.p.p.p Info: Applying Gauss Elimination [67:3][68:4][69:2].[71:2]..[78:2][80:2][82:2][83:3][84:3][85:2][86:2][96:2][97:5][98:2][99:4][100:4][101:5][102:3][103:6].[105:2][106:2][108:5][109:3][110:5][111:5][112:8][113:4][115:2][117:2][118:5][119:9][120:5]Info: Extracting initial monomials that are not hit Info: Dim: 121 Skiped: 85 Char Col: 36 Mgs: 0 Info: 10 500 3091809 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 10: Date: Wed May 2 19:57:15 CEST 2001 Info: Time: 500 ms Info: Memory: 3091 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 0 Info: Constructing a minimal generating set at degree 11 Info: Constructing the initial poset at degree 11 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 166 initial monomials ..........................................................................\ .pp.p.pp.p...........p..............p.p.p.p.p..p..pp.p.p.pp..ppp..p.pp.pp.\ p...p...p..p..pp.p.pp.p.p.pp.ppp.........p.p.p.p.p..p.p.p.p.p.ppp..p.pp..p\ p.p...p Info: Applying Gauss Elimination [74:2][75:2][76:2][77:2][88:2][102:2][103:3][104:2][105:3].[108:2][110:2][111:4][112:2][113:5][115:4][116:3][117:3][118:5][119:6][120:3][121:5][122:5][123:2][126:2][128:2][130:2][131:6][132:4][133:2][134:6][135:5][136:7][145:3][146:5][147:4][148:8][149:7].[151:4][152:9][153:2][154:4][155:2][156:4][158:6][159:11][160:10][161:6][162:7][165:7]Info: Extracting initial monomials that are not hit Info: Dim: 166 Skiped: 115 Char Col: 51 Mgs: 0 Info: 11 790 3222881 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 11: Date: Wed May 2 19:57:16 CEST 2001 Info: Time: 790 ms Info: Memory: 3222 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 0 Info: Constructing a minimal generating set at degree 12 Info: Constructing the initial poset at degree 12 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 230 initial monomials ..........................................................................\ ...................................................pp...pp.pp.p...pp.ppp.p\ ...........p................p.p.p.p.p.p.p.p.p..p..p.p.pp..pppp..p.p.ppp.p.\ pp...p.p.pp.pp......p.p..p...p.p.pppp.p.pp.......p.p.p.p.pp.p.p.p.p.p.pp..\ p.p.p.p..p Info: Applying Gauss Elimination [124:2][127:3][128:2][129:2][132:2][133:3][134:2][145:2][161:2][162:3][163:3][164:3][165:2][166:5][167:3][168:2][169:5][171:2][173:4][174:4][175:5][177:4][178:2][179:4][180:8][181:12][182:7][183:6][184:9][185:8][186:5][187:6][188:9][189:11][190:2][195:3][196:2][198:3][201:2][202:4][203:7][204:2][205:11][212:2][213:9][214:9][215:7][216:11][217:13][218:16][219:9][220:14][221:4][222:11][223:8][224:2][225:2][226:17][227:10][229:10]Info: Extracting initial monomials that are not hit Info: Dim: 230 Skiped: 170 Char Col: 60 Mgs: 0 Info: 12 1100 3403105 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 12: Date: Wed May 2 19:57:18 CEST 2001 Info: Time: 1 s 100 ms Info: Memory: 3403 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 0 Info: Constructing a minimal generating set at degree 13 Info: Constructing the initial poset at degree 13 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 305 initial monomials ..........................................................................\ ..........................................................................\ ...............................pp...pp.pp.p.p..p...p...........pp.p....pp.\ pppp.pp.pp.ppp.p.p.ppp...............p..............p.p.p.p.pp.p.pp..p.p.p\ .p.p.p.p..p.p.pp.p.ppp...pp..p.p.p.p.ppp.p.p.pp.p.pp.......p.p.ppp..p.p.pp\ .....p.p.pp..p.p.p.p.p.p.p.p Info: Applying Gauss Elimination [178:2][181:3][182:3][183:3][184:2][186:2][187:2]..[200:2][201:2][205:2][206:4][207:4][208:3][209:4][210:4][211:2][212:3][227:2].[242:5][243:3][244:8][245:5][246:7][247:7][248:2][249:11][250:10][251:6][252:8][253:3][254:2].[257:2][258:6][259:7][260:10][261:7][262:6][264:2][265:6][266:9][267:10][268:10][269:14][270:14][271:10][272:3][273:12][274:14][275:16][276:5][282:2][283:7][284:3][286:2][287:6][288:6][293:7][294:15][295:17][296:18][297:19][298:9][299:19][300:3][301:10][302:9][303:2][304:14]Info: Extracting initial monomials that are not hit Info: Dim: 305 Skiped: 233 Char Col: 72 Mgs: 0 Info: 13 1580 3648865 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 13: Date: Wed May 2 19:57:19 CEST 2001 Info: Time: 1 s 580 ms Info: Memory: 3648 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 0 Info: Updating the degreeBound to 9 which is optimal! Info: Total time: 5 s 200 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:57:19 CEST 2001 Host: giulia3.medicis.polytechnique.fr Info: ====================================================================\ ========== Info: Total time: 0 ms