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 algebraic-number-theory
Search options not deleted
user 63939
Algebraic number fields, Algebraic integers, Arithmetic Geometry, Elliptic Curves, Function fields, Local fields, Arithmetic groups, Automorphic forms, zeta functions, $L$-functions, Quadratic forms, Quaternion algebras, Homogenous forms, Class groups, Units, Galois theory, Group cohomology, Étale cohomology, Motives, Class field theory, Iwasawa theory, Modular curves, Shimura varieties, Jacobian varieties, Moduli spaces
1
vote
1
answer
469
views
Polynomials for the alternating group $A_n$
It is my understanding that the polynomial $f_n(x)=x^n-1$ has the Galois Group $(\mathbb{Z}/n\mathbb{Z})^*$, group of units of order $\phi(n)$. In some sense, these are the "simplest" polynomials with …
18
votes
3
answers
5k
views
What is known about primes of the form $x^2-2y^2$?
David Cox's book Primes of The Form: $x^2+ny^2$ does a great job proving and motivating a lot of results for $n>0$. I was unable to find anything for negative numbers, let alone the case I am interest …
0
votes
0
answers
63
views
What is the lattice point distribution over binary quadratic forms?
Let $f(x,y)=x^2+ny^2$ be the binary quadratic form of interest and consider the lattice points $S=\{ (x,y,f(x,y)) \in \mathbb{N}^3 \}$.
For simplicity, we keep things only on quadrant I of the Cartesi …
0
votes
1
answer
125
views
Integer quadratic representation subject to discriminant minimization algorithm
Let $f(x)=ax^2+bx+c$ and $f(x)=n$. Is there an algorithm to choose $a,b,c$ such that the discriminant is minimized? Where $a,b,c,n,x$ are all integers.
More concretely, is there an algorithm to find $ …