Hello ,

I need your helps to solve this integrale

Thank you
 

Download Intégrale.mw

Good day, I have an assignment in which I'm required to plot the solid that results from the cone (x^2+y^2-z^2=0), limited by the planes z=0 and x+2z=3. So far I've been trying to use plot3d and implicitplot3d, to no avail: the parametric expression from plot3d returns something quite different from the intented, and implicitplot3d won't allow the use of variable parameters.

Any ideas on how to solve this?

Hi everyone, I've just learnt some basic tools and I need your help. 

Dear Sir,

I have a problem with the command. In order to learn the use of this command for Feynman Diagrams, I loaded the help page [Physics,FeynmanDiagrams], I tried the given example  by accurately applying the indicated commands, i.e.

after setting Physics[Setup](mathematicalnotation = true);

"Coordinates(X, Y, Z)", next the Langrangian example  "L := lambda*phi(X)^4+sigma*eta(X)^3", then the command

"FeynmanDiagrams(L)".

The error maessage is :

"Error, unexpected result from Typesetting" ,and also "

"Error, unexpected result from Typesetting".

Note these errors appear also in the help page itself.

When I click on the link included in the error message, I go on a web page indicating "There is no help page available for this error", and they recommend to discuss my problem with Maple experts on MaplePrimes.

I sew that _NP represent the normal product of fields.

Could you say me, please, where is the error ?

Many thanks

  JLPaillet

I am new to Maple. I am trying to numerically evaluate the following function with respect to the 3 variables "xop", "yop", and "tp". All other variables appearing in the function f are known (i.e. "x", "y", "z", "Pe", also "Pi" is the constant 3.1415...). "f" is shown below:

f := exp(-1/2*(xop^2+yop^2))*exp(-((x-xop-2*Pe*(t-tp))^2+(y-yop)^2+z^2)/(4*(t-tp)))/((4*Pi^(3/2))*(t-tp)^(3/2))

I am then defining "deltaT" as equal to the triple integral below:

deltaT := int(f, [yop = -(-xop^2+1)^(1/2) .. (-xop^2+1)^(1/2), xop = -1 .. 1, tp = 0 .. t])

When I try to evaluate this, Maple spits out an incredibly long answer full of variables and error functions:

deltaT := -0.7957747155e-1*(int(sqrt(5.-1.*tp)*(int(exp((0.5000000000e-2*(-200.*tp^2*xop^2+40000.*tp^3-4000.*tp^2*xop+2200.*tp*xop^2-617200.*tp^2+41860.*tp*xop-6050.*xop^2+3.170694*10^6*tp-109230.*xop-5.423499*10^6))/((-11.+2.*tp)*(-5.+tp)))*(erf((.1000000000*(10.*sqrt(-1.*xop^2+1.)*tp-55.*sqrt(-1.*xop^2+1.)-3.))/(sqrt(11.-2.*tp)*sqrt(5.-1.*tp)))+erf((.1000000000*(10.*sqrt(-1.*xop^2+1.)*tp-55.*sqrt(-1.*xop^2+1.)+3.))/(sqrt(11.-2.*tp)*sqrt(5.-1.*tp)))), xop = -1 .. 1))/((5-tp)^(3/2)*sqrt(11.-2.*tp)), tp = 0 .. 5))

Any help on figuring out why it is unable to numerically evaluate would be appriciated!

Thanks.

Hello all,

I would like to know how to make computations on Quantum Field Theory questions.

For example: to write Feynman diagrams for some interactions, obtain the S matrix of scattering amplitude, then deduce the diffrential cross section.

If anyone is working on these issues in the Maple community, I would be very interested.

Best regards

Jean-Luc Paillet

Hello all

when i tried to use the library "with(VLA)" i always have this problem :

 with(VLA);
Error, invalid input: with expects its 1st argument, pname, to be of type {`module`, package}, but received LA
 

but i have sow in many videos that its working and they applied it in same way.

any help please > >  

Hello dear!

I want to find the vector field of a vector field my approch is below:

with(VectorCalculus);
SetCoordinates(cartesian[x, y, z]);
V := VectorField(<(u(x, y, z), v(x, y, z), w(x, y, z))>);
Gradient(V);

I want answer as bellow:

Matrix(3, 3, {(1, 1) = Diff(u, x), (1, 2) = Diff(u, y), (1, 3) = Diff(u, z), (2, 1) = Diff(v, x), (2, 2) = Diff(v, y), (2, 3) = Diff(v, z), (3, 1) = Diff(w, x), (3, 2) = Diff(w, y), (3, 3) = Diff(w, z)});

Please help me to fix this problem. I am waiting the quick answer.

THANKS in advance

 I accidentally stumbled on this problem in the list of tasks for mathematical olympiads. I quote its text in Russian-English translation:

"The floor in the drawing room of Baron Munchausen is paved with the identical square stone plates.
 Baron claims that his new carpet (made of one piece of a material ) covers exactly 24 plates and
 at the same time each vertical and each horizontal row of plates in the living room contains 
exactly 4 plates covered with carpet. Is not the Baron deceiving?"

At first glance this seems impossible, but in fact the Baron is right. Several examples can be obtained simply by hand, for example

                                        or        

The problem is to find all solutions. This post is dedicated to this problem.

We put in correspondence to each such carpet a matrix of zeros and ones, such that in each row and in each column there are exactly 2 zeros and 4 ones. The problem to generate all such the matrices was already discussed here and Carl found a very effective solution. I propose another solution (based on the method of branches and boundaries), it is less effective, but more universal. I've used this method several times, for example here and here.
There will be a lot of such matrices (total 67950), so we will impose natural limitations. We require that the carpet be a simply connected set that has as its boundary a simple polygon (non-self-intersecting).

Below we give a complete solution to the problem.

restart;
R:=combinat:-permute([0,0,1,1,1,1]); # All lists of two zeros and four units

# In the procedure OneStep, the matrices are presented as lists of lists. The procedure adds one row to each matrix so that in each column there are no more than 2 zeros and not more than 4 ones

OneStep:=proc(L::listlist)
local m, k, l, r, a, L1;
m:=nops(L[1]); k:=0;
for l in L do
for r in R do
a:=[op(l),r];
if `and`(seq(add(a[..,j])<=4, j=1..6)) and `and`(seq(m-add(a[..,j])<=2, j=1..6)) then k:=k+1; L1[k]:=a fi;
od; od;
convert(L1, list);
end proc:

# M is a list of all matrices, each of which has exactly 2 zeros and 4 units in each row and column

L:=map(t->[t], R):
M:=(OneStep@@5)(L):
nops(M);
                                            67950

M1:=map(Matrix, M):

# From the list of M1 we delete those matrices that contain <1,0;0,1> and <0,1;1,0> submatrices. This means that the boundaries of the corresponding carpets will be simple non-self-intersecting curves

k:=0:
for m in M1 do
s:=1;
for i from 2 to 6 do
for j from 2 to 6 do
if (m[i,j]=0 and m[i-1,j-1]=0 and m[i,j-1]=1 and m[i-1,j]=1) or (m[i,j]=1 and m[i-1,j-1]=1 and m[i,j-1]=0 and m[i-1,j]=0) then s:=0; break fi;
od: if s=0 then break fi; od:
if s=1 then k:=k+1; M2[k]:=m fi;
od:
M2:=convert(M2, list):
nops(M2);
                                             394

# We find the list T of all segments from which the boundary consists

T:='T':
n:=0:
for m in M2 do
k:=0: S:='S':
for i from 1 to 6 do
for j from 1 to 6 do
if m[i,j]=1 then
if j=1 or (j>1 and m[i,j-1]=0) then k:=k+1; S[k]:={[j-1/2,7-i-1/2],[j-1/2,7-i+1/2]} fi;
if i=1 or (i>1 and m[i-1,j]=0) then k:=k+1; S[k]:={[j-1/2,7-i+1/2],[j+1/2,7-i+1/2]} fi;
if j=6 or (j<6 and m[i,j+1]=0) then k:=k+1; S[k]:={[j+1/2,7-i+1/2],[j+1/2,7-i-1/2]} fi;
if i=6 or (i<6 and m[i+1,j]=0) then k:=k+1; S[k]:={[j+1/2,7-i-1/2],[j-1/2,7-i-1/2]} fi; 
fi;
od: od:
n:=n+1; T[n]:=[m,convert(S,set)];
od:
T:=convert(T, list):

# Choose carpets with a connected border

C:='C': k:=0:
for t in T do
a:=t[2]; v:=op~(a);
G:=GraphTheory:-Graph([$1..nops(v)], subs([seq(v[i]=i,i=1..nops(v))],a));
if GraphTheory:-IsConnected(G) then k:=k+1; C[k]:=t fi;
od:
C:=convert(C,list):
nops(C);
                                               208

# Sort the list of border segments so that they go one by one and form a polygon

k:=0: P:='P':
for c in C do
a:=c[2]: v:=op~(a);
G1:=GraphTheory:-Graph([$1..nops(v)], subs([seq(v[i]=i,i=1..nops(v))],a));
GraphTheory:-IsEulerian(G1,'U');
U; s:=[op(U)];
k:=k+1; P[k]:=[seq(v[i],i=s[1..-2])];
od:
P:=convert(P, list):

# We apply AreIsometric procedure from here to remove solutions that coincide under a rotation or reflection

P1:=[ListTools:-Categorize( AreIsometric, P)]:
nops(P1);
                                                 28

We get 28 unique solutions to this problem.

Visualization of all these solutions:

interface(rtablesize=100):
E1:=seq(plottools:-line([1/2,i],[13/2,i], color=red),i=1/2..13/2,1):
E2:=seq(plottools:-line([i,1/2],[i,13/2], color=red),i=1/2..13/2,1):
F:=plottools:-polygon([[1/2,1/2],[1/2,13/2],[13/2,13/2],[13/2,1/2]], color=yellow):
plots:-display(Matrix(4,7,[seq(plots:-display(plottools:-polygon(p,color=red),F, E1,E2), p=[seq(i[1],i=P1)])]), scaling=constrained, axes=none, size=[800,700]);
 

Carpet1.mw

The code was edited.

Hello people in mapleprimes

I asked a question for a similar thing before.
https://www.mapleprimes.com/questions/222751-PDEtoolsdeclare

The question I had then is not solved yet in my mind, so I think  I will ask you
again. It is about differentiation of a composite function.

with(PDEtools):
declare(f(x,y,z),g(t,y));
a:=f(x,y,z);
b:=x=g(t,y);
c:=eval(a,b);
d:=diff(c,y);
OFF;
e:=d;

h:=convert(e,diff);

For both e and d, the notation of D__1 and D__2 appear.
And, even if, with convert, I changed them to another form,
what I can get is more complicated form of h.

Is it inevitable to use D__1 and D__2 brabra in the differentiation of
composite function?

I am writing this question thinking that if there is a way of go around it,
 I want to know.

And, though this is the second question, even if I use latex( ) command,
natually, codes of Tex I can get is that of the output shown on the screen, including D__1 and D__2, even though I want it to be shown with f__x and f__y or that including prime. Then, I have to edit that tex file, changing D__1 to f__x etc. which I think is very complicated modification of the text file.
I wish there is a way to modify it in Maple so as it to be direct TeX codes which  do not require me to modify.
Is it impossible to do such a thing?

Thanks in advance.

diff_2.mw

How to find the range of poset?

i would like to search the range of range is equal to the range of domain after solve system.

it may not exactly equal but around 80% of elements in range belong to the range of domain

if it is not factorisation domain,

how to generate ideal with function in maple?

On the help page, the description says the remove function does the opposite of select.
when I run:

remove(has, D[1](xx[0]), {xx[0]})

it gives: D[1]()

while: select(has, D[1](xx[0]), {xx[0]})

produces: D[1](xx[0])

I find this during programming. 

Is there a way to remove the whole expression "D[1](xx[0])"

Many thanks!

Hi everyone.    How i can introduce an acximetric tolerance?. For example +10/-5. Thanks!

f:= z-> MeijerG([[1/2], []], [[], [1]], z);

simplify(f(z));
                               0
convert(f(z), hypergeom);
                               0
f(.2);
Error, (in evalf/MeijerG/limit) numeric exception: division by zero

f(2.2);
                         -0.4721129136

It seems that when MeijerG is not analytic on the unit circle, simplify and convert give a result that's valid only inside the unit circle.

This solve command produces both unconditional and conditional solutions.

Is there a way to have it only output unconditional solutions, or, failing that, is there a way to select the unconditional solutions from its output?

solve({2*x+y+z = 3, x^2+y^2+z^2 = 3}, [x, y, z], real, parametric)