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 35416
Computational Number Theory is for explicit calculations or algorithms involving anything of interest to number theorists.
8
votes
Accepted
What is the ring $A_{\Gamma}$ in the Cohen-Lenstra Heuristics?
The group $\Gamma$ is indeed isomorphic to the Galois groups of the fields in the family, whose class groups one studies. The class groups come with a natural action of $\Gamma$, but under this action …
- 13k
3
votes
Accepted
How can we justify the use of Example 5,4 (of Cohen, Lenstra) assuming their heuristics
$\DeclareMathOperator\Aut{Aut}$I infer from the context that the precise meaning of "a random $\mathbb{Z}[\zeta_d]$-module modulo a random principal ideal" means that you start by producing a random $ …
- 13k