Maple Questions and Posts

These are Posts and Questions associated with the product, Maple

restart;
with(plottools);
with(plots);
a := 1;
b := 1;
c := 1;
k := 1;
l := 1;
omega := 1;
A[2] = 2;
alpha := 2;
beta := 1;
kappa := 0.5;
C[1] := 1;
lambda := -1;

omega := (-alpha^6*b^4*lambda + 2*alpha^6*b^2*l^2 - 2*a^2*alpha^4*l^2 + 2*alpha^4*b^2*k^2 + a^4*alpha^2*lambda - 2*a^2*alpha^2*k^2 + 4*a*C[1])/(-4*alpha^2*b^2 + 4*a^2);

a[0] := 0;

a[1] := sqrt(-(-alpha^2*b^2 + a^2)/(4*beta))*alpha;

b[1] := sqrt(-(alpha^2*b^2*lambda*sigma - a^2*lambda*sigma)/(4*beta))*alpha;

sigma := A[1]*A[1] - A[2]*A[2];

T := A[1]*sinh(xi*sqrt(-lambda)) + A[2]*cosh(xi*sqrt(-lambda)) + mu/lambda;

t := diff(T, xi);

S := t/T;

R := 1/T;

mu := 0;

A[1] := 0;

y := 0;

xi := k*x^kappa/kappa + l*y^kappa/kappa - omega*t^kappa/kappa;

  Error, recursive assignment

Dear all,

I'm reporting what seems to me as a bug in the SMTLIB library in maple. 

    |\^/|     Maple 2026 (X86 64 LINUX)
._|\|   |/|_. Copyright (c) Maplesoft, a division of Waterloo Maple Inc. 2026
 \  MAPLE  /  All rights reserved. Maple is a trademark of
 <____ ____>  Waterloo Maple Inc.
      |       Type ? for help.
> SMTLIB:-Satisfiable({x^2=2,y^2=2,x<y});
                                     true

> SMTLIB:-Satisfiable({x^2=2,y^2=2,y<x});
                                     false

> SMTLIB:-Satisfiable({x^2=2,a^2=2,a<x});
                                     true

The Satisfiable command do not output the correct decision on two formulas of equivalent realization by switching x<y (output SAT) to y<x (output UNSAT). I suspect this is because some alphabetical order depandance in the variables as for a<y we get SAT again.

I tried to feed Z3 with the code given by ToString on the problematic formula and I get two different outputs :

  • on the Z3 version 4.8.12 from the ubuntu repository (apt install) I also get the wrong UNSAT output;
  • one the Z3 version 4.17.0 build from the official github repository I finally get the correct SAT output.

Thus, I suspect a version problem in SMTLIB that do not take in account the last updates made in SMT solvers (Z3?).

Many thanks for considering my problem!

A little while ago, I created a video, Engaging and Enlightening Students with Maple Visualizations, that showed a sample of Maple visualizations that would be helpful in teaching math. Doing that allowed me to get reacquainted with some of Maple's plotting features that I hadn't used for a while. As a result, I made a second instructional video for my Maple tips series, Animating a Polyhedron in Maple

I chose this topic because I thought it would show several features in Maple that might not be known to all users. I list them below and encourage you to try them out.

  • The plots:-polyhedraplot command allows you to create a 3-D plot of a polyhedron, including one of 138 polyhedra that Maple knows about.

  • The list of named polyhedra available can be obtained by calling the plots:-polyhedra_supported command.

  • The viewpoint option, which allows you to create an animation by varying the viewpoint through a 3D plot, can be used to rotate the polyhedron.

  • Finally, the Export feature allows you to save the plot animation as an animated GIF.

 

restart;
solve({-alpha^4*b^2*lambda*mu*b[1] + a^2*alpha^2*lambda*mu*b[1] + 6*beta*lambda^2*sigma*a[0]*a[1]^2 + 6*beta*mu^2*a[0]*a[1]^2 - 6*beta*lambda*a[0]*b[1]^2 = 0, -alpha^4*b^2*lambda^2*mu*sigma - alpha^4*b^2*mu^3 + a^2*alpha^2*lambda^2*mu*sigma + a^2*alpha^2*mu^3 - 4*beta*lambda^2*sigma*a[0]*b[1] - 4*beta*lambda*mu*b[1]^2 - 4*beta*mu^2*a[0]*b[1] = 0, -alpha^4*b^2*lambda^2*sigma - alpha^4*b^2*mu^2 + a^2*alpha^2*lambda^2*sigma + a^2*alpha^2*mu^2 + beta*lambda^2*sigma*a[1]^2 + beta*mu^2*a[1]^2 - 3*beta*lambda*b[1]^2 = 0, -alpha^4*b^2*lambda^2*sigma - alpha^4*b^2*mu^2 + a^2*alpha^2*lambda^2*sigma + a^2*alpha^2*mu^2 + 3*beta*lambda^2*sigma*a[1]^2 + 3*beta*mu^2*a[1]^2 - beta*lambda*b[1]^2 = 0, -alpha^6*b^4*lambda^2*mu*b[1] + alpha^6*b^2*l^2*lambda^2*sigma*a[0] + alpha^6*b^2*l^2*mu^2*a[0] - a^2*alpha^4*l^2*lambda^2*sigma*a[0] + alpha^4*b^2*k^2*lambda^2*sigma*a[0] - a^2*alpha^4*l^2*mu^2*a[0] + alpha^4*b^2*k^2*mu^2*a[0] + 2*alpha^2*b^2*beta*lambda^2*sigma*a[0]^3 + a^4*alpha^2*lambda^2*mu*b[1] - a^2*alpha^2*k^2*lambda^2*sigma*a[0] - 6*alpha^2*b^2*beta*lambda^2*a[0]*b[1]^2 + 2*alpha^2*b^2*beta*mu^2*a[0]^3 - a^2*alpha^2*k^2*mu^2*a[0] + 2*a^2*beta*lambda^2*sigma*a[0]^3 + 2*alpha^2*b^2*lambda^2*omega*sigma*a[0] - 6*a^2*beta*lambda^2*a[0]*b[1]^2 + 2*a^2*beta*mu^2*a[0]^3 + 2*alpha^2*b^2*mu^2*omega*a[0] - 2*a^2*lambda^2*omega*sigma*a[0] - 2*a^2*mu^2*omega*a[0] + 2*a*lambda^2*sigma*C[1]*a[0] + 2*a*mu^2*C[1]*a[0] = 0, -2*alpha^6*b^4*lambda^3*sigma - 2*alpha^6*b^4*lambda*mu^2 + alpha^6*b^2*l^2*lambda^2*sigma + alpha^6*b^2*l^2*mu^2 - a^2*alpha^4*l^2*lambda^2*sigma + alpha^4*b^2*k^2*lambda^2*sigma + 2*a^4*alpha^2*lambda^3*sigma - a^2*alpha^4*l^2*mu^2 + alpha^4*b^2*k^2*mu^2 + 6*alpha^2*b^2*beta*lambda^2*sigma*a[0]^2 + 2*a^4*alpha^2*lambda*mu^2 - a^2*alpha^2*k^2*lambda^2*sigma - 6*alpha^2*b^2*beta*lambda^2*b[1]^2 + 6*alpha^2*b^2*beta*mu^2*a[0]^2 - a^2*alpha^2*k^2*mu^2 + 6*a^2*beta*lambda^2*sigma*a[0]^2 + 2*alpha^2*b^2*lambda^2*omega*sigma - 6*a^2*beta*lambda^2*b[1]^2 + 6*a^2*beta*mu^2*a[0]^2 + 2*alpha^2*b^2*mu^2*omega - 2*a^2*lambda^2*omega*sigma - 2*a^2*mu^2*omega + 2*a*lambda^2*sigma*C[1] + 2*a*mu^2*C[1] = 0, -alpha^6*b^4*lambda^3*sigma + alpha^6*b^4*lambda*mu^2 + alpha^6*b^2*l^2*lambda^2*sigma + alpha^6*b^2*l^2*mu^2 - a^2*alpha^4*l^2*lambda^2*sigma + alpha^4*b^2*k^2*lambda^2*sigma + a^4*alpha^2*lambda^3*sigma - a^2*alpha^4*l^2*mu^2 + alpha^4*b^2*k^2*mu^2 + 6*alpha^2*b^2*beta*lambda^2*sigma*a[0]^2 - a^4*alpha^2*lambda*mu^2 - a^2*alpha^2*k^2*lambda^2*sigma - 2*alpha^2*b^2*beta*lambda^2*b[1]^2 + 12*alpha^2*b^2*beta*lambda*mu*a[0]*b[1] + 6*alpha^2*b^2*beta*mu^2*a[0]^2 - a^2*alpha^2*k^2*mu^2 + 6*a^2*beta*lambda^2*sigma*a[0]^2 + 2*alpha^2*b^2*lambda^2*omega*sigma - 2*a^2*beta*lambda^2*b[1]^2 + 12*a^2*beta*lambda*mu*a[0]*b[1] + 6*a^2*beta*mu^2*a[0]^2 + 2*alpha^2*b^2*mu^2*omega - 2*a^2*lambda^2*omega*sigma - 2*a^2*mu^2*omega + 2*a*lambda^2*sigma*C[1] + 2*a*mu^2*C[1] = 0}, {omega, a[0], a[1], b[1]});
 

Recently @salim-barzani asked a question about a paper that involved analysing the different types of roots of polynomials. The appendix in that paper gave the example of the roots of x^4+x^2*e[2]+x*e[1]+e[0]using the analysis in Lu et al, "A complete discrimination system for polynomials", Science in China (Ser. E), 39 (1996) 628-646. The analysis uses the discriminant sequence and extensions. Maple provides this through RegularChains:-ParametricSystemTools:-DiscrminantSequence. For example for this polynomial we find there is a real root of multiplicity 2 and a complex conjugate pair when D__2*D__3 < 0 and D__4 = 0 where the D__i are the ith entries in the discriminant sequence [1, -e[2], -2*e[2]^3+8*e[0]*e[2]-9*e[1]^2, 16*e[0]*e[2]^4-4*e[1]^2*e[2]^3-128*e[0]^2*e[2]^2+144*e[0]*e[1]^2*e[2]-27*e[1]^4+256*e[0]^3].

 

The problem with these conditions is that they are in terms of the D__i and not directly in terms of the e__i parameters. One can derive these conditions and then solve them to find the conditions on the parameters, but Maple has various routines in the RegularChains, RootFinding:-Parametric and SolveTools packages that directly find conditions on parameters to find when there are specified numbers of real or complex roots for polynomial systems. So this post is my attempt to use these tools to find the conditions on the parameters of the above polynomial that give various types of roots. One immediate difficulty is that generally these routines count distinct roots irrespective of multiplicity, and so some indirect analysis is required. There are several different types of commands and analyses that could be used, and my choices here are more to do with my learning experience than an optimum analysis.

 

The first conclusion is that it is possible, although RealComprehensiveTriangularize did not work as I expected when asking for zero real roots (see cases (a) and (b)) (bug?). Assuming it had worked, RealComprehensiveTriangularize could cover all the cases here, though that will not be true when there are more parameters. There doesn't seem to be an obvious systematic way of doing this analysis, which is a downside. Another downside is the large number of subcase conditions, which look as if they could be combined into fewer subcases. CellDecomposition works well for cases without multiplicity.


Main worksheet [not all is displayed below]:

Download RootAnalysis4.mw

 

Any explanation why this happens? notice, I did not supply the x and y ranges, let Maple decide.

restart;

interface(version);

`Standard Worksheet Interface, Maple 2026.1, Windows 10, April 28 2026 Build ID 2011354`

plots:-contourplot(y+sin(x),'colorbar'=false,':-contours' = 2,size=[100,100]);

plots:-contourplot(y+sin(x),'colorbar'=false,':-contours' = 1,size=[100,100]);

Error, (in plot/iplot2d) numeric exception: division by zero

 

 

Download bug_in_contourplot.mw

nowday i am very intrested in this method which really i something intresting  i want to generate all the type of function not just thus in this paper  i will update the other  layers too but need sometime, i try to apply the exact layer  as author did in this paper but i did something mistake in one part about finding the parameters  i didnt fix that part but i did the second  part of the paper and i got answer, but for first one i need some help, also if possible  it will be amazing if someone can construct the all layer which can be construct , this is just two cases i provide here and in one of them i am stuck and i can't find the parameter but other i did it , target  of finding in apply the formula  for more  hiden layer  becuase in other papers i saw a lot of the  hiden layer i want to apply all of them if possible not jsut tw or three of them i want to know  and see how many hiden layer exist by constructing generate function, and the graph i am not sure maple can do that or not like fig 1 and fig 2 which if do that it will  be more amazing 

thank you for any help 

 

 

t1 have problem about  first case of layer and t2 dont have problem

I asked Maple AI what a glyph is. Then I prompted this

A kernel lost message was returned and the AI pannel became irresponsive.

Maple is still running well in exsisting and new tabs. 

Can the AI service be restarted from the user interface?

(Is that crash reproducible?)

 

Edit:

For exercises involving Pick's Theorem, I need grid points within a Cartesian coordinate system. How can "all" grid points - at least within the first quadrant - be generated without the tedious manual entry of integer coordinates? Is it possible to draw grid polygons as closed polylines simply by clicking on the grid points? (BTW: At the moment, this works well in the good old "Cabri.")
My search within the "Help" section (using terms such as plot, grid, mesh, lattice, etc.) proved unsuccessful.

The HTML characters in the attached document cause problems here on MaplePrimes. You have to open the worksheet

Download HTML_characters_in_math_mode.mw

05-2-2.mws

Can you help me with this code?

restart: with(VectorCalculus):

assume(g>0,Omega>0,V0>0,theta>0,alpha>0,alpha<=Pi/2):

alias(omega=w,Omega=W,alpha=a):

w:=<-W*cos(a),0,W*sin(a)>;

Vector(3, {(1) = -W*cos(a), (2) = 0, (3) = W*sin(a)})

(1)

r:=<x(t),y(t),z(t)>; v:=diff(r,t);

Vector(3, {(1) = x(t), (2) = y(t), (3) = z(t)})

Vector(3, {(1) = diff(x(t), t), (2) = diff(y(t), t), (3) = diff(z(t), t)})

(2)

F[gravity]:=<0,0,-g>;

Vector(3, {(1) = 0, (2) = 0, (3) = -g})

(3)

F[Coriolis]:=-2*w &x v;

Vector(3, {(1) = 2*W*sin(a)*(diff(y(t), t)), (2) = -2*W*cos(a)*(diff(z(t), t))-2*W*sin(a)*(diff(x(t), t)), (3) = 2*W*cos(a)*(diff(y(t), t))})

(4)

F[centrifugal]:=-w &x (w &x r);

Vector(3, {(1) = W*sin(a)*(W*cos(a)*z(t)+W*sin(a)*x(t)), (2) = W^2*cos(a)^2*y(t)+W^2*sin(a)^2*y(t), (3) = W*cos(a)*(W*cos(a)*z(t)+W*sin(a)*x(t))})

(5)

F[resultant]:=F[gravity]+F[Coriolis]+F[centrifugal];

Vector(3, {(1) = 2*W*sin(a)*(diff(y(t), t))+W*sin(a)*(W*cos(a)*z(t)+W*sin(a)*x(t)), (2) = -2*W*cos(a)*(diff(z(t), t))-2*W*sin(a)*(diff(x(t), t))+W^2*cos(a)^2*y(t)+W^2*sin(a)^2*y(t), (3) = -g+2*W*cos(a)*(diff(y(t), t))+W*cos(a)*(W*cos(a)*z(t)+W*sin(a)*x(t))})

(6)

eq:=(u,i)->simplify(diff(u(t),t,t)=F[resultant][i]):

xeq:=eq(x,1); yeq:=eq(y,2); zeq:=eq(z,3);

xeq := diff(x(t), `$`(t, 2)) = Omega*sin(alpha)*(Omega*sin(alpha)*x(t)+Omega*cos(alpha)*z(t)+2*(diff(y(t), t)))

yeq := diff(y(t), `$`(t, 2)) = Omega*(y(t)*Omega-2*(diff(z(t), t))*cos(alpha)-2*(diff(x(t), t))*sin(alpha))

zeq := diff(z(t), `$`(t, 2)) = sin(alpha)*cos(alpha)*x(t)*Omega^2+cos(alpha)^2*z(t)*Omega^2+2*Omega*cos(alpha)*(diff(y(t), t))-g

(7)

ic:=x(0)=0,y(0)=0,z(0)=0,D(x)(0)=0,D(y)(0)=V0*cos(theta),D(z)(0)=V0*sin(theta);

ic := x(0) = 0, y(0) = 0, z(0) = 0, (D(x))(0) = 0, (D(y))(0) = V0*cos(theta), (D(z))(0) = V0*sin(theta)

(8)

sol:=dsolve({xeq,yeq,zeq,ic},{x(t),y(t),z(t)},method=laplace):

assign(sol):

f:=u->simplify(expand(u(t))): X:=f(x); Y:=f(y); Z:=f(z);

X := -(1/4)*(Omega^4*V0*sin(theta)*cos(alpha)*(sum(exp(_alpha1*t)/((Omega^2+_alpha1^2)*_alpha1), _alpha1 = RootOf(Omega^2+_Z^2)))+cos(alpha)*g*(sum(exp(_alpha1*t)*_alpha1^2/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))-sin(theta)*cos(alpha)*V0*(sum(exp(_alpha1*t)*_alpha1/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))*Omega^2+(-2*Omega^3*cos(theta)*V0+3*cos(alpha)*Omega^2*g)*(sum(exp(_alpha1*t)/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))+4*(Omega^2*t*V0*sin(theta)-(1/2)*Omega^2*t^2*g-g)*cos(alpha))*sin(alpha)/Omega^2

Y := (1/4)*(-V0*cos(theta)*Omega^2+2*cos(alpha)*Omega*g)*(sum(exp(_alpha1*t)/((Omega^2+_alpha1^2)*_alpha1), _alpha1 = RootOf(Omega^2+_Z^2)))-(1/2)*sin(theta)*cos(alpha)*V0*Omega*(sum(exp(_alpha1*t)/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))+(1/4)*V0*cos(theta)*(sum(exp(_alpha1*t)*_alpha1/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))

Z := (1/4)*(-Omega^4*cos(alpha)^2*V0*sin(theta)*(sum(exp(_alpha1*t)/((Omega^2+_alpha1^2)*_alpha1), _alpha1 = RootOf(Omega^2+_Z^2)))-cos(alpha)^2*g*(sum(exp(_alpha1*t)*_alpha1^2/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))+cos(alpha)^2*sin(theta)*V0*(sum(exp(_alpha1*t)*_alpha1/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))*Omega^2+(2*Omega^3*cos(alpha)*cos(theta)*V0-3*Omega^2*g*cos(alpha)^2)*(sum(exp(_alpha1*t)/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))+(-4*Omega^2*t*V0*sin(theta)+2*Omega^2*t^2*g+4*g)*cos(alpha)^2+4*Omega^2*t*V0*sin(theta)-2*Omega^2*t^2*g)/Omega^2

(9)

P:=(u,n)->convert(taylor(u,W=0,n),polynom):

Xexp:=P(X,4); Yexp:=P(Y,4); Zexp:=P(Z,4);  

Error, (in series/sum) unable to compute series

Error, (in series/sum) unable to compute series

Error, (in series/sum) unable to compute series

 

tt:=solve(Zexp=0,t);

tt :=

(10)

 T1:=P(tt[2],1); d[x]:=eval(Xexp,t=T1);  

Error, invalid subscript selector

d[x] := Xexp

 

T2:=P(tt[2],2); d[y]:=P(eval(Yexp,t=T2),2);

Error, invalid subscript selector

d[y] := Yexp

 

d[y]:=collect(d[y],[cos(a),1/g^2,V0^3,W]);

d[y] := Yexp

(11)

parameters:={a=Pi/4,theta=Pi/3,V0=500,W=7.27*10^(-5),g=9.8}:

d[x]:=eval(d[x],evalf(parameters));

d[x] := Xexp

(12)

d[y]:=eval(d[y],evalf(parameters));

d[y] := Yexp

(13)
 

 

Download 05-2-2.mws

Can anyone share additional information about the Maple conference to be held in 2026? I want to submit a talk and then submit a paper to the Maple Transactions journal based on the same.

Can anyone help me?

restart: with(plots):   

h:=0.01: n:=6000: Digits:=18:

t[0]:=0: x[0]:=0.2: y[0]:=0.1: epsilon:=20:

F:=(x,y)->epsilon*(1-x^2)*y-x:

begin:=time():

for k from 0 to n do

t[k+1]:=t[k]+h;

x[k+1]:=x[k]+h*y[k];

y[k+1]:=y[k]+h*F(x[k],y[k]);

pt[k]:=[t[k],x[k],y[k]]:

end do:

cpu_time:=time()-begin;

pointplot3d([seq(pt[j],j=0..n)],axes=normal,symbol=cross,symbolsize=8,color=red,labels=["t","x","y"],orientation=[-90,0]);

sys:=diff(X(t),t)=Y(t),diff(Y(t),t)=F(X(t),Y(t));

vars:={X(t),Y(t)}: ic:=X(0)=0.2,Y(0)=0.1:

sol:=dsolve({sys,ic},vars,numeric,stepsize=h,method=classical[foreuler],output=listprocedure):

odeplot(sol,[t,X(t)],0..h*n,axes=normal,style=line,numpoints=n,labels=["t","x"]);

XX:=eval(X(t),sol): x1:=XX(1);  pt[100];

 

 

Download 09-1-1.mws

I am trying to plot a function where one of the variables is determind via a procedure that uses fsolve and depends on some parameters. When I go to try and make a plot using Explore to vary the parameters I get the following error:
"in fsolve  S  is in the equation, and is not solved for"
My worksheet is seen below:

restart;

 

T := 2^(2/3)*(16*CC(S,mu,Z,Pr)^2*Pi^2 + 2*Pi^2*Z^2 + 16*Pi*S*CC(S,mu,Z,Pr) + 3*S^2)*Pr^(1/3)/(4*(4*CC(S,mu,Z,Pr)*Pi + S)^(2/3)*(2*Pi^2*Z^2 + 4*Pi*S*CC(S,mu,Z,Pr) + S^2)^(2/3)*CC(S,mu,Z,Pr)^(1/3)*Pi^(2/3))

(1/4)*2^(2/3)*(16*CC(S, mu, Z, Pr)^2*Pi^2+2*Pi^2*Z^2+16*Pi*S*CC(S, mu, Z, Pr)+3*S^2)*Pr^(1/3)/((4*CC(S, mu, Z, Pr)*Pi+S)^(2/3)*(2*Pi^2*Z^2+4*Pi*S*CC(S, mu, Z, Pr)+S^2)^(2/3)*CC(S, mu, Z, Pr)^(1/3)*Pi^(2/3))

(1)

 

mu = 2^(2/3)*S*(16*C^2*Pi^2 - 2*Pi^2*Z^2 - S^2)*Pr^(1/3)/(4*(4*C*Pi + S)^(2/3)*(2*Pi^2*Z^2 + 4*C*Pi*S + S^2)^(2/3)*C^(4/3)*Pi^(2/3))

mu = (1/4)*2^(2/3)*S*(16*C^2*Pi^2-2*Pi^2*Z^2-S^2)*Pr^(1/3)/((4*C*Pi+S)^(2/3)*(2*Pi^2*Z^2+4*C*Pi*S+S^2)^(2/3)*C^(4/3)*Pi^(2/3))

(2)

CC:=proc(S,mu,Z,Pr)
fsolve((2),C,C=0.01..100)
end proc;

proc (S, mu, Z, Pr) fsolve(mu = (1/4)*2^(2/3)*S*(16*C^2*Pi^2-2*Pi^2*Z^2-S^2)*Pr^(1/3)/((4*C*Pi+S)^(2/3)*(2*Pi^2*Z^2+4*C*Pi*S+S^2)^(2/3)*C^(4/3)*Pi^(2/3)), C, C = 0.1e-1 .. 100) end proc

(3)

CC(1,0,0.5,0.2)

.1938622552

(4)

Explore(plot(T,0..15),parameters=[[mu=0 .. 1,minorticks=0.25],[Z=0..0.5,minorticks=0.1],[Pr=0..1,minorticks=0.25]])


When I try to move the sliders on my parameters this is where I get the error. I want to plot over S, but I can only get CC once I have all the other values including S. I assume it has something to do with the fact that my plotting variable is in the procedure?

Any help would be greatly appreciated, thanks. 

Download Explore_Plot_Problem.mw

A note on what I've been working on for the past while. Some of you may have seen the announcement on LinkedIn yesterday; this is for the home audience.

The question I've been chasing is the one that's underneath the Physics package, the dsolve / pdsolve formal methods and heuristics, the advanced Mathematical Functions and FunctionAdvisor, and most of what I've written for Maple over the years. How can mathematicians and physicists speed up significantly their work using Computer Algebra Systems (CAS) and at the same time trust the result a computer hands back? The new chapter is what happens when AI sits between the human and the CAS, and the answer to that, in my view, turns out to be a much harder problem than the AI hype suggests.

Why? Because AI is increasingly the driver of computational mathematics in research, engineering, and education. And the unsolved problem isn't whether AI can do mathematics. It can. The problem is that an incorrect AI result arrives with the same confidence as a correct one.

On 100 challenging problems of undergraduate mathematics we tested, six independent state-of-the-art AIs returned mathematically equivalent answers on only 21% of them, and even within a single AI, repeated runs disagreed with themselves on 3% to 57% of the problems (details). The gap this validation crosses, between probabilistic inference and certified mathematical computation, is epistemological, not technological. It won't close with more training data. It needs validation across multiple AIs and multiple CAS, with no single engine having the final word.

ExaktAI aims to address that gap. It guides AI through mathematical computation, validates each step against Maple and Mathematica, and automatically generates and opens a corresponding CAS document where the validation can be audited and reproduced for every step, and where one can continue working on the problem. The goal: AI-mathematics that is validated, with the human in the loop.

ExaktAI is now well developed (TRL 6: System prototype demonstration in a simulated environment, on the ISED / Innovative Solutions Canada TRL scale). At the end an image. A Beta is scheduled for late summer / fall 2026; details at exaktai.ai.

In summary: ExaktAI is my present, and if you work on AI for mathematics and computer algebra, or the validation problem for AI, I'd love to hear your perspective.



Edgardo S. Cheb-Terrab
ExaktAI
Research Fellow Emeritus at Maplesoft.

1 2 3 4 5 6 7 Last Page 1 of 2253