Ask Your Question
0

Groebner basis for rational functions with real coefficients

asked 2011-06-06 07:36:40 -0500

this post is marked as community wiki

This post is a wiki. Anyone with karma >750 is welcome to improve it.

Does anybody know if sage supports computing groebner basis for an ideal of rational functions with real coefficients? I can do this in mathematica, but when using sage I get the error:

verbose 0 (2416: multi_polynomial_ideal.py, groebner_basis) Warning: falling back to very slow toy implementation.

edit retag flag offensive close merge delete

1 answer

Sort by » oldest newest most voted
1

answered 2011-06-06 15:57:25 -0500

this post is marked as community wiki

This post is a wiki. Anyone with karma >750 is welcome to improve it.

Just to phrase your question correctly, you want to work with a polynomial ring whose coefficient ring is rational functions with real coefficients.

You don't get an error, just a warning that there is no particularly fast implementation available. Singular just doesn't support it, so Sage falls back to its default implementation. Groebner basis computations over non-exact fields are generally iffy, so you should first think about whether you can rephrase your problem in an exact coefficient ring.

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

Stats

Asked: 2011-06-06 07:36:40 -0500

Seen: 494 times

Last updated: Jun 06 '11