## 1540 Reputation

19 years, 144 days

## Data....

Are you going to post the problem itself?

## Maple version....

@dharr Which Maple version is needed for this?

## Use Normalizer....

@sursumCorda Looking at the code, only linalg[iszero] uses Normalizer. So I must agree they've abandoned it.

## Zero is not relevant....

@sursumCorda Why would you say identifying zero matrix is mathematically irrelevant?

## Edited....

@max125 I put in minor changes. It should be easier to read.

## Typed....

@Joe Riel A minor improvement:

map(proc(P) lprint(cat(whattype(eval(P)) , " " , P)); end, (sort([exports(GraphTheory, instance)]))):

## Incorrect....

@dharr Infact there are 1455 subgroups and 56 conjugacy classes. I am hoping there is a way to generate them manually.

## Convert....

@sursumCorda Is this result correct?

F := proc(A) local a := A; while hastype(a, function) do a := subsindets(a, function, proc(F) [[op(0, F)], [op(F)]] end); end do; end;

F(cS(cK(cS(cI)))(cS(cK(cK))(cI))(x)(y));

[F(cS(x::anything)(y::anything)(z::anything) = x(z)(y(z))),
F(cK(x::anything)(y::anything) = x, cI(x::anything) = x)],
F(cS(cK(cS(cI)))(cS(cK(cK))(cI))(x)(y));
applyrule(%);
eval(applyrule([[f :: list, g :: list] = Fn(f, g)], %), Fn = ((L1, L2) -> op(L1)(op(L2))));

## Inverse....

@NeraSnow This is the inverse of ifactors:
f := proc (L) local p; L[1]*mul(p[1]^p[2], p = L[2]) end proc;

So with substitutions it would be:
fsubbed := proc (L) local p; L[1]*mul(subs(args[2..-1], p[1])^p[2], p = L[2]) end proc;

example:
ifactors(10!);
f(ifactors(10!));
fsubbed(ifactors(10!), 2 = two, 3 = three);

## Error....

@mmcdara There is an error in your definition of eq2. Compare to OP.

## Details....

@nm The manual is not written by the designers of the Maple language/software for the most part. It is written by hired personnel subsequently. Many details are simply not present in the manual. This is how I interpret the help pages.

If you know about automatic simplification, then the results you post are obvious.

## Illustration....

@nm To illustrate the action:

subsop(1=a,[2,1]=b,[2,2]=c,[2,3]=d,expr);
subsop(1=3, 2=b,3=c,4=d, expr);

## Understand first....

@nm If you do not recognize the object you are manipulating recognizing the result would be a mystery. Maple uses automatic simplification, meaning all numeric constants are multiplied automatically. The constant of multiplication is operand 1. Your operation removes it and introduces an additional new multiplier. Your operation can not be completed as a substitution.

## Defeat....

@Preben Alsholm If what you are saying is true then the purpose of assume mechanism is completely defeated.