Uncovering Multiscale Order in the Prime Numbers via Scattering · HackerPapers discussions

Uncovering Multiscale Order in the Prime Numbers via Scattering — mentioned by eternalban

Sun, 16 Sep 2018 14:30:00 GMT

You can access the paper on arxiv: https://arxiv.org/abs/1802.10498

Paper and discussion history. A mention is not an endorsement.

Uncovering Multiscale Order in the Prime Numbers via Scattering — mentioned by throwawaymath

Sat, 08 Sep 2018 14:42:22 GMT

You should read the paper authors' paper directly; a preprint version if available on arXiv.[1] The authors don't provide a complexity analysis of their algorithm; in lieu of attempting to derive that analysis myself, I'm deeply skeptical that their algorithm can find arbitrarily large prime numbers in sub-exponential time; let alone the polynomial time needed for breaking classical public-key cryptography. The absence of such a complexity analysis is conspicuous because such an analysis would be groundbreaking. However, I don't need to lean on the conspicuous absence of a proof of polynomial…

Paper and discussion history. A mention is not an endorsement.

Uncovering Multiscale Order in the Prime Numbers via Scattering — mentioned by credit_guy

Sat, 08 Sep 2018 06:50:30 GMT

Link to paper https://arxiv.org/abs/1802.10498 Also worth noting that Freeman Dyson pointed out the link between prime numbers, or the Riemann zeta function, and quasicrystals, see p. 2-3 of http://www.ams.org/notices/200902/rtx090200212p.pdf And here’s some marhoverflow discussions on Dyson’s ideas: https://mathoverflow.net/questions/133581/quasicrystals-and-...

Paper and discussion history. A mention is not an endorsement.