-
-
Notifications
You must be signed in to change notification settings - Fork 554
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
polynomial quotient rings are unique parents #22983
Comments
This comment has been minimized.
This comment has been minimized.
Commit: |
comment:3
Does this fully solve the problem, though? One could give different generators for the same ideal. Should we be getting identical results for those, e.g., I suspect that for higher rank polynomial rings, normalizing the ideal representation might be too expensive (although computing in those rings would be expensive anyway). New commits:
|
comment:4
nbruin: You are right. It should be documented. I'll fix that. |
comment:5
Currently
So I would say rather that the two constructions should return the same ring; it should be easy, it suffices to make the defining polynomial monic because creating the key. |
comment:6
Replying to @xcaruso:
I agree. However, this is already happening automagically: |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:9
Doctests in |
comment:10
Ok.
I would be in favour of uniformizing this... but it's definitely for another ticket. I'll try to review your ticket soon. |
comment:11
Why did you remove "in one variable" in the doctest.
|
comment:12
Replying to @xcaruso:
Because it already says "univariate" there. |
Changed keywords from none to sd86.5 |
comment:14
Tests all pass for me, and it looks good. |
Reviewer: David Roe |
comment:15
Merge conflict |
comment:16
Replying to @vbraun:
For me, trac is showing it as still merging cleanly. Is there a new beta against which the merge is failing, or a ticket? |
comment:17
We do not get a merge conflict for that one. |
comment:29
I thought for a while that the behaviour of these doctests was random. Actually |
Branch pushed to git repo; I updated commit sha1. This was a forced push. New commits:
|
comment:31
Looks good to me. |
comment:33
I still get failing tests. Random failures during high load. It looks like the tests depend on whether a garbage collection is forced due to low memory.
|
Changed branch from u/saraedum/polynomial_quotient_rings_are_unique_parents to none |
Changed commit from |
Branch: u/saraedum/22983 |
Commit: |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:37
Not the first time, something like this has happened: #23851 comment:5 New commits:
|
Dependencies: #23851 |
comment:38
The issue has been fixed in #23851. Since I did not change anything, I am setting this back to positive review. |
Changed branch from u/saraedum/22983 to |
Currently quotient rings are not unique parents which sometimes causes trouble with
The changes proposed here make the creation go through a factory which makes sure that the parents are unique.
Depends on #23851
Component: commutative algebra
Keywords: sd86.5, sd87
Author: Julian Rüth
Branch/Commit:
966c36b
Reviewer: David Roe
Issue created by migration from https://trac.sagemath.org/ticket/22983
The text was updated successfully, but these errors were encountered: