Ask Your Question
0

Algorithm for Grobner Basis

asked 2022-04-10 09:38:40 +0200

Sanu gravatar image

updated 2022-04-10 15:26:38 +0200

Max Alekseyev gravatar image

We can calculate Groebner Basis as follows: I want to know the corresponding algorithm. Is it F5?

sage :  P.<x ,y> = PolynomialRing (GF(11) ,order =’lex ’)

sage : f1 = (x -1)^2 + (y -2)^2 - 3^2

sage : f2 = ( x +1)^2 + (y -1)^2 - 2^2

sage : I = Ideal ( f1 , f2 )

sage : I. groebner_basis ()
edit retag flag offensive close merge delete

Comments

Specific algorithm can be requested via .groebner_basis(algorithm=...).

Max Alekseyev gravatar imageMax Alekseyev ( 2022-04-10 17:42:15 +0200 )edit

1 Answer

Sort by » oldest newest most voted
1

answered 2022-04-10 16:53:41 +0200

tmonteil gravatar image

updated 2022-04-10 17:05:40 +0200

In your case, we can say that Singular library is called, see:

sage: from sage.misc.citation import get_systems
sage: get_systems('I.groebner_basis()')
['Singular']

But then, i am not sure which algorithm is called there, though apparently Singular ships F5, see https://en.wikipedia.org/wiki/Faugère...

Note that you can chose which implementation, see

sage: I.groebner_basis?

For example, you can specify (i just pick a random algorithm among all possible choices):

sage: I.groebner_basis(algorithm='libsingular:slimgb')
[x - 5*y - 5, y^2 - 2*y]

Though the name slimgbis not particularly self-contained (see https://singular.mathematik.uni-kl.de... more details).

edit flag offensive delete link more

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower

Stats

Asked: 2022-04-10 09:38:40 +0200

Seen: 66 times

Last updated: Apr 10