I'm stuck on trying to convert something like xi^p to H(p)*xi^p. p is an integer.

The variable I am using is xi and I want to just insert an H(p) term based on the order of xi (p). I want to do it for any occurence of xi. I don't want to convert other variables/symbols.

It would seem applyrule should work, except it goes into an endless loop.

I've tried other combinations but just don't seem to be able to figure out the right one.

It seems to me that I could try some sort of subsindet where the transformer checks the variable name, but that seems inefficient.

I'm going to guess there is a simple solution!

Thanks.

What would it take to generate all subgroups (permutation group representation) of Symmetric(6)?

GraphTheory:-IsReachable can be used to "determine if there is a path between two vertices", and GraphTheory:-ShortestPath can be used to "find a path between two vertices with minimum distance", but which command can be used to "enumerate all (simple) paths from one node to another" like MatLab's allpaths in Maple? 

For instance, I would like to enumerate (not simply count) at most 3483192 paths with total weights at least 45 in the graph constructed from  that begin at node 30 and end at node 29. 
There exists a practically ready-made procedure  (where only a limited subset of its local variable  is needed) in a previous question. Nevertheless, after waiting for a quarter of an hour, the evaluation still did not terminate and I had to abort it manually. Meanwhile, MatLab completed the same computation within one minutes: 

So, how to list those 1008252 paths (without knowing the actual total number beforehand) faster in Maple?

Note. MatLab also has a built-in function allcycles, whose efficient Maple equivalent has been proposed in How to obtain all cycles in a graph from its cycle basis - MaplePrimes, yet I cannot find an analogue to MatLab's allpaths. 

Considering galois group of P is Symmetric(6), shoudn't the answer be trivial and instant in this example?

P := s^6 + s^3 - s + 1;
galois(P);
(evala@AFactor)(P);
PolynomialTools[Split](P, s, 'SF');

Is there a command which will analyze a procedure and list all unreferenced global and local sequence entries?

For instance, here is a worksheet where I have replaced  with  in advance: 
 

But without re-evaluations, how do I know the second input and the fourth input have been stealthily substituted?

In a Mma notebook, this can be displayed by shadowing the input label: 

But in order to detect changes, which method should be used in Maple?
(Note that I do not mean that no changes are allowed. So I don't think setting the “editable” property is a workaround.)

Dear all

I possess an integral function that is multiplied by an accompanying coefficient. How can I automatically isolate and extract the coefficient that appears outside the integral function?

extract_coef_before_integral.mw

Thank you

`lprint` is officially interpreted as “linear printing of expressions”, but in the most recent release, its output looks just like "left printing" (under the default zoom 100%), 

while in some legacy version, `lprint` printed expressions not only on the left but also on the right. 

How to render `lprint` print its arguments not only on the left half?
Although I believe that similar questions must have been asked before, I cannot find such a question. 

Code: 

lprint(_bigPi):
showstat(ellipsoid)

How I can solve this, because I can't find the solutions. The display show "Length of output exceeds limit of 1000000"

Please help me.. 

This is my model on picture

Hello everyone! Hope you´re doing fine. For work I have to compare two terms with each other and say which one is greater. I did this by hand but it would be very helpful if maple could do this for me. I made some asummptions about the parameters and used the evalb command but unfortunately maple had no answer for me. I also used the is command but this didn´t work either. 

Can someone please tell me what i am doing wrong or if maple can do this at all?
Many thanks!!

Best wishes
Hahn

 Maple_Forum_Help_(1).mw

Hello,

Best wishes for this new year.

Horner's algorithm for polynomials is considered more efficient in terms of the number of operations.
However, numerous comparisons (search for real or complex roots, calculations of hundreds of values...)
with Maple on polynomials of high degrees (10,12...) show, for me, no significant difference in times of execution evaluated with the st-time() command.

Has this point already been covered?
Are there specific situations where using the "horner" conversion is relevant with Maple?

Thank you for your clarification.

Best regards.

Let M a block matrix, for instance:

restart:
S := [a, b, c, d]:
M := Matrix(2$2, (i, j) -> Matrix(2$2, symbol=S[2*(i-1)+j]))

It is quite simple to transform M into a 4x4 Matrix P with elements 

P[1, 1] = a[1, 1], P[1, 2] = a[1, 2], P[1, 3] = b[1, 1], ..., P[4, 4]= d[2, 2]

But does it exist a built-in Maple function which does this "unfolding"?

Thanks in advance

Something happens when I redefine an indexed value of a table, but I'm not sure what.

Here's the situation before the definition.

eval(WhateverYouNeed["calculations"]["structure"]["connection"]);

TABLE(["Cutright1" = "false", "graindirection1" = 90 Unit(arcdeg), "Cutleft2" = "false",  "lengthleft2" = 500 Unit(mm), "Cutrightsteel" = "false", "lengthleftsteel" = "false", "lengthleft1" = 350 Unit(mm), "lengthright2" = 500 Unit(mm), "connection_1" = "Timber", "lengthrightsteel" = "false", "connection_2" = "Timber", "Cutleft1" = "false", "Cutleftsteel" = "false", "graindirection2" = 0, "graindirectionsteel" = "false", "Cutright2" = "false", "lengthright1" = 150 Unit(mm), "connection_InsideLayers" = 1])

I then try to redefine one specific entry of the table.
WhateverYouNeed["calculations"]["structure"]["connection"]["connection_1"] := GetProperty("ComboBox_connection_1", 'value');

WhateverYouNeed["calculations"]["structure"]["connection"]["connection_1"] := "Timber"

Which gives this new result.

eval(WhateverYouNeed["calculations"]["structure"]["connection"]);

TABLE(["connection_1" = "Timber"])

The rest of the indices and entries of the "connection" table is gone.

I am looking for something like that but in 3d.

My question is twofold:

- What, in general, are "good" ways to do this? I am surprised that I haven't found anything better than the Boing Ball. Patterns of billard balls might be an alternative if the balls are well oriented at the start of an animation/simulation.

- How can spheres be patterned in Maple? I looked at: plots,obsolete,sphereplot(deprecated), plottools,sphere, and plots,conformal and MaplePrimes for examples but did not find anything to build on. 

Patterns that might not be too complicated to implement:

• globe with meridians and chessboard pattern,
• ball with a punched belt,
• ball with 2 or 3 crossed belts
• ...

Any thoughts on this topic?

Update: Change of orientation of the angular velocity while the sphere is spinning is an important visualisation aspect. I added this to the title.

In the most recent issue of Maple Transactions, I published (with David Jeffrey, and with a student named Johan Joby) a paper that used Jupyter Notebook with a Maple kernel as the main vehicle.  Have a look, and let me know what you think.

Two-cycles in the infinite exponential tower