From https://maplesoft.zoom.us/webinar/register/WN_qidPG4qHRWGiTyO65vnGpw?timezone_id=Europe%2FParis

Is the recording of  Sneak Peek at Maple 2023 made on march 1,  available anywhere to see on Maple website or somewhere else? 

Update

Recording is at https://www.maplesoft.com/webinars/recorded/featured.aspx?id=2100  but need to first register/login if you are memeber of maplesoft.com

"The recording will start immediately after filling out the form."

In graph theory, the lexicographic product  or graph composition G ∙ H of graphs G and H is a graph such that

 - the vertex set of G ∙ H is the cartesian product V(G) × V(H); 
 - and any two vertices (u,v) and (x,y) are adjacent in G ∙ H if and only if either u is adjacent with x in G or u = x and v is adjacent with y in H.

Given two graphs, it is easy to obtain their lexicographic product. However the inverse process does not look so easy. 

I read the book "Handbook of product graphs" and wiki, that say that the recognition complexity of lexicographic products is polynomially equivalent to the graph isomorphism problem. 

For the lexicographic product, I know that there is some algorithm without codes to implement the decomposition of the lexicographic products of a graph.

• Feigenbaum, J.; Schäffer, A. A. (1986), "Recognizing composite graphs is equivalent to testing graph isomorphism", SIAM Journal on Computing, 15 (2): 619–627, doi:10.1137/0215045 (https://www.cs.yale.edu/homes/jf/FS-SICOMP86.pdf)

However, I did not understand the algorithm process mentioned in the article, nor did I see the program implementation of this algorithm. About 5 months ago, I asked similar questions on multiple platforms, but did not receive any feedback.

The potential algorithm can help us discover some theorems, so I am very interested in the implementation of the algorithm in the above article.

PS:We also know that there are already polynomial algorithms for the decomposition of the cartesian product of a graph. A polynomial time algorithm for finding the prime factors of Cartesian-product graphs", Discrete Applied Mathematics, 12 (2): 123–138, doi:10.1016/0166-218X(85)90066-6, MR 0808453 and we can find the java codes for implementation of finding the prime factors of Cartesian-product graphs.

Given a Graph G kind help to write a function F to compute values Based on Neighboorhood

Another_type_using_neighborhood.pdf

Your help will be greatly acknowleged greatly

looking for a simple code kind help

Looking to write a function f which takes a weighted graph g and returns values with are distance based

Kind help please your help will be acknowleged

Try_code_based_with_distance.pdf

Please kind help

Looking for simple code

 I am looking to program to create a function which can take a weighted Graph G and output me a array of computed values as an list 

I have around 15 values to be found 

say a function

Compute(graph::g)

I am mainly look for a simple way to code all these in fewer number of lines kind help in that

I attach a PDF file on what i require     Trying_to_code_1.pdf

Kind help

The main ideas i need are

1) How to do sum over edges of a graph G in a simple line of code

2) How to Product sum  over edges of a graph G in a simple line of code

Each one of your help will be greatly apprieciated Please kind help and it will be acknowleged too

What is the reason Maple likes to do this

arccos(sin(x));

         Pi/2 - arcsin(sin(x))

Both are correct, but the first has leaf count of only 3 and the second expression has leaf count of 11.

Surely the first is simpler to look at and read so the second form is not simpler.

What is the logic behind this automatic transformation? And did Maple always do this?

Convert undirected graph unweighted graph to a weighted graph even though all the weights are 1

as i want to check how my function works on weighted graph as I know it works unweighted

Yesterday (?) there was a nice question which was answered by VV using Jensen's inequality.

Where is it now?

I teach high school math where we use Maple. Some times some students who use Maple 2022 on Mac computers both older and new version of the OS, experience that the document won't react to simple things like plot, solve of loading packages with the "with" command. 

Any idea could be causing this? Because the error goes away if we load a new document within Maple or restart the program.

Found integration problem which causes server.exe to crash each time. I hope this can be used to help find why server.exe keeps crashing much more than before in Maple 2022.

This happens each time. The above is a typical example of what I have been saying all the time above server.exe crashing. It should not do that. If it can not solve the problem, it should simply return.

I hope these problems will be fixed in Maple 2023.

Any one can figure why it crashes?

Attached worksheet.

Download crash_feb_3_2023.mw

This question stems from a previous question that has been perfectly resolved by acer and Carl Love, but as Carl Love mentioned the foldl function, today I attempted to experience its functionality (In order to understand the foldl or foldr function). But I encountered a small issue. 

s:="[ (0, 1), (1, 2), (1, 10), (2, 3), (3, 4), (4, 5),
(4, 9), (5, 6), (6, 7), (7, 8),(8, 9), (10, 11), (11, 12),
(11, 16), (12, 13), (13, 14), (14, 15), (15, 16)]";
with(StringTools):
L1:= "()[]": L2:= "{}{}":
X:=foldl(SubstituteAll,s,op([L1[1],L2[1]]),op([L1[2],L2[2]]),op([L1[3],L2[3]]),op([L1[4],L2[4]]));

Error, (in StringTools:-SubstituteAll) expecting 3 arguments, but got 2

I find it strange that foldl doesn't recognize SubstituteAll with three arguments. 

Isn't s and op([L1[i], L2[i]]) providing three arguments? Of course, s is constantly changing.

The goal is to replace the above string with:

{ {0, 1}, {1, 2}, {1, 10}, {2, 3}, {3, 4}, {4, 5},

    {4, 9}, {5, 6}, {6, 7}, {7, 8},{8, 9}, {10, 11}, {11, 12},

    {11, 16}, {12, 13}, {13, 14}, {14, 15}, {15, 16}}

Hey
My notes from my math course is corrupt and i really need them. When i open the document it just say "worksheet may be incomplete" Can anyone help recovering them? I tried the recover function but it didn't work. Here is the original document: Mat_1_-_Noter.mw. 

I also have this .bak from the day before where i know it worked:   _Users_jonathanlarsen_Desktop_Mat_1_-_Noter70_MAS.bak.zip
How can i prevent this in the future? It's the second time it has happenend.

Sincerely a frustrated student :(

For instance, here is a list of valid "rules" (given as equations): 

(* restart; *)
rules := [g = d, e = a, a = b, f = d, c = g, b = b, d = c, c = f, a = e]:

But these rules can be represented more compactly as a list of "cycles": 

cycles := [[g, d, c], [e, a], [f, d, c], [b]]:

Is there a efficient way to convert into ? 

Hey guys

I have a question using the piecewise function:

fa := unapply(piecewise(0 < x and x < a, k1, a < x and x < b, k2), x);

simplify(fa(x)) assuming 0 < a, 0 < x and x < a;

It should return k1, but it doesn't. Does anyone have a solution?

Sincerely,

Oliveira

Suppose I have a polynomial:

poly := x^6 - 3*x + 3

And I know one of its roots and its galois group:

firstroot := [solve](poly, x)[1]:
G := GaloisGroup(poly, x):

Since G act transitively on the all roots. How do I get all the other roots of this polynomial just by the firstroot and G, but not by solving the equation.