## Matrix monomial orders in Maple...

Asked by:

In the Maple help to use a matrix defined monomial order it is said to define a matrix and a list of variables and then typing 'matrix'(M,V). But I fail to use it. A very simple example:

M:=<<1,0>|<0,1>>;
V:=[x,y];
Groebner[LeadingMonomial](y^3+x*y, 'matrix'(M, V));

But Maple shows this error:

Error, invalid input: Groebner:-LeadingMonomial expects its 2nd argument, tord, to be of type {MonomialOrder, ShortMonomialOrder}, but received matrix(Matrix(2, 2, {(1, 1) = 1, (1, 2) = 0, (2, 1) = 0, (2, 2) = 1}), [x, y])

What is wrong?

## How would one properly name constants and variable...

Asked by:

Hello all,

I am trying to compute the Groebner basis for a set of 3 coupled nonlinear equations. The variables I wish to solve for are A0,B0, and B1; however, my equations also have the variables DC, a, nu, q, and t. I wish to solve the 3 equations in terms of these other 5 variables such that I can substitute in any values I desire and obtain a result. When attempting to put the three equations into the PolynomialIdeal command from the PolynomialIdeals package, Maple gives me an error stating that the inputs must be polynomials with respect to all 8 variables. How would I go about declaring the other 5 variables such that they are considered arbitrary constants?

I was able to get around the errors by assigning values to these 5 variables, though this is not what I am trying to accomplish. I need these 5 values to remain arbitrary.

I am very new to the concept of Groebner Bases and these commands so any help would be appreciated. I have attached my worksheet for reference. I am also happy to supply any additional information that may be needed to assist with this issue.

Thanks!

 >
 >
 >
 >
 >
 (1)
 >
 >
 >
 >
 >
 >
 >
 >
 >
 >
 (2)
 >
 (3)
 >
 (4)
 >
 (5)
 >
 >
 >
 >
 >
 >
 >
 >
 >
 >
 >
 (6)
 >
 >
 >
 >
 >
 >
 >
 >
 (7)
 >
 (8)
 >
 (9)
 >
 >
 >
 >
 >
 >
 >
 >
 >
 >
 >
 >
 >
 >

Download Groebner_Basis_Work.mw

## Announcing Maple 2017

by: Maple 2017

Maple 2017 has launched!

Maple 2017 is the result of hard work by an enthusiastic team of developers and mathematicians.

As ever, we’re guided by you, our users. Many of the new features are of a result of your feedback, while others are passion projects that we feel you will find value in.

Here’s a few of my favourite enhancements. There’s far more that’s new - see What’s New in Maple 2017 to learn more.

MapleCloud Package Manager

Since it was first introduced in Maple 14, the MapleCloud has made thousands of Maple documents and interactive applications available through a web interface.

Maple 2017 completely refreshes the MapleCloud experience. Allied with a new, crisp, interface, you can now download and install user-created packages.

Simply open the MapleCloud interface from within Maple, and a mouse click later, you see a list of user-created packages, continuously updated via the Internet. Two clicks later, you’ve downloaded and installed a package.

This completely bypasses the traditional process of searching for and downloading a package, copying to the right folder, and then modifying libname in Maple. That was a laborious process, and, unless I was motivated, stopped me from installing packages.

The MapleCloud hosts a growing number of packages.

Many regular visitors to MaplePrimes are already familiar with Sergey Moiseev’s DirectSearch package for optimization, equation solving and curve fitting.

My fellow product manager, @DSkoog has written a package for grouping data into similar clusters (called ClusterAnalysis on the Package Manager)

Here’s a sample from a package I hacked together for downloading maps images using the Google Maps API (it’s called Google Maps and Geocoding on the Package Manager).

You’ll also find user-developed packages for exploring AES-based encryption, orthogonal series expansions, building Maple shell scripts and more.

Simply by making the process of finding and installing packages trivially easy, we’ve opened up a new world of functionality to users.

Maple 2017 also offers a simple method for package authors to upload workbook-based packages to the MapleCloud.

We’re engaging with many package authors to add to the growing list of packages on the MapleCloud. We’d be interested in seeing your packages, too!

Advanced Math

We’re committed to continually improving the core symbolic math routines. Here area few examples of what to expect in Maple 2017.

Resulting from enhancements to the Risch algorithm, Maple 2017 now computes symbolic integrals that were previously intractable

Groeber:-Basis uses a new implementation of the FGLM algorithm. The example below runs about 200 times faster in Maple 2017.

gcdex now uses a sparse primitive polynomial remainder sequence together.  For sparse structured problems the new routine is orders of magnitude faster. The example below was previously intractable.

The asympt and limit commands can now handle asymptotic cases of the incomplete Γ function where both arguments tend to infinity and their quotient remains finite.

Among several improvements in mathematical functions, you can now calculate and manipulate the four multi-parameter Appell functions.

Appel functions are of increasing importance in quantum mechanics, molecular physics, and general relativity.

pdsolve has seen many enhancements. For example, you can tell Maple that a dependent variable is bounded. This has the potential of simplifying the form of a solution.

Plot Builder

Plotting is probably the most common application of Maple, and for many years, you’ve been able to create these plots without using commands, if you want to.  Now, the re-designed interactive Plot Builder makes this process easier and better.

When invoked by a context menu or command on an expression or function, a panel slides out from the right-hand side of the interface.

Generating and customizing plots takes a single mouse click. You alter plot types, change formatting options on the fly and more.

To help you better learn Maple syntax, you can also display the actual plot command.

Password Protected Content

You can distribute password-protected executable content. This feature uses the workbook file format introduced with Maple 2016.

You can lock down any worksheet in a Workbook. But from any other worksheet, you can send (author-specified) parameters into the locked worksheet, and extract (author-specified) results.

Plot Annotations

You can now get information to pop up when you hover over a point or a curve on a plot.

In this application, you see the location and magnitude of an earthquake when you hover over a point

Here’s a ternary diagram of the color of gold-silver-copper alloys. If you let your mouse hover over the points, you see the composition of the points

Plot annotations may seem like a small feature, but they add an extra layer of depth to your visualizations. I’ve started using them all the time!

Engineering Portal

In my experience, if you ask an engineer how they prefer to learn, the vast majority of them will say “show me an example”. The significantly updated Maple Portal for Engineers does just that, incorporating many more examples and sample applications.  In fact, it has a whole new Application Gallery containing dozens of applications that solve concrete problems from different branches of engineering while illustrating important Maple techniques.

Designed as a starting point for engineers using Maple, the Portal also includes information on math and programming, interface features for managing your projects, data analysis and visualization tools, working with physical and scientific data, and a variety of specialized topics.

Geographic Data

You can now generate and customize world maps. This for example, is a choropleth of European fertility rates (lighter colors indicate lower fertility rates)

You can plot great circles that show the shortest path between two locations, show varying levels of detail on the map, and even experiment with map projections.

A new geographic database contains over one million locations, cross-referenced with their longitude, latitude, political designation and population.

The database is tightly linked to the mapping tools. Here, we ask Maple to plot the location of country capitals with a population of greater than 8 million and a longitude lower than 30.

There’s much more to Maple 2017. It’s a deep, rich release that has something for everyone.

Visit What’s New in Maple 2017 to learn more.

## Error, (in Groebner:-NormalSet) The case of non-ze...

Asked by:
tord := plex(x, y, z);
G := Basis([hello1, hello2, hello3], tord);
ns, rv := NormalSet(G, tord);
Error, (in Groebner:-NormalSet) The case of non-zero-dimensional varieties is not handled
is this error due to version of maple?
which version do not have this error?

## how to check the dependency of groebner basis or a...

Asked by:

how to check the dependency of groebner basis or a set of polynomials?

## Solving with Groebner basis...

Asked by:

Suppose that a finite set of polynomials in C[x,y,z] has a finite number of solutions (i.e. the generated ideal is 0-dimensional).

Suppose also that the Groebner basis wrt plex(x,y,z) is

[f(z), g(y,z), h(y,z), k(x,y,z)]

As well known, the system can be now easily solved: choose a root z0 of f, plug it into g and h and look for a common root (y0) etc.

The question is the following:
Is it true that for EVERY root z0 of f there exist y0, z0 such that (x0,y0,z0) satisfy the system?

In all the examples I have seen this is true, but I don't know whether this is true in general or there is a counterexample.

[This is not a pure Maple question but I know that some members here work in this area].

Thank you.

## Is there a method to relate groebner bases with mo...

Asked by:

Is there a method to relate groebner bases with monomials ideals

## Error when I generate the normal set (Gröbner bas...

Asked by:

Hi all,

I am using Maple 2016.

I have defined 5 polynomials: f1, f2, f3, f4 and f5 with 5 unknowns q1,q2 ,q3, q4 and lamda.

After this, I generated the Gröbner basis. But when I try to find the normal set I got an error.

with(Groebner);

f1 := lamda*q1-(3380075947548081*q1*(1/140737488355328)-259050600068343*q2*(1/140737488355328)-1826834460600733*q3*(1/1125899906842624)+4414049272733425*q4*(1/9007199254740992))*(q2*(8289619202186977*q1*(1/9007199254740992)+3380075947548081*q2*(1/281474976710656)-4414049272733425*q3*(1/18014398509481984)-1826834460600733*q4*(1/2251799813685248))+q3*(1826834460600733*q1*(1/2251799813685248)-4414049272733425*q2*(1/18014398509481984)+843667886835955*q3*(1/70368744177664)-215663898201129*q4*(1/9007199254740992))-q4*(4414049272733425*q1*(1/18014398509481984)+1826834460600733*q2*(1/2251799813685248)+431327796402257*q3*(1/18014398509481984)+843667886835955*q4*(1/70368744177664))-q1*(3380075947548081*q1*(1/281474976710656)-259050600068343*q2*(1/281474976710656)-1826834460600733*q3*(1/2251799813685248)+4414049272733425*q4*(1/18014398509481984)));
f2 := lamda*q2+(259050600068343*q1*(1/140737488355328)+3380075947548081*q2*(1/140737488355328)-4414049272733425*q3*(1/9007199254740992)-1826834460600733*q4*(1/1125899906842624))*(q2*(8289619202186977*q1*(1/9007199254740992)+3380075947548081*q2*(1/281474976710656)-4414049272733425*q3*(1/18014398509481984)-1826834460600733*q4*(1/2251799813685248))+q3*(1826834460600733*q1*(1/2251799813685248)-4414049272733425*q2*(1/18014398509481984)+843667886835955*q3*(1/70368744177664)-215663898201129*q4*(1/9007199254740992))-q4*(4414049272733425*q1*(1/18014398509481984)+1826834460600733*q2*(1/2251799813685248)+431327796402257*q3*(1/18014398509481984)+843667886835955*q4*(1/70368744177664))-q1*(3380075947548081*q1*(1/281474976710656)-259050600068343*q2*(1/281474976710656)-1826834460600733*q3*(1/2251799813685248)+4414049272733425*q4*(1/18014398509481984)));
f3 := (1826834460600733*q1*(1/1125899906842624)-4414049272733425*q2*(1/9007199254740992)+843667886835955*q3*(1/35184372088832)-862655592804515*q4*(1/18014398509481984))*(q2*(8289619202186977*q1*(1/9007199254740992)+3380075947548081*q2*(1/281474976710656)-4414049272733425*q3*(1/18014398509481984)-1826834460600733*q4*(1/2251799813685248))+q3*(1826834460600733*q1*(1/2251799813685248)-4414049272733425*q2*(1/18014398509481984)+843667886835955*q3*(1/70368744177664)-215663898201129*q4*(1/9007199254740992))-q4*(4414049272733425*q1*(1/18014398509481984)+1826834460600733*q2*(1/2251799813685248)+431327796402257*q3*(1/18014398509481984)+843667886835955*q4*(1/70368744177664))-q1*(3380075947548081*q1*(1/281474976710656)-259050600068343*q2*(1/281474976710656)-1826834460600733*q3*(1/2251799813685248)+4414049272733425*q4*(1/18014398509481984)))+lamda*q3;
f4 := lamda*q4-(4414049272733425*q1*(1/9007199254740992)+1826834460600733*q2*(1/1125899906842624)+862655592804515*q3*(1/18014398509481984)+843667886835955*q4*(1/35184372088832))*(q2*(8289619202186977*q1*(1/9007199254740992)+3380075947548081*q2*(1/281474976710656)-4414049272733425*q3*(1/18014398509481984)-1826834460600733*q4*(1/2251799813685248))+q3*(1826834460600733*q1*(1/2251799813685248)-4414049272733425*q2*(1/18014398509481984)+843667886835955*q3*(1/70368744177664)-215663898201129*q4*(1/9007199254740992))-q4*(4414049272733425*q1*(1/18014398509481984)+1826834460600733*q2*(1/2251799813685248)+431327796402257*q3*(1/18014398509481984)+843667886835955*q4*(1/70368744177664))-q1*(3380075947548081*q1*(1/281474976710656)-259050600068343*q2*(1/281474976710656)-1826834460600733*q3*(1/2251799813685248)+4414049272733425*q4*(1/18014398509481984)));
f5 := q1^2+q2^2+q3^2+q4^2-1;
ord := tdeg(q1, q2, q3, q4, lamda);
tdeg(q1, q2, q3, q4, lamda)
G := Basis([f1, f2, f3, f4, f5], ord);

IsZeroDimensional(G);
false
ns, rv := NormalSet(G, ord);
Error, (in Groebner:-NormalSet) The case of non-zero-dimensional varieties is not handled.

Any help please ?

Thank you.

## Groebner basis and polynomial ideals...

Asked by:

Hi, I have a big system with 27 polynomial equations in 16 unknowns: f_1=...=f_27=0.  I can store these equations but I cannot calculate a Grobner basis of the ideal  J generated by my polynomials (allocation problem) - I use the library "with(FGb)"-  What interests me is whether my system is minimal in the following sense.

If, for example,  I remove f_1, is the ideal generated by (f_2,...f_27)  J again ? That is to say, is f_1 in the ideal generated by f_2,...,f_27 ? I would like to get an answer "yes" or "no" for each removed  f_i.

My question: can we solve the problem above  without calculating a Grobner basis of J?

Thanks in advance.

## Could you please introduce me some examples s.t. t...

Asked by:

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

Thank you so much.

## Maple is slow after using Groebner and PolynomialI...

Asked by:

After using the Groebner and PolynomialIdeals packages, Maple goes into a long calculation when I make an entry of the form

name:=polynomial expression. This can take 10's of minutes for an expression of two lines. The only solution I have found is to save the sheet and restart it and enter the line name:= etc. before loading Groebner and PolynomialIdeals. This is most inconvenient. Is there a better workaround?

## how to translate this mathematica code into maple ...

Asked by:
curve =2{t (3 t^4+50 t^2-33),7 t^6-60 t^4+15 t^2+2}/(t^2+1)^3;
implicit =GroebnerBasis[Thread[{x, y}== curve],{x, y}, t]//First550731776-41620992 x^2+585816 x^4+625 x^6-182250 x^4 y -41620992 y^2+1171632 x^2 y^2+1875 x^4 y^2+364500 x^2 y^3+585816 y^4+1875 x^2 y^4-36450 y^5+625 y^6

http://mathematica.stackexchange.com/questions/87136/how-to-convert-a-rational-parametric-plane-curve-into-implicit-form

## Groebner produces inconsistent result...

Asked by:

Hello,

Calculated a Grobasis basis. Used the 19 of the 29 equations to produce a Sylvester type matrix to get a univarite polynomial. The problem I am having is I can't produce a consistant matrix. I think the problem may lie in how I sort the equations. I have used this method once before and it worked to produce the result then. Run the worksheet and the run it again and most likely a different outcome occurs. I copy and pasted the polynmial list to make this worksheet. The coefficients are very long. Have annotated the worksheet to help explain.

Download Test_Equations_Matrix_Groebner.mw

## Eliminating redundant equations ...

Asked by:

I have a system of 16 polynomial equations in 15 variables. Independently I know there is at least a one parameter familiy of solutions to this system, so there is reason to think at least two of the equations are redundent. I would like to use Maple to decipher which of the equations are redundent, but I am unsure how to proceed.

So far I have looked at the Groebner package, and it seems like the Reduce and InterReduce commands will be useful. Say I call the set of 16 polynomials X and define a lexicographical order T on the variables. I then ask maple to compute

Reduce(X,X,T)

and receive a list with 7 zeroes and 9 polynomials. What exactly is this telling me? Does this mean that maple has used polynomial division and found that 7 of the equations are redundent?

Thanks for your help!

## IdealMembership Testing...

Asked by:

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.

 1 2 3 4 Page 1 of 4
﻿