Hello,

How can I pde with maple?please explain completely,and other question :How can I solve pde with plot in maple because some questions dont have exact answer?

if DegreeLexicographic is T2:=lexdeg([a,b,c],[x,y,z]);

DegreeReverseLexicographic = T2:=lexdeg([c,b,a],[z,y,x])  ?

with(PolynomialIdeals):

quotientlist := Quotient(GB, varj[j]);
finallist2 := [];
for z from 1 to nops(quotientlist) do
if
finallist2 := [op(finallist2), op(z,quotientlist)];
od:

there are only 3 monomials in quotientlist, but nops return 6

Let a finite set of closed intervals in the plane be given.
How to find all the intersections of these, outputing the intersection points together with the intersecting intervals?
This is a problem of computational geometry
(see http://en.wikipedia.org/wiki/Line_segment_intersection).
In other words, how to realize the sweep line algorithm in Maple?

PS. I'd like to note that computational geometry has serious applications, in particular, in robotics.

how to compute the ideal mapping from ideal A to ideal B

Let Poly2 denote the vector space of polynomials

(with real coefficients) of degree less than 3.

Poly2 = {a1t^2+ a2 t+ a3 |a1; a2; a3 €R}

You may assume that {1,t; t^2}is a basis for Poly2.

(1) Show that L1 = {t^2 + 1; t-2 ; t + 3}and L2 = {2 t^2 + t; t^2 + 3; t}

are bases for Poly2.

(2) Let v = 8t^2- 4t + 6 and w = 7t^2- t + 9. Find the coordinates for

v and w with respect to the basis L1 and with respect to the basis L2

(3) find the coordinate change matrix P from the basis L1 to the basis L2.find P^-1

Just I answer part (1) can you help me to answer 2 and 3 

I am considering to write a wrapper for plot and related commands (could redefine the commands or introduce a new name) which facilitates export of Maple plots to postscript. The command should interpret some of the options and remove them from the options sequence before submitting the remaining ones to the original plot().
E.g. it should recognize a title="TITLE" parameter and process TITLE (e.g. write it to a specific file). Similarly I would want to be able to pass additional parameters, e.g. filename="FILE" in order to specify how the output file name should be set. Is this a sensible approach. How can I realize this detailed option 'parsing' in Maple?

how to calculate hlibert series as in maple with Gröbner Bases

would like to know the algorithm and try in another programming language such as F#

i find the algorithm in book Singular introduction to commutative algebra

page 320 and 322 

1. is it equal to the hilbert series function in maple?

eq1a := Homogenize(eq1, h);
eq2a := Homogenize(eq2, h);
eq3a := Homogenize(eq3, h);
T3:=lexdeg([a,b,c,h]);
GB := Basis([eq1a,eq2a,eq3a], T3); #a

MonomialHilbertPoincare(LeadingMonomial(GB[1],T3), LeadingMonomial(GB[2],T3), LeadingMonomial(GB[3],T3));

F:=[LeadingMonomial(GB[1],T3), LeadingMonomial(GB[2],T3), LeadingMonomial(GB[3],T3)];
InterReduce(F, ???);

 2. what is the maple function for degree reverse lex ordering ?

eq1a := Homogenize(eq1, h);
eq2a := Homogenize(eq2, h);
eq3a := Homogenize(eq3, h);
David Cox using Algebraic Geometry page 82 use resultant to eliminate variable h
eq1b := eq1a - x;
eq2b := eq2a - y;
eq3b := eq3a - z;
T2:=lexdeg([a,b,c],[x,y,z]);
GB := Basis([eq1b,eq2b,eq3b], T2);
r1 := resultant(eq1b, eq2b, h);
r2 := resultant(eq1b, eq3b, h);
r1 = r2

page 82 teach how to eliminate, after do question 2, discover r1 and r2 are the same.

how to eliminate the variable h with resultant after homogenize ideal with variable h

 Do Hilbert series function classify all or only some type or some form of ideals?

Let Poly2 denote the vector space of polynomials

(with real coefficients) of degree less than 3.

Poly2 = {a1t^2+ a2 t+ a3 |a1; a2; a3 €R}

You may assume that {1,t; t^2}is a basis for Poly2.

(1) Show that L1 = {t^2 + 1; t-2 ; t + 3}and L2 = {2 t^2 + t; t^2 + 3; t}

are bases for Poly2.

(2) Let v = 8t^2- 4t + 6 and w = 7t^2- t + 9. Find the coordinates for

v and w with respect to the basis L1 and with respect to the basis L2

Hi everyone

Right now I am working on a command that calculates the molar mass of molecules. Mostly it is working like a charm but in some cases the interpretation of the input goes wrong.
The command converts the input to a string, e.g.:

f:=convert(Ca₃(PO₄)₂, string) = "Ca[3](PO[4])[2]"

f := StringTools:-Remove("[]_*^+-", f) = "Ca3(PO4)2"

However, sometimes information such as parentheses is lost (which is understandable considering the fact that maple does not know chemical syntax):

f := convert(NH[3][3]*PO[4], string) = "NH[3][3]*PO[4]"

f := StringTools:-Remove("[]_*^+-", f) = "NH33PO4"

In special cases it goes completely nuts (I am aware this is not a real molecule):

f := convert(Al(OH)₂(NH₃)₂, string) = "Al(`#msub(mfenced(mi("OH")),mn("2"))`)(NH[3])[2]"

The problem could of course simply be solved by typing the input as a string with no subscripts but is looks much nicer with the correct chemical syntax as input.

Do any of you know a way to translate the input charactor by charactor into a (understandable) string?

Thanks in anvance,
Mads 

why not maple use NoSQL object database to save objects to prevent out of memory?

I have an indexed equation that contains serval definite integrals in it. I want maple to evaluate the equation for different indices. But when I set the parameter "N=100" in the code, it takes maple lots of time for the evaluation. I am looking for some tricks to make the code numerically more efficient. I will be so thankful for any opinion and help.
you can find my code below. The code is so simple and just contains few lines. I will appreciate any help.

Numerical_Performance.mw

Thanks in advance.

Hi all

I have written the following code in maple to approximate arbitrary functions by hybrid of block-pulse and bernstein functions but it doesn't work properly especially for f(t)=1.0, so what is the matter?

bb1.mws

best wishes

Mahmood   Dadkhah

Ph.D Candidate

Applied Mathematics Department