One context in which diophantine equations arise is hidden within the innards of loop optimizing compilers, where loop carried dependencies are considered, as they constrain parallelization.
I had (and donated to an engineering library in Urbana) a book about just this from the early 90s. I tried finding it on Amazon but no such luck.
Probably in the future nobody will be able to figure out how these things are written, because studying math doesn't make as much money as vibe coding.
I love this topic and look forward to reading the next articles, but I suggest not saying two numbers are "equal" mod N. I would say they are "equivalent" mod N and maybe point out the broader insight: Equality is often too rigid a constraint, and we usually want to consider equivalence relations instead. We know 3 and 6 and 9 are obviously not equal, but it's useful to notice the pattern that they are all divisible evenly by 3, i.e., they are all in the equivalence class 0 mod 3.
When I think about Langlands, I think it is the power of equivalence over equality that shockingly allows us to connect the discrete world of the natural numbers (or Q) with the world of the continuous (R or C), across disparate branches of mathematics. The Modularity Theorem (every elliptic curve over Q is modular) is the foundational idea and at every step along the way, we obtain evidence of more remarkable equivalences: The conductor N of an elliptic curve versus the level N of certain congruence groups; the point count deficiency (p'th Hecke eigenvalue) of a curve and the p'th coefficient of the Fourier q-expansion; Galois reciprocity showing an equivalence between the traces of Frobenius elements acting on a cohomology, and the eigenvalues of Hecke operators; Ribet's theorem about level lowering; etc. Time and again, the theme in Langlands is that equivalence relationships make it possible for us to reason why two intricate mathematical structures that seem completely foreign are actually "essentially the same" -- not equal, but equivalent.
The article doesn't really tell us much about the "why" unfortunately. Diophantine equations are introduced but all the interesting stuff is promised in future articles which haven't come yet. All the reader can take from this is that these equations lead to some "profound hidden structures" without a good idea what they are.
I get that it's hard to wrap one's head around the Langlands program but I'd love to see at least more exposition on the following statement:
>inventing the Euclidean algorithm is essentially equivalent to inventing unique prime factorization
Diophantine equations are as they say Turing complete. That is for any question about does this Turing machine with this tape halt with a certain value there is a corresponding Diophantine equation, which has solutions if the machine halts with the output corresponding to the values it is solved by. I think this paper covers it for register machines rather than Turing machines directly: https://carleton.ca/math/wp-content/uploads/Nick-Murphy-Hono...
This is not bidirectional. The Davis-Putnam-Robinson-Matiyasevich theorem shows we can make a Diophantine equation that acts as a universal Turing machine, but there’s Diophantine equations that cannot be solved by Turing machines:
The smallest known Diophantine equation that cannot be solved by any Turing machine last I checked had ~8000 states as a Turing machine. This Turing machine cannot be decided to halt, and if it does halt in finite time then an (outer) Turing machine could execute it to predict that, so this lives beyond decidability:
I find it annoying that the response to this from the Chaitain perspective is to throw your hands in the air and say not all of math is predictable and let “equivalent to halting decidability” be the death of effort. There’s a richer field of ‘hypercomputation’ sitting beyond the pale, and I believe it will be topological applications that untwist this knot [pun intended]. I’m excited for the post Turing world but i dare say I won’t live to see it.
The Matiyasevich theorem (which settled Hilbert's 10th Problem) proved that Diophantine equations are fundamentally tied to the Halting Problem. Because a universal Turing machine cannot determine if any arbitrary program will halt, no computer program or mathematical algorithm can ever be written to determine if any arbitrary Diophantine equation has an integer solution.
It is a surprising and delightful consequence of this observation that there is a polynomial whose integer-valued roots are exactly the set of all prime numbers.
Of course to measure out 42 litres from two jugs of 5 and 17 litres each on the day that the Sun is in the exact same position among the constellations as today, and so is the Moon and in the same phase.
I thought this was obvious, like which is the better editor vi or whatever that other one was.
Here is a prime factorization: 2 = 2 x 1. Every number has a product of 1. Every prime has itself as the only factor, and 1. Kind of silly to write about number theory and just pass over that simple fact.
The purpose of this article was, secretly, to tell the reader about another class of Diophantine equations which leads to the Langlands program, which studies from incredibly intricate hidden structure inside of number theory. The Langlands program studies Diophantine equations of the form
This is of course an oversimplification by graduate students trying to reach a broad audience, but one could argue that it in fact is. Langlands himself viewed his program as part of an attempt to achieve non-abelian reciprocity laws. See for instance: https://www.phys.ens.psl.eu/~kashani/slides_chenevier.pdf
One context in which diophantine equations arise is hidden within the innards of loop optimizing compilers, where loop carried dependencies are considered, as they constrain parallelization.
I had (and donated to an engineering library in Urbana) a book about just this from the early 90s. I tried finding it on Amazon but no such luck.
This was a recurrent tool at
https://en.wikipedia.org/wiki/University_of_Illinois_Center_...
Probably in the future nobody will be able to figure out how these things are written, because studying math doesn't make as much money as vibe coding.
I love this topic and look forward to reading the next articles, but I suggest not saying two numbers are "equal" mod N. I would say they are "equivalent" mod N and maybe point out the broader insight: Equality is often too rigid a constraint, and we usually want to consider equivalence relations instead. We know 3 and 6 and 9 are obviously not equal, but it's useful to notice the pattern that they are all divisible evenly by 3, i.e., they are all in the equivalence class 0 mod 3.
When I think about Langlands, I think it is the power of equivalence over equality that shockingly allows us to connect the discrete world of the natural numbers (or Q) with the world of the continuous (R or C), across disparate branches of mathematics. The Modularity Theorem (every elliptic curve over Q is modular) is the foundational idea and at every step along the way, we obtain evidence of more remarkable equivalences: The conductor N of an elliptic curve versus the level N of certain congruence groups; the point count deficiency (p'th Hecke eigenvalue) of a curve and the p'th coefficient of the Fourier q-expansion; Galois reciprocity showing an equivalence between the traces of Frobenius elements acting on a cohomology, and the eigenvalues of Hecke operators; Ribet's theorem about level lowering; etc. Time and again, the theme in Langlands is that equivalence relationships make it possible for us to reason why two intricate mathematical structures that seem completely foreign are actually "essentially the same" -- not equal, but equivalent.
In Science I think this phenomenon is called consilience.
The article doesn't really tell us much about the "why" unfortunately. Diophantine equations are introduced but all the interesting stuff is promised in future articles which haven't come yet. All the reader can take from this is that these equations lead to some "profound hidden structures" without a good idea what they are.
I get that it's hard to wrap one's head around the Langlands program but I'd love to see at least more exposition on the following statement:
>inventing the Euclidean algorithm is essentially equivalent to inventing unique prime factorization
Don’t think that has anything to do with langlands..? Euclidean algorithm is literally just an explicit algorithm for prime factorisation
Diophantine equations are as they say Turing complete. That is for any question about does this Turing machine with this tape halt with a certain value there is a corresponding Diophantine equation, which has solutions if the machine halts with the output corresponding to the values it is solved by. I think this paper covers it for register machines rather than Turing machines directly: https://carleton.ca/math/wp-content/uploads/Nick-Murphy-Hono...
This is not bidirectional. The Davis-Putnam-Robinson-Matiyasevich theorem shows we can make a Diophantine equation that acts as a universal Turing machine, but there’s Diophantine equations that cannot be solved by Turing machines:
https://www.nlp-kyle.com/post/number_computability/
The smallest known Diophantine equation that cannot be solved by any Turing machine last I checked had ~8000 states as a Turing machine. This Turing machine cannot be decided to halt, and if it does halt in finite time then an (outer) Turing machine could execute it to predict that, so this lives beyond decidability:
https://scottaaronson.blog/?p=2725
I find it annoying that the response to this from the Chaitain perspective is to throw your hands in the air and say not all of math is predictable and let “equivalent to halting decidability” be the death of effort. There’s a richer field of ‘hypercomputation’ sitting beyond the pale, and I believe it will be topological applications that untwist this knot [pun intended]. I’m excited for the post Turing world but i dare say I won’t live to see it.
Wait, are you saying they can't be solved by a Turing machine, but they can be solved some other way? If so, how?
The Matiyasevich theorem (which settled Hilbert's 10th Problem) proved that Diophantine equations are fundamentally tied to the Halting Problem. Because a universal Turing machine cannot determine if any arbitrary program will halt, no computer program or mathematical algorithm can ever be written to determine if any arbitrary Diophantine equation has an integer solution.
It is a surprising and delightful consequence of this observation that there is a polynomial whose integer-valued roots are exactly the set of all prime numbers.
Of course to measure out 42 litres from two jugs of 5 and 17 litres each on the day that the Sun is in the exact same position among the constellations as today, and so is the Moon and in the same phase.
I thought this was obvious, like which is the better editor vi or whatever that other one was.
More here
https://web.archive.org/web/20160615205452/http://www2.slgb.... Section 2
https://hal.science/hal-01254966v1/file/MayaEnigma.pdf
https://www.ias.ac.in/article/fulltext/reso/007/10/0006-0022
Here is a prime factorization: 2 = 2 x 1. Every number has a product of 1. Every prime has itself as the only factor, and 1. Kind of silly to write about number theory and just pass over that simple fact.
That's why 1 is not generally considered prime. If it was, 2 could be factored as 2, 2x1, 2x1x1, etc., which breaks the uniqueness property.
The purpose of this article was, secretly, to tell the reader about another class of Diophantine equations which leads to the Langlands program, which studies from incredibly intricate hidden structure inside of number theory. The Langlands program studies Diophantine equations of the form
This is not what the Langlands program is
This is of course an oversimplification by graduate students trying to reach a broad audience, but one could argue that it in fact is. Langlands himself viewed his program as part of an attempt to achieve non-abelian reciprocity laws. See for instance: https://www.phys.ens.psl.eu/~kashani/slides_chenevier.pdf