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 409515
Computational Number Theory is for explicit calculations or algorithms involving anything of interest to number theorists.
2
votes
0
answers
49
views
Conductor of hyperelliptic curve after base change
Let $r\geq 5$ be a prime, and let $\zeta$ denote a primitive
$r$-th root of unity. Let $C$ be a hyperelliptic curve defined over $\mathbb{Q}$.
Suppose I have computed the conductor exponent $n$ of $C/ …
- 83
2
votes
0
answers
54
views
Conductor of hyperelliptic curve after adding a rational root
Let $r\geq 5$ be a prime. Suppose I have a specified hyperelliptic curve $C: y^2=f(x)$ defined over $\mathbb{Q}$, where $f\in\mathbb{Q}[x]$ has degree $r$.
Note: the roots of $f$ are not rational but …
- 83