Hi there,
I’m fairly certain that I wrote that code or was at least involved
since I wrote most of the first version of the libsingular stuff,
David’s commit output by `git blame` is a merge commit.
The algorithm in question is described in “Ideals, Varieties, and
Algorithms” by David Cox, John Little and Donal O’Shea in Section
"§3 A Division Algorithm in k[x_1 , … , x_n]".
I didn’t check, though, if under the hood Singular does some
additional tricks which might modify the output when I is not a
GB.
Cheers,
Martin
PS: Checking if something is a GB calls reduce to check. See
`basis_is_groebner`.
Luca De Feo <de...@lix.polytechnique.fr> writes:
+1 for doing something.
What about the following fix: When the input is a list/tuple,
we check
if it is a Groebner basis or not. If it is, do the computation,
if not,
print a warning or raise an error.
Sounds reasonable.
Other options would be:
- Just refuse list input.
- Always compute a Groebner basis.
Since it seems that David Roe wrote the original code, his
opinion
would be very valuable.
Luca
--
_pgp: https://keybase.io/martinralbrecht
_www: https://martinralbrecht.wordpress.com
_jab: martinralbre...@jabber.ccc.de
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
