I'm having trouble with using constrained optimization to solve a problem.

The problem is set up as:

Max: w=x1/2 y1/4

Subject to: K=x+4. K is a constant.

I'm not sure where to start.

map(f, foldl(`*`, 1, a, b));
foldl(`*`, 1, map(f,a), map(f,b));

map(f, foldl(`+`, 0, a, b));
foldl(`+`, 0, map(f,a), map(f,b));

i discover it can auto calculate ring homomorphism, 

if i define a function f below

factor(map(f, foldl(`*`, 1, a, b))+map(f, foldl(`*`, 1, b, c))) = map(f, foldl(`*`, 1, a, c));

how to convert this f into a function with two input parameters?

 from permutation group to permutation group and inverse this mapping?

how to do?

guys,i computed a tensorial expression by maple but i think i made mistake.

tensorial.mw

As an exercise, I'm trying to replicate the table shown at the end of section 10.3 (Creating Embedded Components) of the Maple User Manual, the table on page 308 of the PDF, reproduced here:

I create a 6 x 3 table, and merge cells of columns 1 and 2 in each of rows 1, 2, 5 and 6, and proceed to enter the text and components from the Embedded Components example 2 to look as above. In column 3, I merge the cells in rows 2, 3, 4, 5 in order to place the plot component as shown. The new cell seems to be considered as in the same row as its top merged cell, in this case, row 2.

I can't control vertical positioning in the plot cell in column 3. If I select the vertical alignment for the plot cell (which sets the same vertical alignment for all of row 2), to Centre or Bottom or Baseline, the alignment is to the centre or bottom or baseline of row 2, not of the plot cell. So when I paste the plot into the cell it extends up from the Centre or Bottom or Baseline of row 2, to well above the table's top border.

If instead I set the vertical alignment to Top, then the pasted plot fits into the cell since the top of the plot now aligns with the top of row 2. But that can be an annoying restriction. Also, I am no longer allowed to set the vertical alignment in rows 3, 4 or 5 because of the merged cell in column 3.

Maple document tables need to have two improvements:

1. The ability to adjust vertical centring in a single cell (merged or not), instead of just across a row.
2. The ability to resize row height. Currently it looks like document tables only allow resizing column width.

I guess my question is mainly, is there a better way to go about setting up a document table in order to control fairly precisely how it appears? And to get around some of these formatting restrictions?

I have downloaded the zip file for CalcP7, unzipped it, and can access its commands in a worksheet after issuing the command with(CalcP7), but "No Matches Found" displays when entering the command ?CalcP7. The download included a file named "aplication" (one "p") of type HDB, but Maple15 can't seem to access its contents.

Are CalcP7's help pages displayable? If so, what is necessary to access them?

I have had no trouble downloading the user package DirectSearch and accessing both its commands and its help pages.

I'd like to have an algorithm for computing the ring of invariants of a reductive group (i.e. G acts on V, compute C[V]^G). I know that there are algorithms in existance for this, e.g. see http://www.math.lsa.umich.edu/~hderksen/Publications/invar1999.pdf. Does anyone know if this has been implemented in Maple, or where to find code in another language? Any ideas on what sort of data structure would be appropriate

assume not starting from resolvent of quartic,

how to find [[1,2],[3,4]] and [[1,3],[2,4]] and [[1,4],[2,3]] ?

a1*a2 + a3*a4 if [[1,3,2,4],[1,2]]

a1*a3 + a2*a4 if [2,3][[1,3,2,4],[1,2]]

a1*a4 + a2*a3 if [2,4],[[1,3,2,4],[1,2]]

moreover, i use multiplication of permutation group can not multiply below

though i know how to operate multiplication by hand, i follow the syntax to do multiplication, seems not the way

with(group):
mulperms([[2,3]], [[1,3,2,4],[1,2]]);
mulperms([[1,3,2,4],[1,2]], [[2,3]]);

mulperms([2,3], [[1,3,2,4],[1,2]]);
mulperms([[1,3,2,4],[1,2]], [2,3]);

how to find [[1,3,2,4],[1,2]] and [2,3][[1,3,2,4],[1,2]] and [2,4],[[1,3,2,4],[1,2]]?

and why Orbits(G) put permutation group into power, how to display the result of this power group?

i use this or quartic polynomials' resolvent

with(GroupTheory):
G := SpecialUnitaryGroup(3, 1);
Orbits(G);
Orbit(1,G);
Orbit(3,G);

hi all

i have tow equations and i want plot q vs.A , that A change beetwin 0..phi. vn and a are definite and positive.

plz plz help me

(diff(f,y))^2-(f[y]^4)/4+q^2/(f[y]^2)+(1+2*q^2)*(f[y]^2)/2=piecewise(y<-a,1/4+2*q^2,-a<y<a,vn*(f[y]^2)-vn+1/4+2*q^2,y>a,1/4+2*q^2);

phiB[infinity]=q*int(f,y=-infinity..infinity):
A:=phiB[infinity]:

Hi

I have this attched procedure "Alt_lisse1".

Why the result e1 does'nt take into account the known variables

Thanks

ALt_lisse1.mw

with(GroupTheory):
G := Group({[[1, 2]], [[3, 4]]});
Orbit(G);
G := Group({[[1, 2], [3, 4]]});
Orbit(G);

GroupTheory:-PermutationGroup(

{module () local cycles, p, d, work; option object; end module,

module () local cycles, p, d, work; option object; end module},

degree = 4)
Error, invalid input: GroupTheory:-Orbit expects its 1st argument, point, to be of type posint, but received module () local labels, minSupp, maxSupp, suppSize, AtkinsonsAlgorithm, IsSimpleGroupOrder, doDerivedSeries, doLowerCentralSeries, Intersection2, RightCosetRepresentatives, LeftCosetRepresentatives, PRA, `Giant?`, `Even?`, doStab1, doStab, CycleIndexMonomial; export generator_list, n, supergroup, Sylows, pCores, ModulePrint, ModuleDeconstruct, Generators, Orbit, Orbits, IsTransitive, Transitivity, IsPrimitive, GroupOrder, Elements, IsAbelian, IsElementary, IsSimple, ConjugacyClass, ConjugacyClasses, CayleyTable, Centre, DerivedSubgrou...
GroupTheory:-PermutationGroup(

{module () local cycles, p, d, work; option object; end module},

degree = 4)
Error, invalid input: GroupTheory:-Orbit expects its 1st argument, point, to be of type posint, but received module () local labels, minSupp, maxSupp, suppSize, AtkinsonsAlgorithm, IsSimpleGroupOrder, doDerivedSeries, doLowerCentralSeries, Intersection2, RightCosetRepresentatives, LeftCosetRepresentatives, PRA, `Giant?`, `Even?`, doStab1, doStab, CycleIndexMonomial; export generator_list, n, supergroup, Sylows, pCores, ModulePrint, ModuleDeconstruct, Generators, Orbit, Orbits, IsTransitive, Transitivity, IsPrimitive, GroupOrder, Elements, IsAbelian, IsElementary, IsSimple, ConjugacyClass, ConjugacyClasses, CayleyTable, Centre, DerivedSubgrou...

how to calculate Ferrari resolvent of x^4-c1*x^3+c2*x^2-c3*x+c4

I was using Maple18 for the Ideal Membership Problem. While checking it I got the following error

Error, (in F4:-GroebnerBasis) argument `[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-48,-48,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]/A1[119295][119295]` is incorrect or out of order

Please tell me, how can I resolve this error ?.

Thank You.

i find that Suzuki group is very large, 

and finding subrgoup is still not solved 

and when find subgroup of suzuki group that is very slow

i would like to find two subgroup which are not isomorphric and then

prove a normaliser that make them isomorphric

with(GroupTheory):
G := SuzukiGroup();
IsFinite(G);
gorder := GroupOrder(G);
ifactor(gorder);
spg := SylowSubgroup(2, G);
IsAbelian(spg);
Elements(spg);
lprint(%);
H := Subgroup(Elements(G), spg);
N := Normaliser(G, spg);
#N := Normaliser(spg, G);
Elements(N);
lprint(%);
Elements(G);
H2 := Subgroup({[[5,2],[3,4]]}, G);
H2 := Subgroup(Elements(G), G);
elements2 := convert(Elements(G), 'list');
generators := map(ListTools:-Search, [Perm([[1,2,3]])], elements2);
H2 := Subgroup([52], G);
SubgroupMembership(H2, G);
H2 := Subgroup([3], G);
elist := Elements(H2);
AreConjugate(elist[2], elist[3], N); #N*elist[1]*N^(-1) = elist[2]
for ii from 1 to nops(elist) do
for jj from ii+1 to nops(elist) do
if AreIsomorphic(Group(elist[ii]),Group(elist[jj])) = false then
print("noniso");
print(ii);
print(jj);
end if:
od:
od:
AreConjugate(elist[8], elist[22], N); #N*elist[1]*N^(-1) = elist[2]