317 Reputation

7 Badges

9 years, 19 days

MaplePrimes Activity

These are questions asked by MDD

Hi Dears,

I studied the concept of Grobner bases and some algorithm for computing them. I understood that the computation of grobner bases is related to the term ordering. Also, I knew that LEX ordering is very expensive. So, it is good idea to use the Grobner basis conversion algorithms such as FGLM and Grobner walk algorithm. Now, I want to know concerning the complexity of these algorithm (Buchbergers algorithm, F4 and F5 algorithm, FGLM algorithm and Grobner walk). I hope my question be appropriate in this site,

Thank you in advance.

I am looking forward to hearing from you.


Hi dears,

How can I draw the solution of the following 3d linear inequalities in Maple?

A:={-x-y+3*z >= 0, -x+2*y >= 0, 3*x-2*y-z >= 0, x > 0, y > 0, z > 0}

I am looking forward to hearing from you

Sincerely yours.


Hi dears,

How can I detect two equivalent matrices? Is there any Maple command for this?

Also, Is there any command to verify that two matrices have the same Smith normalform?

Sincerely yours

I need  some examples s.t. the computation of their lexicographic Groebner basis is heavy?

Thank you so much.

What is the maximal independent set of monomial ideal$<c^4a^3b>$ in $K[a,b,c]$?

4 5 6 7 8 9 10 Page 6 of 11