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
Galois representations over number fields speedup #21776
Comments
Branch: u/cremona/21776 |
Commit: |
New commits:
|
comment:2
Two small things: - for l in D:
+ for l in D.iterkeys(): This change is unnecessary as the iteration over a dictionary is the keys (and |
comment:3
Thanks, will do. I have no idea why I put in the iterkeys(). |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:5
You should add documentation to the new "deg_one_prime_iter" function. |
comment:6
OK, I am working on this. |
comment:8
Docstring and test added. |
Changed branch from u/cremona/21776 to u/tscrim/21776 |
comment:9
Looking at the New commits:
|
Reviewer: Travis Scrimshaw, Frédéric Chapoton |
comment:10
it.next() is not python3 compatible, use next(it) instead |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:12
Replying to @fchapoton:
I did not know that -- and in fact one thing I had done was to make the reverse change, thinking it was somehow more efficient. Thanks. I am happy with the changes since my commits. What next? |
comment:13
doc does not build, EXAMPLES: should be EXAMPLES:: |
comment:14
OK, I'll fix that and put it back into my branch... (building docs takes such a long time it discourages proper testing!) |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:16
I just took care of it. (Partial doc builds can help for this kind of testing.) Feel free to put your branch if you make other changes. |
comment:17
ok, looks good enough. |
Changed branch from u/tscrim/21776 to |
The code for computing Galois representations of elliptic curves over number fields (which is used in isogeny computation) uses the default iterator over primes of degree 1 in the number field. Two problems: first, the method K.primes_of_degree_one_iter() only gives primes up to some norm bound, and that is not always large enough if left at the default. Second, where the function is used only principal primes are wanted but the iterator starts at 2 wheras there are no principal primes of norm less than discriminant/4!
I put in a custom iterator which helps a lot.
I will upload a patch when I have recovered an example which fails badly.
Component: elliptic curves
Keywords: Galois representations
Author: John Cremona
Branch/Commit:
7ca67b0
Reviewer: Travis Scrimshaw, Frédéric Chapoton
Issue created by migration from https://trac.sagemath.org/ticket/21776
The text was updated successfully, but these errors were encountered: