No it is not a different s. It is the same s. That's the problem.

Is you don't need to subsequently substitute for the subscripts the you could use literal subscripts instead. Eg,

   omega__s1    and   omega__s

which prettyprint as subscripted names.

You called it a "user initialization file", ie. your own personal Maple initialization file, unrelated to the location where Linux is installed.

There is not one, by default.

Simply create/edit a file called .mapleinit in your Linux home directory, using your favorite Linux text editor.

It should contain Maple source code.

If you enter initialization into the search bar of Maple's Help system you could see that this is documented. See here, for the online page.

I am taking your description to mean that a can be any algebraic expression not depending on t, and that b can be any algebraic expression depending on t.

If you don't like depends you could change it to has. I don't know how you want to treat the cases where t is used as a dummy variable (of integration, etc).

I'm pretty sure that even if I've overlooked some corner case (or misinterpreted your definition) this could still be fixed up easily.

Download starchk.mw

It would be pretty straightforward to turn that into a type check instead. (I usually go for the easiest or first reasonable predicate I think of, instead of labouring over a slick structured type check that I may not immediately understand when I look at the code again in 3 years.) I don't know how exactly you intend on using it, whether performance is a key concern at huge scale, etc.

[edit] I don't recall seeing patmatch used robustly for a key role in a major project.

Here is another way, without hard-coded writing out of the trig/trigh terms' particular arguments.

You could also add the step to assign the _D names, but it wasn't clear to me that you wanted to.

Download subsex.mw

If you don't need R for any other purpose then the last two of those statement could be combined together into this:

    subs(seq(CL[i]=cat(_D,i), i=1..nops(CL)), temp);

[edit] I'll point out that, as I see it, the order of the trig/trigh terms appearing in sol are rather arbitrary since in Maple those are can vary by session and the method of construction. Relying on that particular order of subterms in the sum seems like sloppy programming that might lead to later error, to me. Having said that, I don't see why one could not accept other terse variants such as the following (and it could be made shorter still).

   L := [indets(sol,specfunc({sinh,cosh,sin,cos}))[]]:
   temp := collect(sol,L):
   subs(seq(coeff(rhs(temp),L[i])=cat(_D,i), i=1..nops(L)),temp);

Of course, anyone is free to disagree with my rationale.

The authors of the package have stated steps here:
     https://www-polsys.lip6.fr/~jcf/FGb/FGb/x86_64_linux/index.html

Did you follow those steps?

(By the way, how do you think that relates to the version that is bundled in Maple 2020? Are you look for that site's specific version because of instructions for compatibility with another 3rd party package? It might help more if you described the full background of the query.)

The following can process 10^5 entries (sub-sets of set A) in about 1 second on my machine.

On my machine this was about 20% faster than mapping convert,string for 10^5 entries.

But for 100 entries I don't think that you'd be able to distinguish the difference.

restart;
A:={{"1","8"},{"1","4"},{"1","10"}};
           A := {{"1", "10"}, {"1", "4"}, {"1", "8"}}

map[2](sprintf,"%a",A);
          {"{"1", "10"}", "{"1", "4"}", "{"1", "8"}"}

An alternative but shorter syntax is,

sprintf~("%a",A);

You have made a common mistake in 2D Input syntax. Your two bracketed terms inside the sqrt are not being multiplied together. They are parsed together as a compound function call.

To get what you intended you can either insert an explicit multiplication sign or (in 2D Input mode) insert a space to denote mutiplication implicitly.

Download ellipticIntegralTest_ac.mw

Could you make big_car itself an object, and pass that to the method procedure, etc?

[edited] I didn't really understand why you want big_car:-set_name declared as static, btw, given the rest of your example's structure and the original description you gave. But you could also change this code below so that big_car_name was instead declared as static(string).

Download object_submodule.mw

It's unclear what you mean by stating that you want big_car defined in its own .mpl file, if you want it declared as a (static) local of the car_class object. Do you just mean that the source of the car_class will $include the source of big_car?

Your first example contained the code snippet,
    big_car:-set_name("toyota")
which you claimed did set the name for your first variant. Is that incomplete and a typo, or actually what you meant? (I have guessed at the intended meaning to be that the car_class object would not export from submodule big_car literally/directly.)

One thing you should know is that the product 14*(7 - 2*sqrt(7)) will automatically simplify to 98-28*sqrt(7), and that cannot be prevented merely by delaying evaluation.

There are a few ways to represent that product so that it prettyprints nicely, and so that you can recover the actual value for further computation.

Here, I'll use the inert `&*` operator instead of the usual active `*`. By default that will prettyprint with a gray multiplication symbol. You can also use the InertForm:-Display command to make it prettyprint in the more usual way.

Download auto_simp.mw

I will also mention that the alternative mechanism (to prevent actual multiplication) of using the ``(...) call will make the result prettyprint with round brackets even if that part is not a sum of terms.

You might also consider the following, though we do not know what other kinds of examples you might have.

content(98/3-28/3*sqrt(7), sqrt(7));
                               14
                               --
                               3 

icontent(98/3-28/3*sqrt(7));
                               14
                               --
                               3 

Also, if you are going to use these mechanisms programmatically then you might want to have a special case that primpart returns 1 or -1 (so that it doesn't print with unnecessary clutter). Again, we don't know what other kinds of examples you might have.

You can construct the plot in several ways.

You can also construct the list D1 in several ways. Your could express the difference of the products using special function GAMMA (or binomial or factorial, which I have not done, though there is the 1/2 present). You could also compute it with explicit multiplication, and by storing prior results to avoid recomputation (which I have not done as efficiency doesn't seem to be a central concern for your range of n).

Download Help_exclam_ac.mw

You wrote, "But now I am starting to worry that each maple command/function/name used inside the Object needs  :- added to it, just in case of a current or future name conflict with local object variables names."

But that is already true for programming with procedures and modules, so why suggest that it makes Object programming too onerous?

If there is a procedure or module local or the same name within scope then (within a procedure) one needs to qualify the name with colon-minus in order to force the interpretation to be the global instance of the name. (Your Questions first sentences incorrectly suggest the opposite, IMO.)

You might find it more convenient (or even proper) to exclude the non-static Object local (within scope) from being a candidate for the scoping resolution of the name reference. But it does not follow from your incorrect suggestion that the scoping rules are wholly different from that in general.

Use the Maple read command to read in a .m file that has been stored by Maple.

Pass the read command a string that points to the filename. It can be either the name/location relative to the current directory (see currentdir), or the full path to the file.

You can use the nextperm command from the combinat package to obtain the permutations one at a time. You don't need to construct your own procedure that walks the permutations.

You could also use the Iterator package to generate the permutations one at a time.

Having said that, here are three variants.

The first is like your original, but looks very awkward in Maple since I deliberately made almost as few alterations as possible to suit the language. You should not program like this in Maple, as there are much better techniques and syntax, even if you really feel the need to program the whole permutation process. But it is an answer to what you actually requested, about passing by reference (like a pointer). I use the evaln modifier of the procedure parameters so that they get passed by reference, and I use the eval command to access their values for the re-assignment.

The second is similar, but uses direct Array reference and multiple-assignment to swap entries.

And the third uses combinat:-nextperm.  I deliberately made the do-loop clumsy and obvious. It could be slicker (since Maple's do-loops also allow for useful while and until clauses, etc) but I hoped to confusion and it's not clear how you want to utilize the individual permutations.

Download perm.mw

If I have pasted in the plaintext theta__xy while in 2D Input mode then I can immediately convert it to the typeset form by simplify pressing the Escape key.

And I can do the same thing after the fact (ie. later) by first placing the mouse focus on that literal input, and then pressing Escape.

I don't know of any mechanism to change all such paste-ins with just one action, after the fact.

Is this adequate for your purpose?

Applying the expand command will turn the composition into nested calls, on which value does what you wanted.

Download nested_comp.mw