Maple Questions and Posts

These are Posts and Questions associated with the product, Maple

Switching font to Arial apparently makes the sign disappear in MathContainers.

Vorzeichen.mw

If i want to do mathematical modelling for planetary motion, how can maple help me with it?

 I want to plot phase portrait but i get some errors. I didn't understand errors? Can anyone help me? zuhal_faz_portresi.mw

Dear power users, I probably have 2 dummy questions, which I show in the attached worksheet. 

1. it looks to me that the equation can be further simplified than done by maple

2. is there a quick way in cleaning up the array by replacing the strings by something as NaN (not a number) so that I can use the array for numeric calculations?

Thank you for helping me out     Download Questions.mw

simplify((x^2-2)/(x-sqrt(2)))

(x^2-2)/(x-2^(1/2))

(1)

why is the above not simplifying to x+sqrt(2)

x+2^(1/2)

(2)

``

How can I replace the strings in the matrix below by something like NaN (not a number) so I can use it for further numeric calculations?

 

Error, invalid assignment

"dat:=[[124.0,124.0,22.0,2.2],[130.0,160.0,20.0,4.4],[130.0,129.0,26.0,4.3],[119.0,115.0,21.0,">2,6"],[136.0,129.0,30.0,4.9],[118.0,126.0,24.0,2.9],["NA / 101",115.0,20.0,3.0],[130.0,118.0,21.0,2.4],[95.0,94.0,25.0,3.4]]"

 

``

Download Questions.mw

As we know, since the order about the element Perm([[1, 2], [3, 4, 5]]) of S5 is 6. Then  the C6 is a subgroup of S5, but why IsSubgroup(CyclicGroup(6), SymmetricGroup(5)) return false? Is it a bug?

Of course, we know the A5 of 60 order is an unsolvable group, but as the wiki here, There are also some solvable groups in the same 60 order. Similarly, although map(IsSolubleNumber, [60, 120, 168, 180]) will give false, there are some solvable groups in orders 60, 120, order 168, and order 180. But how to find these corresponding solvable polynomials by maple? I tried to generate them using random polynomials like this:

with(GroupTheory);
do
    do poly := randpoly(x, degree = rand(6 .. 8)()); until irreduc(poly);
    G := GaloisGroup(poly, x);
until IsSoluble(G) and is(GroupOrder(G) in {60, 120, 168, 180});
poly;
galois(poly, x);

But I didn't get any result even after one night..

We are holding another Maple Conference this year, and I am pleased to announce that we have just opened the Call for Participation!

This year’s conference will be held Nov. 2 – Nov. 3, 2022. It will be a free virtual event again this year, and it will be an excellent opportunity to meet other members of the Maple community and share your work.

We are inviting submissions of presentation proposals on a range of topics related to Maple, including Maple in education, algorithms and software, and applications. We also encourage submission of proposals related to Maple Learn. This year, we are not requiring recorded videos, and we hope to see more interaction between presenters and audience members in our live sessions.

You can find more information about the themes of the conference and how to submit a presentation proposal at the Call for Participation page. Proposals are due July 18, 2022.

Presenters will have the option to submit papers and articles to a special Maple Conference issue of the Maple Transactions journal after the conference.

Registration for attending the conference will open in June. We will also be featuring an art gallery again at the conference. Watch for further announcements in the coming weeks.

I sincerely hope that all of you here in the Maple Primes community will consider joining us for this event, whether as a presenter or attendee!

Hi folks

If you try this simple integral 

simplify(int(P(q)*(Dirac(k-q)+ Heaviside(k-q)),q = 0..infinity)) assuming k>0; 

it returns int(P(q), q = 0 .. k), completely ignoring the delta function. However, if you expand the integral first:

simplify(value(IntegrationTools[Expand](Int(P(q)*(Dirac(k-q)+ Heaviside(k-q)),q = 0..infinity)))) assuming k>0;

 it gives the correct answer 

P(k) + int(P(q), q = 0 .. k)

Looks like a bug to me?

Cheers!

I've been asking a similar question:

How does Maple call external programs such as nauty?

Recently I used Mathematica to call these gadgets very succinctly, so I revisit the topic, and maybe Maple can do it as well, but I just didn't do it the right way.

  • nauty and Traces are programs for computing automorphism groups of graphs and digraphs. There is a small suite of programs called gtools included in the package. For example, geng can generate non-isomorphic graphs very quickly. 
  • plantri and fullgen are programs for generation of certain types of planar graph.

We note that binary executables of above two programs for Windows are not officially available. Fortunately, I recently compiled them by cygwin.  Of course, other operating systems can make it easier to use them. See attached two compressed files of compiled nauty and plantri programs for Windows.

The official websites of the two programs are listed below.

So, I found that Mathematica works very well for running these programs by Import. We list the following two examples: first example is to get all non-isomorphic 10-order 2-partite connected graph, and the second example is to get all 14-order non-isomorphic  quadrilateral graphs (the planar graphs in which any face is 4-face).

glist10 = Import["!D:/nauty27r3/geng -c -b 10", "Graph6"]; // AbsoluteTiming
Length[glist10]

g14 = Import["!D:/plantri52/plantri 14 -q -g ", "Graph6"] // AbsoluteTiming

 

I tried maple's Import or ImportGraph functions, but both failed.

restart: 
with(GraphTheory):
L:=ImportGraph("!D:/nauty27r3/geng -c -b 10 -g",output=list):
L2:=Import("!D:/nauty27r3/geng -c -b 10 -g"):

Error, invalid input: GraphTheory:-ImportGraph uses a 2nd argument, format (of type {string, symbol}), which is missing
Error, (in Import) must specify format for this input

The problem seems to be not recognizing compilations symbols " !".  I don't know if Maple can do this like mathematica.

Dear all

I need to  `Put markers to emphasize the point of intersection between f, and g

iteration.mw

thank you

Given a polynomial, e.g. 3*x^2 + a*x*y + b*y^2, is there some built-in function which can give me a list of monomials, with each monomial represented as [coefficient, [exponent_of_x, exponent_of_y]] ? The above polynomial would turn into something like [ [3, [2,0]], [a, [1,1]], [b, [0,2]] ].

It's not difficult to write this procedure from scratch. The procedure would require two arguments: (1) the polynomial itself, (2) which symbols are considered variables (in the above case, x and y). The remaining variables, a and b, would then be treated as constants that appear as coefficients. But I'm wondering if there's a built-in function I can just use.

Hi everyone, Could you help me to get a general solution to the following ode? Here rho and z are constants.

ODE := cos(g(t))^2*(diff(T(t), t, t))-3*rho*(diff(g(t), t))*cos(g(t))*sin(g(t))*(diff(T(t), t))+(Omega^2*cos(g(t))^z-8*rho^2*(diff(g(t), t))^2*sin(g(t))^2+2*sin(g(t))*cos(g(t))*(diff(g(t), t, t))*rho+2*(cos(g(t))^2)(diff(g(t), t))^2*rho+2*rho*(diff(g(t), t))^2*sin(g(t))^2)*T(t) = 0

cos(g(t))^2*(diff(diff(T(t), t), t))-3*rho*(diff(g(t), t))*cos(g(t))*sin(g(t))*(diff(T(t), t))+(Omega^2*cos(g(t))^z-8*rho^2*(diff(g(t), t))^2*sin(g(t))^2+2*sin(g(t))*cos(g(t))*(diff(diff(g(t), t), t))*rho+2*(cos(g(t)))(diff(g(t), t))^4*rho+2*rho*(diff(g(t), t))^2*sin(g(t))^2)*T(t) = 0

(1)

dsolve(ODE, T(t))

T(t) = DESol({-(-Omega^2*cos(g(t))^z+8*rho^2*(diff(g(t), t))^2*sin(g(t))^2-2*sin(g(t))*cos(g(t))*(diff(diff(g(t), t), t))*rho-2*(cos(g(t)))(diff(g(t), t))^4*rho-2*rho*(diff(g(t), t))^2*sin(g(t))^2)*_Y(t)/cos(g(t))^2-3*rho*(diff(g(t), t))*sin(g(t))*(diff(_Y(t), t))/cos(g(t))+diff(diff(_Y(t), t), t)}, {_Y(t)})

(2)

NULL


Thanks.

Download ode_rlmt.mw

Does maple software support Benders decomposition technique for Mixed Integer Linear Programming? If no, how we can implement it in maple? Any suggestions. 

Thank you

x := [0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4]

y := [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4]
z := [0, 0, 0, 0, 0, 0, .689376362, 1.378752724, 2.068129087, 2.757505449, 0, 1.02920355, 2.0584071, 3.087610649, 4.116814199, 0, 1.216469264, 2.432938529, 3.649407793, 4.865877057, 0, 1.325720912, 2.651441823, 3.977162735, 5.302883646]

How to plot the contour plot for the given data

Dear Users! Hope everyone is fine here. I have some points x_0,x_1,..,x_N and corresponding to these number have values y_0, _1, ..., y_N as,

restart
a := 1; b := 5; h := 1; f := 1/x; N := (b-a)/h;
for i from 0 while i <= N do x[i] := h*i+a; y[i] := eval(f, x = x[i]) end do;

Now I want to develope the following difference table using the values of y_0, y_1, ..., y_N as,

where difference column generated using the following concept

Please help me in this regard. Thanks in advance

First 9 10 11 12 13 14 15 Last Page 11 of 1922