MaplePrimes Questions

Where to store a collection of 100 matrices of different orders in Python language.

Then I need to pass that file as input to Maple for so kind of analysis here.

If possible an example with 3 to 4 matrices in python stored in some file I don't know which will be good and how say excel or database or any other (This only mainly I am not getting any idea)

Then the maple program here takes that file as input and does calculations here in maple 

Say as example Eigen values of those matrices

Here my matrices are all square matrices of various different orders

This code can draw the subgroup lattice:

DrawSubgroupLattice(GaloisGroup(x^3 - 2, x), 'indices')

But I really want to know what the extension of field about each subgroup corresponds to, like this:

The root of the polynomial r1=21/3, r2=21/3(-1+sqrt(3) I)/2, r2=21/3(-1-sqrt(3) I)/2 in the above graph. Further, how do we draw the extension relation of this polynomial:

x5+15x+44

The maple can draw this graph? If maple can't draw it, what software can?

SS.mw

How to rectify this error,I want a downfall curve ,Please help.

indets(I, anything^Non(integer)) = {I};

How does one return this to proper form?

 

restart;

q := (u,v) -> u^2 + v^2;

proc (u, v) options operator, arrow; v^2+u^2 end proc

D[3](q);

Error, (in D/procedure) index out of range: function takes only 2 arguments

Question: How does D know that q takes two arguments?

In general, if I pass q to another proc, how can I find out, within
that proc, that q takes only two arguments?

download number-of-arguments.mw

Dear,

I would like to do equation of motion calculations using spin matrices.

I would like to do calculations using the  coupling.

Thanks for listening.

Given a vector-valued function z(u,v), I want to calculate the derivative of z with respect to its first argument by applying the D operator to it. I don't see how.  Any suggestions?

restart;

z := (u,v) -> < a(u,v), b(u,v) >;

proc (u, v) options operator, arrow; `<,>`(a(u, v), b(u, v)) end proc

Calculate the derivative of z with respect to its first argument:

P := diff(z(u,v), u);

Vector(2, {(1) = diff(a(u, v), u), (2) = diff(b(u, v), u)})

Express P through the D operator:

Q := convert(P, D);

Vector(2, {(1) = (D[1](a))(u, v), (2) = (D[1](b))(u, v)})

Question:  How do we obtain Q directly by applying the D operator to z

without the help of diff?  This one doesn't work:

D[1](z)(u,v);
type(%, Vector);

(D[1](`<,>`))(a(u, v), b(u, v))*(D[1](a))(u, v)+(D[2](`<,>`))(a(u, v), b(u, v))*(D[1](b))(u, v)

false

Download diff.mw

restart;
with(Physics[Vectors]);
Setup(mathematicalnotation = true);
with(Physics);

Setup(op = {Omega, r});

lprint(m*Omega^2*r);

which outputs this:

i want to substitute  Physics:-`*` which is an overloaded version of matrice multiplication with the default one which is `.` so I wrote the following code :

use   `*`= :-`.` in
a := m*Omega^2*r
end use

the result is the same and its not substitute the physics product with the default one. what is the mistake here?

I also tried the following code and its worked. but I want to make it work with the 'use' function for general purposes

lprint(m . (:-`.`(Omega^2, r)))

thanks in advance

How do I draw this polyhedron knowing all vertices?
https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_21?fbclid=IwAR2bdHwJEpjarZEwope1hYOcnnXqnvzae38Y8ZrfWKCKQunfAuT9s30q32o

[[-1.5, -0.5, 0.], [-1.5, 0.5, 0.], [-1., -1., -0.707107], [-1., 1., -0.707107], [-0.5, -1.5, 0.], [-0.5, -0.5, -1.41421], [-0.5, 0.5, -1.41421], [-0.5, 1.5, 0.], [0.5, -1.5, 0.], [0.5, -0.5, -1.41421], [0.5, 0.5, -1.41421], [0.5, 1.5, 0.], [1., -1., -0.707107], [1., 1., -0.707107], [1.5, -0.5, 0.], [1.5, 0.5, 0.]]

 

I want to write a program in differential geometry that get g as a metric matrix then calculate christoffel.

Thank you for your consideration.

I'm trying to use Maple to take the following integral for positive values of a, b, c and non-negative integers i and j.

I know that for fixed values of j and k this doable — for example, for j=k=0 Mathematica gives

I'm trying the following code in Maple:

int(exp(-(x + y)/2)/(a*x + b*y + c), [x = 0 .. infinity, y = 0 .. infinity]) assuming (a::real, 0 < a, b::real, 0 < b, c::real, 0 < c)

Am I doing anything wrong?

This is probably trivial but I can't find how to display and allow user input of numeric values in a table.  There doesn't appear to be a component for this and I can't find a way to make text areas work for numeric values.  I am sure I must be overlooking something very simple but I checked the documentation and googled and still can't find the answer.

Hi dears

I have a pde system and want to get the solution of this system step by step. is there any command or bunch of commands that could help me?

(pde = partial differential equations)

My document contained an inline plot component named Plot0 and was referenced in the following code

DocumentTools:-SetProperty("Plot0", value, calculatePlot())

This worked as expected. I selected and cut the plot and pasted it into a cell in a table.  Now the same line of code generates this error

Error, (in DocumentTools:-GetProperty) Attempted to retrieve property of unknown component Plot0.

The plot has presumably changed name but I can't find its new name.  I have tried changing the code to refer to Plot1 instead of Plot0 but the error persists.  I am completely mystified.

An edge cut is a set of edges that, if removed from a connected graph, will disconnect the graph.

A minimal edge cut is an edge cut such that if any edge is put back in the graph, the graph will be reconnected.

A minimum edge cut is an edge cut such that there is no other edge cut containing fewer edges.

Note that a minimum edge cut is always minimal, but a minimal edge cut is not always minimum. 

For example: 

Fig. 1 shows the original graph.

Fig. 2 shows a minimum (and therefore minimal) edge cut.

Fig. 3 shows a minimal edge cut (which is not minimum).

 

 

I'd like to find all (not one) minimal edge cuts of the following graph G.

g:= "S~tIID@OI?{@n~V?goYEDOWd?qI?sJ?[C";
G := GraphTheory:-ConvertGraph(g);
GraphTheory:-DrawGraph(G)

How to find its all minimal edge cuts? I have searched Literature [1] for the corresponding polynomial algorithm (which you can view). But I don't see any code implementation. 

For the above graph (with 20 vertices and 72 edges), perhaps a violent search would be possible.

[1] Karzanov, A.V., Timofeev, E.A. Efficient algorithm for finding all minimal edge cuts of a nonoriented graph. Cybern Syst Anal 22, 156–162 (1986). https://doi.org/10.1007/BF01074775

First 246 247 248 249 250 251 252 Last Page 248 of 2427