Anybody find Import CAD closes MapleSim 2022.2 when just opening file chooser when attempting to import CAD file?

Regards,
Bill

Hi.  I am using the linux version of Maple.  I seem to experience more bombs in Maple/Linux vs MathCad/Windows.  The program just froze as I was entering text.  Just text.  It is not a disaster since I make very frequent saves.  But it is very annoying.  I was a heavy user of MathCad from about 2005 to 2019.  In the early days, it bombed a lot.  But I do not recall that it ever bombed when I was entering text.  Any suggestions?  Would there be a limition on the number of text characters?  Is it Linux?  Other than this problem, it is a great program.

Hi! This is probably simple, but
I would like to know if there's an specific algorithm to do this:

let B =  in such a way that:

f( B ) = ; a_i in R; b_i in B; N>n.

so Linearcomb: f->V(R).

Linearcomb( f ) =

  + ... +.

with V(R) a vector space; R the Real numbers, and B the base. Neither the "factorize", nor the "simplify" are proving useful to this. Is there something i'm missng?

Does Maple Flow support the Maple Physics[Vectors] package? If so, how are vectors entered?

Let the square matrix A satisfy A^2023 = 0.

a. Prove: I-A is invertible.

b. If B is invertible, is B - A invertible?

This is not a Maple problem but it has something to do with math, specifically linear algebra, and I need help. Sorry if I bothered you. If possible please help me!

Download Unit_of_t.mw

The edge connectivity of a connected graph G  is the minimum number of edges whose deletion from the graph G disconnects G. Below we are concerned with a particular kind of edge-cut.

• For a connected graph G=(V ,E), an edge set S ⊂ E is a restricted-edge-cut, if G−S is disconnected and every connected component of  G−S has at least 2 vertices. 

Clearly, a restricted-edge-cut is an edge cut with a special requirement.

• The restricted-edge-connectivity of G, denoted by κres(G), is defined as the cardinality of a minimum restricted-edge-cut.

For example, a graph g is as follows.

Clearly, its edge-connectivity is 1 since (0,3) or (0,4) is a edge cut of g. But we can find that  if we remove the edge (0,3), then "3" is a isolated vertex. Similarly, "4" is a isolated vertex if we remove  (0,4). It is not difficult to find g has exactly the two cut-edges (0,3) and (0,4).

Based on the definition of the restricted-edge-cuts, neither {(0,3)} nor  {(0,4)} are restricted-edge-cuts.  A minimum restricted-edge-cut is {(0,1),(0,2)} since every connected component of G-{(0,1),(0,2)} has  (at least) 2 vertices.

So  κres(g) is 2.  My problem is:

Given a graph G, how to calculate the restricted-edge-connectivity of  G?  Moreover, how to find a minimum restricted-edge-cut? 

A specific graph that I want to test is as follows. (it has 16 vertices and 56 edges.) I would like to calculate its restricted-edge-connectivity and find a minimum restricted-edge-cut. 

g:=ConvertGraph("O~tIID@wL~j`PbOqgLJ@p");
DrawGraph(g, stylesheet=[vertexborder=false,vertexpadding=15,edgecolor = "Black",
     vertexcolor="Black",edgethickness=2])

EdgeConnectivity(g) 

6

One option I came up with is to find all 6-edge subsets first. Test if they satisfy  the restricted condition (one by one). Then continue to increase to 7 or more. But this violent calculation may get stuck in the first step. That is, test all the minimum edge cut sets (Note that we will consider 32468436 edge-subsets!) I was referring to the efficiency aspect.  

with(Iterator):
C:=Combination(58,6):
K:=Edges(g):
#sub:=seq( K[[seq(c[]+1)]], c=C); # do not run this code since it has 32468436 members.

Any language is acceptable.( C or C++, Python. )

PS: Some time ago, I also asked a related question (but with some differences) on mathematica stack （Find all the minimum edge cuts of a graph）. Although Bob Hanlon  gave a reply, the actual result is not good.

Edits: The following literature gives a polynomial algorithm for computing the restricted-edge-connectivity of a given  graph. The heart of it is to computing the least cardinality of some  edge-pairs's edge separator. I'm stuck here.

• Esfahanian A H, Hakimi S L. On computing a conditional edge-connectivity of a graph[J]. Information processing letters, 1988, 27(4): 195-199.

How to implement this algorithm is my current concern.

Hello:

I've changed my laptop this week and I'd like to know how to install Maple with my account in the new one.

Thanks in advance.

Sergio Sanz.

 Help in writing Maple code to transform differential equation with partial derivatives into ordinary differential equation

Hello everyone!

Please help me with this issue.
I have a plot with three curves and when I do any modification to the view (zoom in/out, pan) one of those curves disappears.

This is the plot before the modification of the view:


And this is the plot after the modification: (I just selected the "pan" option and clicked the plot)


What can I do to keep in view all the curves?
Thanks.

SDFS_primer_intento.mw

While I can scroll through the applications if my cursor is on the right.  I can't actually scroll through the applications on screen I keep getting thrown back to the top line. 

It's finicky, somehow managed it to work but it's finicky.  Not as nicely laid out as before.

How do i solve nonlinear coupled orinary differential equation with boundary conditions?

Please how  can I use getdata to extract only 200x2 of 208x2 matrix from maple to excel.

For instance I have:

Q:= ( seq( seq( plottools:-getdata(ans1[s1,3])[j,3],j=1..3), s1=1));

It returns  208x2,  200x2 200x2 matrices and I can't extract it using 

`<|>`( seq( seq( plottools:-getdata(ans1[s1,3])[j,3],j=1..3), s1=1));

because the matrices have different dimension. Please, how can make 208x2 matrix to 200x2?

After I refer to the Mersenne prime number table, I found the following result
5, 31, the number of digits is too large to be determined
13, 8191
17, 131071
19, 524287
If the following elements all yield composite numbers
So:
2, 3, 7, 127
The length of the sequence with only 2 only generators reaches 4.
Due to its particularity, it is guessed whether 2^(2^127-1)-1 is also a prime number,
and whether the sequence with 2 as the generator is an infinite sequence of prime numbers Woolen cloth? 
Then perfect numbers are also infinite.

The "new puzzle" button is not working on the "Challege of the Cahllenger Puzzle" page. Can this be reactivated?