Rymh (@Rymh22) header
Rymh (@Rymh22) profile picture

PhD, MSc, LMAO, ROTFL, LOL, WTF.

Joined November 2015
Photo by Rymh (@Rymh22)Photo by Rymh (@Rymh22)Photo by Rymh (@Rymh22)Photo by Rymh (@Rymh22)Photo by Rymh (@Rymh22)Photo by Rymh (@Rymh22)Photo by Rymh (@Rymh22)Photo by Rymh (@Rymh22)Photo by Rymh (@Rymh22)
Ja no és q el personatge se l'hagi menjat, és q és foll
Això és feixisme. Vergonya, ERC.
18
401
Jo només diré q he Passat de trigar una hora a anar a treballar (sí, necessito el cotxe) a hora trenta. Per tant, deixar la feina aquesta. Gràcies
Amb l'eliminació d'1 carril la Meridiana s'ha convertit en un caos constant. Des d'ahir l'ajuntament ha aplicat la seva nova ocurrència per "solucionar-ho": reduir a la meitat el temps de pas de vianants als semàfors. A AIXÒ LI DIEU PACIFICACIÓ? @bcn_ajuntament @transportpublic
4
18
2
61
12,281
Quin fracàs tu, en format físic ja res pel centre?
Must have jocs per la Switch? Vaig a comprar cosetes @Joan_Massanes ?
1
2
189
Links awaking, Three Houses, res de res
33
Com a mínim podrem tornar a veure tele3 en català
Esto me explotó la cabeza... Pd. Vienen por nosotros
2
4
21
875
Must have jocs per la Switch? Vaig a comprar cosetes @Joan_Massanes ?
3
1
1
451
If the Generalized Riemann Hypothesis (the stronger version of the Riemann Hypothesis) is proven, these become proven facts: Algorithms that no longer need randomness - Primality testing: Miller's fast test becomes proven correct with no randomness - Square roots mod a prime: becomes solvable fast and with no coin flips (today that's an open problem) - Cube roots and other roots mod a prime: same. - Factoring polynomials over finite fields: almost fast (quasi-polynomial) with no randomness, instead of needing randomness - Building finite fields: you can construct any finite field directly, with no random search - Factoring vs. φ(n): factoring a number becomes provably as easy as computing φ(n), even without randomness - Primes with a given remainder: a prime with any allowed remainder mod q exists that's at most about q², so searching for one is fast Complexity theory - Polynomial equations: "does this system of equations have a solution?" drops from PSPACE to a much lower class (AM) - Algebraic P vs NP: Valiant's algebraic version of P vs NP gets tied to the normal P vs NP over the complex numbers - Turing machines: a known 744-state Turing machine is proven to run forever Number theory software - Math libraries: PARI/GP and Magma results computed "assuming GRH" become fully proven - Class groups: algorithms that compute these number-field structures get guaranteed running times - Elliptic curve generation: the algorithms used to create curves for crypto get guaranteed running times Cryptography (no new attacks, only proofs) - Elliptic curves: proven that if discrete log is hard on one curve, it's hard on almost all similar curves - Lattice crypto: known quantum attacks on some lattice schemes become proven to work - Isogeny crypto: known quantum attacks on some isogeny schemes get proven speeds - Code-based crypto: schemes like BIKE get the guarantee that the special primes they need exist Prime gaps - Next prime: there's always one within about √p·log p of p, so "find the next prime" has a guaranteed worst case What it does NOT do - It doesn't solve P vs NP - It doesn't make factoring easy, so RSA and elliptic-curve crypto stay safe - It doesn't make anything faster in practice, because randomized versions already work today - Ramanujan graphs, expanders and AG codes are unaffected: they use a finite-field version of RH that was proven decades ago
76
597
59
4,698
479,576
Like most mathematicians, I believed the Riemann Hypothesis to be completely out of reach at present (even with the best AI tools), because I expected it to require substantial theory-building, probably in arithmetic geometry. The kind of new theory-building that fills entire books, and that AI isn't so good at yet. Mathematicians have a notion of how deep a problem is. A sufficiently deep problem is generally intractable until enough of the theory is in place. If difficult problems are like valuable mineral reserves buried miles underground, you first need to build the infrastructure to reach them. What Levent's proof seems to have done instead is something completely different. It takes an incredibly complicated tour through the infrastructure built for a hundred other mineral reserves, situated far from the destination, and somehow create a wormhole to the original destination. This is not theory-building in the usual sense. It is something much weirder and more alien. The best human mathematicians know how to build theory, painstakingly, to reach a goal. But no human brain, on its own, is capable of creating a wormhole that requires a 25,000 page long tour through existing infrastructure with no obvious or realistic connection to the goal. But huge credit to Levent here: I think no current AI, on its own, is capable of this either. I had never worked on or thought too much about the Riemann Hypothesis: it seemed very far removed from my own area of number theory. But the astonishing thing about Levent's claimed proof of RH (which I think has a very good chance of being correct) is that it uses a huge number of precisely the things that are central to my own corner of number theory: - Theta functions and other automorphic forms on unitary groups - Gan–Gross–Prasad period formulas - Relative trace formulas Etc., etc. A problem that I had always assumed would require new theories in arithmetic geometry may instead turn out to be tractable through an inhuman chain of existing (deep) results in higher-rank automorphic forms (and a lot else).
This actually makes me a bit more confident that the proof has a good chance. RH is proved by using *everything*!
182
735
162
7,350
939,486
Tros de peli, Civil War
2
163
Aquí està ben explicat
Guys, this is very serious and you have to read this right now. The Riemann Hypothesis may have just been solved, and if the claim holds, it's an insane achievement. In mathematics there is a famous problem called the Riemann Hypothesis, and it's about prime numbers. Primes are numbers like 2, 3, 5 and 7 that can only be divided by 1 and themselves. Every other number is built by multiplying them together, so they're the building blocks of all numbers. You can never tell exactly where the next prime will show up, but if you step back, there's a pattern. Around 1,000, about 1 in 7 numbers is prime. Around a million, about 1 in 14. Around a billion, about 1 in 21. Primes get rarer at a steady, predictable pace. Because of that pattern, mathematicians can estimate how many primes there are below any number. But the estimate is never exactly right. It's always a little off, and the big question is how far off it can get. Think of flipping a coin 1,000 times. You expect 500 heads, but you'll get something like 480 or 520. It's a little off, but never wildly, and you can predict how far off it will be. In 1859 a mathematician named Bernhard Riemann found that the prime estimate's error isn't random. It's controlled by a hidden set of special numbers. Where those numbers sit decides how big the error gets. Riemann guessed that every single one of them sits on one straight line. If he's right, the error always stays small, just like the coin, and primes are as orderly as they could possibly be. If even one of those numbers is off the line, the error can grow much bigger, and primes are far messier than we think. So far computers have found trillions of these special numbers, and every single one is on the line. But there are infinitely many, so checking will never be enough. You need a proof that covers all of them at once. For 167 years nobody has found one. It's one of the seven hardest unsolved problems in mathematics, with a million dollar prize attached. Now a mathematician has posted a note saying that, working with Claude, he believes he has that proof. He says a computer has already checked every step, and that Claude raced ahead of him near the end. Experts still need to confirm it, but this isn't a random internet claim. If it holds, it doesn't mean we can predict every prime. It means we finally know the pattern can never go wildly wrong. Thousands of math papers that begin "assuming the Riemann Hypothesis is true" become proven fact overnight. We'd also get firm limits on how far apart primes can be, and a guarantee that a fast method for testing whether a huge number is prime always works. And no, your bank account isn't in danger. Online security depends on how hard it is to break a huge number into its prime factors, and this proof doesn't make that any easier. If anything, it gives the math behind encryption a stronger foundation. If it holds, this is bigger than one math problem. A question that beat the greatest minds in history for 167 years would have been cracked by a human and an AI in a matter of weeks. If AI can find answers and computers can check them, the limit on science is no longer how smart we are. It's how many good questions we can ask.
3
161
Ah. Per això no ho estava acabant de pillar
You’re unable to view this Post because this account owner limits who can view their Posts. Learn more
3
77
És el compte B d'un dels Garzón?
Replying to @Delpeu
Amb les pensions públiques passa tot això perquè són PÚBLIQUES i el sistema funciona. Els salaris de la resta són una merda perquè són privats i depenen d'una colla de sangoneres que ens exploten. I encara ens explotarien més si no fos per la, minsa, intervenció de l'estat.
1
1
6
225
M'ha fet gràcia i tot
¡Simplemente el mejor video! 😂🤣😂🤣😂🤣😂🤣😂🤣😂
1
1
206
Q la diferència en els extrems sigui deguda a tenir un O dos cromosomes X no deixaré mai de trobar-ho fascinant
It’s absolutely wild to me that people still don’t understand this graph shows males and females have the same average IQ. Blows my mind.
2
2
415
Rymh retweeted
Per culpa d’aquesta gent no em puc rendir en pau. VIA FORA
Algú ha d’anar a Madrit a trencar els acords de pacificació. El 29N, si ets independentista, el teu vot és @alhoracatalunya
3
17
88
2,674
Ara entenc que no sàpiga a qui votar.
¿Qué dicen los programas del 29N? Lo hemos mirado con @econ_calles en el blog de @EsadeEcPol. Esto es lo que hemos encontrado. 👇 Primero. En un diagrama de 2x2 ideológico (vertical: sociedad; horizontal: economía), aquí están los programas y así comparan con 2023.
1
2
5
304
Ho fa per tenir interaccions, i així dinerons, oi?
La prueba de que se puede reducir la deuda pública sin aplicar recortes.
1
1
2
143
Oh, paper rejected
1
1
121
És el primer q faig quan arribo a la feina
This quoted post is unavailable.
4
207
I wonder if the Microsoft Outlook engineers are stuck in their own vicious cycle of Authenticator prompts?
360
3,981
309
47,166
850,224