Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computational-number-theory
Search options not deleted
user 4344
Computational Number Theory is for explicit calculations or algorithms involving anything of interest to number theorists.
1
vote
Upper bound on greatest prime of bad reduction for a plane curve
@Dror: I will address your last comment in the question about bounding the genus from below.
Here I wanted to add a remark: the explicit bound you found is such that any prime larger than this bound …
- 5,137
3
votes
Accepted
Computationally bounding a curve's genus from below?
If you can check that the curve is geometrically irreducible, then you may try using the Hurwitz formula (you may use the formula in any case, but you would have to be more careful with the conclusion …
- 5,137