Timeline for Is there a stable algorithm for polynomial division (in several variables)?
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 19, 2009 at 3:07 | vote | accept | CommunityBot | ||
| Nov 19, 2009 at 3:07 | history | bounty ended | Orr Shalit | ||
| Nov 13, 2009 at 11:36 | comment | added | Orr Shalit | No, it isn't. There is no problem with the degree of the $a_i$'s, when the $f_i$'s are a Groebner basis (with respect to a grlex for instance) the degree of the $a_i$'s will be less than the degree of $h$ (the point of 3.1 is that the generating polynomials there are not assumed to be a basis). The bad thing that can happen, see the link below (Example 2.5), is that h can be a polynomial with very small coefficients, while when the division algorithm is run naively, one gets the the coefficients of the polynomials $a_i f_i$ are huge. | |
| Nov 13, 2009 at 6:07 | comment | added | David Lehavi | isn't 3.1 what you looked for ? | |
| Nov 12, 2009 at 23:30 | comment | added | Orr Shalit | Thanks, that is nice reference, but if I am not mistaken, it does not address the problem. | |
| Nov 12, 2009 at 8:08 | history | answered | David Lehavi | CC BY-SA 2.5 |