-
Notifications
You must be signed in to change notification settings - Fork 64
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
add divrem for EuclideanRingResidueRing #1921
base: master
Are you sure you want to change the base?
Conversation
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #1921 +/- ##
==========================================
+ Coverage 88.17% 88.19% +0.01%
==========================================
Files 120 120
Lines 30303 30342 +39
==========================================
+ Hits 26719 26759 +40
+ Misses 3584 3583 -1 ☔ View full report in Codecov by Sentry. |
src/generic/Residue.jl
Outdated
|
||
#horrible - and copied from fmpz_mod | ||
#don't know how to seriously simplify it | ||
#maybe a durect gcdx should be added as well |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
#maybe a durect gcdx should be added as well | |
#maybe a direct gcdx should be added as well |
Add some tests? |
I am a bit confused. The code is for residue rings of euclidean rings, but then does something with leading coefficients? |
On Thu, Dec 05, 2024 at 05:29:11AM -0800, Tommy Hofmann wrote:
I am a bit confused. The code is for residue rings of euclidean rings, but then does something with leading coefficients?
We can try to do it with canonical_unit? The probelm is that coprime
base and gcd loose the units
… --
Reply to this email directly or view it on GitHub:
#1921 (comment)
You are receiving this because you authored the thread.
Message ID: ***@***.***>
|
possibly we need a more sane algorithm? |
How about just doing the Euclidean division in the "base ring" and then project down? |
On Thu, Dec 05, 2024 at 07:37:57AM -0800, Tommy Hofmann wrote:
How about just doing the Euclidean division in the "base ring" and then project down?
I guess it comes down to what euc. function we want on the quotient?
For Z/nZ we choose phi(a) = gcd(a, n) you're suggesting to use on R/mR
- choose the euc-minimal rep of a + mR
- euc(a)?
but keep the canonical unit? and not try to do eps a to find a minimal
rep?
… --
Reply to this email directly or view it on GitHub:
#1921 (comment)
You are receiving this because you authored the thread.
Message ID: ***@***.***>
|
would resolve oscar-system/Oscar.jl#4340