Maple 13 can solve it, but it took forever. There is definitely something wrong here due to indexed names and possibly the length function skewing the weights of equations (messing up the variable order). This shouldn't be hard to fix. In the meantime you can use this workaround function in place of solve for polynomial systems. solve2 := proc(sys) local V, F, R, S, x, i; V := indets(remove(type, [args], equation)); F := [seq(V[i]=cat(x,i+1000),i=1..nops(V))]: R := [seq(cat(x,i+1000)=V[i],i=1..nops(V))]: S := subs(F, [args]); S := [solve(op(S))]; return op(subs(R,S)); end proc:

Maple 13 can solve it, but it took forever. There is definitely something wrong here due to indexed names and possibly the length function skewing the weights of equations (messing up the variable order). This shouldn't be hard to fix. In the meantime you can use this workaround function in place of solve for polynomial systems. solve2 := proc(sys) local V, F, R, S, x, i; V := indets(remove(type, [args], equation)); F := [seq(V[i]=cat(x,i+1000),i=1..nops(V))]: R := [seq(cat(x,i+1000)=V[i],i=1..nops(V))]: S := subs(F, [args]); S := [solve(op(S))]; return op(subs(R,S)); end proc:

after 9.5, Maple's "solve" was wrecked...so we must keep 9.5 installed for faculty who do research that involves solving even modestly large systems of polynomials. Could you please post an example if you have one handy ? In my tests Maple 13 solves many more systems than Maple 9.5. For example: cyclic6 := {x*y*z+y*z*t+z*t*u+t*u*v+u*v*x+v*x*y, x*y*z*t+y*z*t*u+z*t*u*v+t*u*v*x+u*v*x*y+v*x*y*z, x*y*z*t*u*v-1, x+y+z+t+u+v, x*y+y*z+z*t+t*u+u*v+x*v, x*y*z*t*u+y*z*t*u*v+z*t*u*v*x+t*u*v*x*y+u*v*x*y*z+v*x*y*z*t}:

after 9.5, Maple's "solve" was wrecked...so we must keep 9.5 installed for faculty who do research that involves solving even modestly large systems of polynomials. Could you please post an example if you have one handy ? In my tests Maple 13 solves many more systems than Maple 9.5. For example: cyclic6 := {x*y*z+y*z*t+z*t*u+t*u*v+u*v*x+v*x*y, x*y*z*t+y*z*t*u+z*t*u*v+t*u*v*x+u*v*x*y+v*x*y*z, x*y*z*t*u*v-1, x+y+z+t+u+v, x*y+y*z+z*t+t*u+u*v+x*v, x*y*z*t*u+y*z*t*u*v+z*t*u*v*x+t*u*v*x*y+u*v*x*y*z+v*x*y*z*t}:

Use the randpoly command: f := randpoly([x,y,z],degree=3,dense,coeffs=proc() 1 end); sort(f); M := [op(f)];

No it doesn't. It's possible, and there is research underway.

No it doesn't. It's possible, and there is research underway.

http://en.wikipedia.org/wiki/Radix_sort

In the code above do this instead. You will need to use i=1..35 instead of 1 to 5.

K1vals := [1,2,3,4,5]:
K2vals := [6,7,8,9,10]:
K3vals := [11,12,13,14,15]:
S := {seq({K1=K1vals[i], K2=K2vals[i], K3=K3vals[i]}, i=1..5)};

In the code above do this instead. You will need to use i=1..35 instead of 1 to 5.

K1vals := [1,2,3,4,5]:
K2vals := [6,7,8,9,10]:
K3vals := [11,12,13,14,15]:
S := {seq({K1=K1vals[i], K2=K2vals[i], K3=K3vals[i]}, i=1..5)};

You can browse the help system online at http://www.maplesoft.com/support/help/ In particular, http://www.maplesoft.com/support/help/view.aspx?sid=25596 A few of my favorite improvements are: - they tweaked the garbage collector, improving overall performance by ~12% - improvements to solving linear systems and svd - 3d plots display faster and look better - graph isomorphism test There are some more technical things some people will appreciate: - improvements to PDEs and DAEs - fast element-wise operations on matrices - improvements to polynomial system solving (RegularChains) - gcd with algebraic numbers is much faster - you can read in files with $define and $include And then there are some tantalizing hints about what the future might hold: - task programming model for parallel algorithms (like Cilk) - multiplying and dividing polynomials mod p is over 20x faster - asymptotically fast (FFT) polynomial algorithms in RegularChains Overall it's a good release.

Overall the site looks really good.

Maple 12 will not use any additional cores for this computation. Sadly, I didn't see any obvious way of simplifying your model either.

Either one is trivially breakable. You might want to try an example.

This is really quite impressive.