486 reputation
1619
bio website
location France
age 32
visits member for 3 years, 1 month
seen 25 mins ago

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.


9h
asked Does Riemann's explicit formula imply invariance of the prime gaps distribution under a Fourier-like transform?
12h
answered l-functions of calabi-yau varieties
13h
accepted l-functions of calabi-yau varieties
1d
asked l-functions of calabi-yau varieties
Apr
16
accepted Has this strengthening of the PNT already been conjectured?
Apr
15
asked Has this strengthening of the PNT already been conjectured?
Apr
15
asked Do we know a lower bound for the number of critical zeros of the Riemann zeta-function with irrational imaginary part?
Apr
14
comment Are the primes normally distributed? Or is this the Riemann hypothesis?
Maybe not exactly what you're looking for, but the following preprint might be of interest: arxiv.org/abs/1404.3080
Apr
13
comment Isometry group of an integer as of the corresponding $\Omega(n)$-parallelotope
You're perfectly right. $G(1)$ is the trivial group and if $a\mid b$ then $G(a)$ is a subgroup of $G(b)$.
Apr
13
revised Upper bound for $r_{0}(n)$ through probabilities
added 37 characters in body
Apr
12
revised Upper bound for $r_{0}(n)$ through probabilities
added 319 characters in body
Apr
12
comment Isometry group of an integer as of the corresponding $\Omega(n)$-parallelotope
$\Omega(n)$ is the total number of prime factors of $n$ counted with multiplicity, $\omega(n)$ is the number of distinct prime factors of $n$. $\Omega(360)=6$, $\omega(360)=3$.
Apr
12
revised Upper bound for $r_{0}(n)$ through probabilities
added 300 characters in body
Apr
12
asked Upper bound for $r_{0}(n)$ through probabilities
Apr
12
asked Isometry group of an integer as of the corresponding $\Omega(n)$-parallelotope
Apr
8
comment Why was John Nash's 1950 Game Theory paper such a big deal?
To me the real big deal about John Nash is not this paper, but the fact that he recovered from schizophrenia spontaneously.
Apr
6
asked Can Voronin's universality theorem be used to show that $\sigma\circ\zeta=\zeta\circ\sigma$ implies $\sigma$ continuous?
Apr
1
asked Automorphisms of $\mathbb{C}$, Selberg class and surjectivity
Apr
1
accepted What keeps asymptotic Goldbach's conjecture out of reach of current technology?
Apr
1
comment What keeps asymptotic Goldbach's conjecture out of reach of current technology?
Ok, thank you for your answer. I know I still think like a physicist, but to me these approaches look rather technical, involving a quite heavy machinery for the results one can get through it. I wish someone brilliant and both intuitive and rigorous like Terry Tao could turn my heuristic arguments developped in threads like "About Goldbach's conjecture" into a proper proof. Referring to this last question, a rigorous proof that the quantity denoted by $\alpha_{n}$ is an $o(n)$ would already be interesting. I have no idea of how to achieve this though.