-
Notifications
You must be signed in to change notification settings - Fork 297
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
Arithmetic of quadratic fields #11407
Comments
This is very much in my area of interest, although I got a bit sidetracked with more computer sciency issues at the moment... I might have some half-finished outdated files for you if you want to try and fix them up. |
I am not going to work on this, I am already busy enough with In any case anyone interested should check here to see what we have already proved but not yet PRed. |
Note that the number rings |
Yeah but (as you know) some of these things aren't rings of integers, and some rings of integers aren't of this form. Maybe one way to proceed would be to define an "abstract Z[(1+sqrt(d))/2]" for d an integer congruent to 1 mod 4, like we have an "abstract Z[sqrt(d)]". I have a student working on Pell's equation by the way. |
I'm not sure I follow what you mean with an "abstract foobar". I would imagine that we can just add instances saying that Or is that what you meant? |
Basic arithmetic of quadratic fields (ring of integers, discriminant and so on) should now not be too difficult.
https://en.wikipedia.org/wiki/Quadratic_field
https://en.wikipedia.org/wiki/Quadratic_integer
The text was updated successfully, but these errors were encountered: