bio | website | ideasfornumbertheory.com |
---|---|---|
location | France | |
age | 33 | |
visits | member for | 4 years, 5 months |
seen | 16 hours ago | |
stats | profile views | 3,641 |
I'm a former student in physics fond of number theory, especially Hilbert's 8th problem, further generalizations of the Riemann Hypothesis and almost everything related to prime numbers and L Functions. I'm also interested in Galois Theory even though I still don't know much about it.
Aug
24 |
comment |
Has Frucht's theorem been successfully used in inverse Galois theory?
So, is such a lattice the same for all finite cyclic groups? Would it be potentially different for another finite simple group? |
Aug
24 |
comment |
Has Frucht's theorem been successfully used in inverse Galois theory?
You have a point there. So the lattice describes the Galois group rather than the extension. Still, does the automorphism group of this lattice seen as a graph describe the considered Galois group? |
Aug
24 |
comment |
Has Frucht's theorem been successfully used in inverse Galois theory?
There's a map, namely a field homomorphism, from $\mathbb{Q}$ to an intermediate field between $\mathbb{Q}$ and $K$ and from each intermediate field to $K$. This diagram is a graph whose vertices are the different extensions of $\mathbb{Q}$ and the directed edges the considered maps. Such a graph describes a class of isomorphy of number fields, having thus isomorphic Galois groups. |
Aug
23 |
asked | Has Frucht's theorem been successfully used in inverse Galois theory? |
Aug
16 |
revised |
Gauss-Wantzel theorem, Fermat primes and solvability of S_n
added 223 characters in body |
Aug
16 |
revised |
Gauss-Wantzel theorem, Fermat primes and solvability of S_n
added 17 characters in body |
Aug
16 |
comment |
Gauss-Wantzel theorem, Fermat primes and solvability of S_n
Can you please tell me why? |
Aug
16 |
asked | Gauss-Wantzel theorem, Fermat primes and solvability of S_n |
Aug
11 |
comment |
Mathematical software wish list
To me, this problem has more or less the same flavor as P vs NP. If you consider that checking the proof of any given theorem is as easy as finding a proof thereof, this would mean that checking a solution of a (NP complete? NP difficult?) problem (prove any given theorem) is as easy as finding it. I'm by no means expert in complexity theory, but your position sounds unlikely to me. |
Aug
9 |
comment |
The concept of Duality
Does such a characterization of duality imply that there exists a general, rather abstract, notion of automorphism group such that any two dual objects have isomorphic automorphism groups? |
Aug
8 |
comment |
Mathematical software wish list
Don't worry, there's no need of Skynet for this :-) |
Aug
8 |
comment |
Mathematical software wish list
It wouldn't necessarily replace the creative process that is essential to research. |
Aug
7 |
answered | Mathematical software wish list |
Jul
27 |
comment |
Counting function for prime pair with bounded gaps between them
And maybe the OP would be glad to know that conjecturally, one can take $h(m)=m\log m$. |
Jul
22 |
comment |
Does the proof of Conjectures B and D of Hardy and Littlewood have any implication on the generalized Riemann hypothesis they used?
Your question is interesting, but please keep in mind that the right spelling is Riemann, not Reimann. |
Jul
21 |
comment |
Automorphisms of del Pezzo surfaces
Maybe a silly comment cause I know nothing about the subject, but can't $\alpha$ be an involution different from the identity? |
Jul
8 |
answered | Should one attack hard problems? |
Jul
7 |
accepted | The “maximal” field associated to the Selberg class |
Jul
4 |
awarded | Peer Pressure |
Jul
1 |
comment |
gamma-factor of a primitive element of the Selberg class
I sent you an e-mail with the considered article as an attached document. |