Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

MPolynomial_libsingular over ZZ #4021

Closed
malb opened this issue Aug 31, 2008 · 6 comments
Closed

MPolynomial_libsingular over ZZ #4021

malb opened this issue Aug 31, 2008 · 6 comments

Comments

@malb
Copy link
Member

malb commented Aug 31, 2008

There it is.

CC: @williamstein

Component: commutative algebra

Keywords: libsingular, singular, ZZ, multivariate

Issue created by migration from https://trac.sagemath.org/ticket/4021

@malb malb added this to the sage-3.1.3 milestone Aug 31, 2008
@malb malb self-assigned this Aug 31, 2008
@malb
Copy link
Member Author

malb commented Aug 31, 2008

comment:1

Attachment: mpolynomial_libsingular_zz.patch.gz

the attached patch depends on #686

@malb
Copy link
Member Author

malb commented Sep 1, 2008

comment:2

On [sage-devel] Oliver Wienand (author of the upcoming Singular implementation for GBs over rings) wrote:

I have just glimpsed over the code. But maybe it is worth stating in
the comments, that the reduce impl. only returns unqiue answer against
strong Gröbner basis.

Gröbner basis G of I <=> the leading ideal of G generates all leading
terms of I
strong % of I <=> for every leading term t of I there exists an
element g of G, such that the leading term of g divides t.

(leading terms means coef * product of variables)

Otherwise the reduce code shown in
https://github.com/sagemath/sage-prod/files/10641888/mpolynomial_libsingular_zz.patch.gz
looks fine.

@malb
Copy link
Member Author

malb commented Sep 24, 2008

comment:4

Attachment: mpolynomial_zz_reduce_doc.patch.gz

The second patch addresses the review of Oliver Wienand on [sage-devel]:

I have just glimpsed over the code. But maybe it is worth stating in
the comments, that the reduce impl. only returns unqiue answer against
strong Gröbner basis.

Gröbner basis G of I <=> the leading ideal of G generates all leading
terms of I
strong % of I <=> for every leading term t of I there exists an
element g of G, such that the leading term of g divides t.

(leading terms meaans coef * product of variables)

Otherwise the reduce code shown in
https://github.com/sagemath/sage-prod/files/10641888/mpolynomial_libsingular_zz.patch.gz
looks fine.

@aghitza
Copy link

aghitza commented Sep 28, 2008

comment:5

Attachment: trac4021-doctest-fix.patch.gz

Applies cleanly on 3.1.3.alpha1 + the patch at #686, except for a reject in rings/polynomial/multi_polynomial_libsingular.pyx, which can be ignored.

There is a tiny doctest failure in rings/polynomial/multi_polynomial_element.py which is fixed by the attached patch.

@sagetrac-mabshoff
Copy link
Mannequin

sagetrac-mabshoff mannequin commented Sep 28, 2008

comment:6

Merged all three patches in Sage 3.1.3.alpha2

@sagetrac-mabshoff
Copy link
Mannequin

sagetrac-mabshoff mannequin commented Sep 28, 2008

comment:7

Merged all three patches in Sage 3.1.3.alpha2 and this time I closed the ticket :)

@sagetrac-mabshoff sagetrac-mabshoff mannequin closed this as completed Sep 28, 2008
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants