What is the correct way to write the explicit solution before calling odetest to verify it on an ode? is it

   sol:= y(x)= the RHS  (1)

or

   sol:= y(x) - the RHS = 0 (2)

I am asking because Maple sometimes gives very different result from odetest depending on which form the explicit solution is written. It is very hard to keep trying different forms each time.  Here is an example below.

Maple 2022.1 on windows 10.   Is this a bug? I do not think it should  make a difference, but it does and I have no idea why. Is there an option or way to make sure the same result is obtained each time regardless how the explicit soltion is written?

I have a theory as to why this might happen: When using (1) odetest sees y(x) on the LHS on its own, and then uses odetest  code internally designed for explicit solution testing.

When using (2), it sees y(x) not on its own on the LHS and it assumes this is then an implicit solution and uses odetest code internally meant for implicit solution testing, hence the difference in output.
 

Download why_different_result.mw

Any way to write a function to get a RandomPlanar connected graph

That I have function say RandomPlanar(n,m) where n is the number of vertices and m is optional parameter and is the number of edges 

How to find if all the rows in a matrix are unique and return true if unique and false if not

That is their are no duplicate rows 

Also without another post 

If given two matricies A and B how to find if they are same like what i mean is as equal here is

A and B have the same rows but they may be in rows can be jumbled imples

A:=Matrix(3, 3, [[1, 2, 3], [3, 2, 1], [4, 6, 5]])

B:=Matrix(3, 3, [[3, 2, 1], [1, 2, 3], [4, 6, 5]])

They have the same rows exactly but in jumbled order then I say they are equal then return true. 

That is i have function RowEqual(A,B) gives TRUE if same by above condition and FALSE is not

Maple 2021.
I expect after exporting to pdf view of page with plot like on fig. 1.

It means with font=[TIMES, ROMAN, 12] as in maine text.
But I obtaned this view of page on pdf (fig. 2) with smaller font-size.

In previouse versions there are no the problem like this.
Dear community, how to fix this annoying inconvenience?

 fig. 1.  fig. 2.

What I want to achieve with a command is the following image, in which the elements of a matrix that are not zero are displayed in black

This can be accomplished with the Browse Matrix Dialouge, but I want to make such images part of the worksheet. (Display of the full matrix is important.)
Context: Re-execution of worksheets will allow for quick verification of changes in Jacobians.

I have a closed curve(parameterized by t) with self intersection and I'd like to locate the x-y coordinates of the intersection. fslolve only returns 1 intersection. I've tried to use a finite step method but it is way to slow even with rough stepping and becomes very inaccurate. Does maple have anything built in to handle this?

A python program will output several  adjacency matricies which is to be given as a input to a maplesoft code by writing it to some some kind of  file or so with a sample.

The python file will generate several adjacency matrices need to send it as a input to my maple code

With a small sample codes with interface please.

The help will be surely acknowledged

Hi,

Is there a way to symbolically evaluate this integral?

int(sin(sqrt(-x^2 + 1)), x);

I want to write a program for the time fractional thin film equation to be converted into an ordinary differential equation.

With respect

Any one has a trick to show in Maple that  x + sqrt(-2 + 2*sqrt(4*x^2 + 1))*sqrt(2 + 2*sqrt(4*x^2 + 1))/4; is zero for x<=0?

I'd like to get similar simplication as this below but in Maple, But everything I tried so far did not work. I am sure there is a way in Maple, but have not found it yet.

Below is the Maple worksheet

Download show_it_is_zero.mw

how can i plot this complex expression with polar plot and 3d complex plot? i want both 2d polar form and 3d plot of this.
thnx for the help

Download complexplot.mw

I want to find the relation between w and k by putting Determinant(A) is equal to zero. Since the determinant is large (A is a matrix of size 6x6) and I am not able to find the simplified expression. How to do that?

determinant.mw

Hi,

I use Maple version 2022.1 on macOS 10.14.6.

I have big problems with the parabolic groups in the "LieAlgebra" package.

First of all in the help for "Query > Parabolic", the link refers to the help page for the commands "CylinderU, CylinderV, CylinderD" which have nothing to do with it. Also, the command "Query(Alg, "Parabolic")" does not work.

Below is a list of commands that give an error for "Query".

restart:with(LinearAlgebra):with(DifferentialGeometry):with(LieAlgebras):

L:=[
Matrix(5, 5, [[0, 0, 1, 1, 1], [0, 0, 0, 0, 0], [-1, 0, 0, 0, 0], [-1, 0, 0, 0, 0], [-1, 0, 0, 0, 0]]), 
Matrix(5, 5, [[0, 1, 0, 1, 1], [-1, 0, 0, 0, 0], [0, 0, 0, 0, 0], [-1, 0, 0, 0, 0], [-1, 0, 0, 0, 0]]), 
Matrix(5, 5, [[0, 1, 1, 0, 1], [-1, 0, 0, 0, 0], [-1, 0, 0, 0, 0], [0, 0, 0, 0, 0], [-1, 0, 0, 0, 0]]), 
Matrix(5, 5, [[0, 1, 1, 1, 0], [-1, 0, 0, 0, 0], [-1, 0, 0, 0, 0], [-1, 0, 0, 0, 0], [0, 0, 0, 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 0, 1, 1], [0, 0, 0, 0, 0], [0, -1, 0, 0, 0], [0, -1, 0, 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 1, 0, 1], [0, -1, 0, 0, 0], [0, 0, 0, 0, 0], [0, -1, 0, 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 1, 1, 0], [0, -1, 0, 0, 0], [0, -1, 0, 0, 0], [0, 0, 0, 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, -1, 0, 0], [0, 1, 0, 0, 1], [0, 0, 0, 0, 0], [0, 0, -1, 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, -1, 0, 0], [0, 1, 0, 1, 0], [0, 0, -1, 0, 0], [0, 0, 0, 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 0, -1, 0], [0, 0, 0, -1, 0], [0, 1, 1, 0, 0], [0, 0, 0, 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 1, 1], [0, 0, -1, 0, 0], [0, 0, -1, 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, -1, 0], [0, 0, 1, 0, 1], [0, 0, 0, -1, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, -1], [0, 0, 0, 0, -1], [0, 0, 1, 1, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 0, -1, 0], [0, 0, 0, 0, 0], [0, 1, 0, 0, 1], [0, 0, 0, -1, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 0, 0, -1], [0, 0, 0, 0, 0], [0, 0, 0, 0, -1], [0, 1, 0, 1, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 0, 0, -1], [0, 0, 0, 0, -1], [0, 0, 0, 0, 0], [0, 1, 1, 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, -1/2*sqrt(2), -1/2*sqrt(2), -1/2*sqrt(2)], [0, 1/2*sqrt(2), 0, 0, 0], [0, 1/2*sqrt(2), 0, 0, 0], [0, 1/2*sqrt(2), 0, 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 1/2*sqrt(6), 1/6*sqrt(6), 1/6*sqrt(6)], [0, -1/2*sqrt(6), 0, -1/3*sqrt(6), -1/3*sqrt(6)], [0, -1/6*sqrt(6), 1/3*sqrt(6), 0, 0], [0, -1/6*sqrt(6), 1/3*sqrt(6), 0, 0]]), 
Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 0, 2/3*sqrt(3), 1/6*sqrt(3)], [0, 0, 0, 2/3*sqrt(3), 1/6*sqrt(3)], [0, -2/3*sqrt(3), -2/3*sqrt(3), 0, -1/2*sqrt(3)], [0, -1/6*sqrt(3), -1/6*sqrt(3), 1/2*sqrt(3), 0]]), Matrix(5, 5, [[0, 0, 0, 0, 0], [0, 0, 0, 0, 1/2*sqrt(5)], [0, 0, 0, 0, 1/2*sqrt(5)], [0, 0, 0, 0, 1/2*sqrt(5)], [0, -1/2*sqrt(5), -1/2*sqrt(5), -1/2*sqrt(5), 0]])];

LieP:=LieAlgebraData(L,Alg):
DGsetup(LieP);
Query(Alg,"Parabolic");

Let G(V,E)  be a graph

 Step 1 : Choose the subsets S of the V of size k and LABEL it with the say "1"

Step 2: LABEL all the neighbours of the vertices of S with "1"

Step 3: Now LABEL "1" all the UNLABELED neighbours of the previously LABELED veritices only if its neighbours are all LABELED already

Step 4: IF atleast one vertex is LABELED in step 3 then repeat step 3   ELSE  If all vertices are already LABELED with "1" goto step 5 ELSE if some of the VERTICES are still not LABELED we reject this set GOTO step 6

Step 5: append the the the set S into the list 

Step 6: Remove all the perivious labels choose a new set of size k from S label its vertices with "1" and goto step 2  if all all sets of size k have already been choosen we end and print the list.

That is we a Function F(Graph::G,k)     the function which does the above so that it can be called with parameter when required for any graph G

I am going to try too but i am not that great at coding I have desinged the algorithm need help if possible kind help

I will also be trying 

I apologize to distrub all in your busy schedule.

Your work will be surely acknowledged 

First_sample_1.mw

https://www.mapleprimes.com/questions/234533-How-To-Relabel-Only-A-Subset-Of-Vertex-Of-G#comment287899

Some part in above link

In code attached 

I would like to 

I have to on say L list.

And I have done steps at the top in that code

After the above code I have attached steps

"Find the vertices with the condition that if  all its neighbors are labeled as character (FIND(G)) then label those vertices  also as `character"`  then add those vertices also to  L1 list"  then Need to be do again and again on the same graph with new labels G

If no such vertex exits and NumberOfVertices(G) not equal to numelems(L1) then i have to break out of the loop.

or 

if NumberOfVertices(G)=numelems(L1) then I print That list or store it some where

Please pardon me if my english is bad.

KInd help it will help me a lot and it will surely be acknowledged kind help.

The algorithm all told above kind help please please

The help will be surely acknowledged