Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Why study Diophantine equations?

hidden-phenomena.com

Post reply on HN
Print view View original

31–38 of 38 posts

Re: Why study Diophantine equations?

#31

Post by renyicircle »

mtsolitary wrote: post #14
renyicircle wrote: post #3

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…

Don’t think that has anything to do with langlands..? Euclidean algorithm is literally just an explicit algorithm for prime factorisation

I mentioned Langlands because it's one of the cool things related to Diophantine equations that the article mentions but I wouldn't expect it to be covered there. The connection between the Euclidean algorithm and unique prime factorization is simpler but also not obvious (the Euclidean algorithm on the surface just computes the GCD of two numbers and doesn't mention primes) so it would make sense to explain it in the article. However, they don't explain what the algorithm is, maybe assuming that the reader knows about it, while the rest of the article seemingly assumes no familiarity with basic number theory concepts like modular arithmetic. That confused me.

Re: Why study Diophantine equations?

#32

Post by srean »

mathisfun123 wrote: post #26
jjtheblunt wrote: post #2

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_C…

Hn upvotes the weirdest things. You're talking about polyhedral analysis which emphatically does not work on diophantine forms http://polyhedral.info/

What's with this phenomenon of new accounts that confidently make authoritative false claims in things that they have no competence in.

Few days ago there was this account claiming there's no rotation matrices to be seen in any ML algorithms.

EDIT: oh it's the same guy. LoL.

Re: Why study Diophantine equations?

#33

Post by mathisfun123 »

srean wrote: post #32
mathisfun123 wrote: post #26

Earlier quoted context omitted.

Hn upvotes the weirdest things. You're talking about polyhedral analysis which emphatically does not work on diophantine forms http://polyhedral.info/

What's with this phenomenon of new accounts that confidently make authoritative false claims in things that they have no competence in. Few days ago there was this account claiming there's no rotation matrices to be seen in any ML algorithms. EDIT: oh it's the same guy. LoL.

> March 9, 2023

This is a new account?

> no competence in.

I have a PhD in ML compilers (one of my papers is cited on the site I linked) and as I mentioned in the previous "discussion" I currently work in FAANG as an ML compiler engineer.

But thanks for playing :)

Re: Why study Diophantine equations?

#34

Post by srean »

mathisfun123 wrote: post #33
srean wrote: post #32

Earlier quoted context omitted.

What's with this phenomenon of new accounts that confidently make authoritative false claims in things that they have no competence in. Few days ago there was this account claiming there's no rotation matrices to be seen in any ML algorithms. EDIT: oh it's the same guy. LoL.

> March 9, 2023 This is a new account? > no competence in. I have a PhD in ML compilers (one of my papers is cited on the site I linked) and as I mentioned in the previous "discussion" I currently work in FAANG as an ML compiler engineer. But thanks for playing :)

That was my guess anyhow. A common affliction among newly minted PhDs. They usually out grow it.

I am reminded of https://news.ycombinator.com/user?id=almostgotcaught

Won't be surprised if it's the same person.

FAANG are now in the midst of a hype cycle. So that place of employment signal is pretty noisy now, especially if employed in the hyped field.

Coming back to the point, Polyhedral models for loop analysis and Diophantine equation based address aliasing analysis are quite different techniques.

Re: Why study Diophantine equations?

#35

Post by [deleted] »

srean wrote: post #34
mathisfun123 wrote: post #33

Earlier quoted context omitted.

> March 9, 2023 This is a new account? > no competence in. I have a PhD in ML compilers (one of my papers is cited on the site I linked) and as I mentioned in the previous "discussion" I currently work in FAANG as an ML compiler engineer. But thanks for playing :)

That was my guess anyhow. A common affliction among newly minted PhDs. They usually out grow it. I am reminded of https://news.ycombinator.com/user?id=almostgotcaught Won't be surprised if it's the same person. FAANG are now in the midst of a hype cycle. So that place of employment signal is pretty noisy now, especially if employed in the hyped field. Coming back to the point, Polyhedral models for loop analysis and…

[deleted]

Re: Why study Diophantine equations?

#36

Post by jjtheblunt »

mathisfun123 wrote: post #33
srean wrote: post #32

Earlier quoted context omitted.

What's with this phenomenon of new accounts that confidently make authoritative false claims in things that they have no competence in. Few days ago there was this account claiming there's no rotation matrices to be seen in any ML algorithms. EDIT: oh it's the same guy. LoL.

> March 9, 2023 This is a new account? > no competence in. I have a PhD in ML compilers (one of my papers is cited on the site I linked) and as I mentioned in the previous "discussion" I currently work in FAANG as an ML compiler engineer. But thanks for playing :)

Is your thesis published and at a URL? Since I'm an old parallelizing compilers person, I'm curious what you did. (genuinely curious, not obnoxiously curious).

You should know a serious fraction of folks commenting on these threads have resumes like you're bragging about.

Re: Why study Diophantine equations?

#37

Post by mathisfun123 »

jjtheblunt wrote: post #36
mathisfun123 wrote: post #33

Earlier quoted context omitted.

> March 9, 2023 This is a new account? > no competence in. I have a PhD in ML compilers (one of my papers is cited on the site I linked) and as I mentioned in the previous "discussion" I currently work in FAANG as an ML compiler engineer. But thanks for playing :)

Is your thesis published and at a URL? Since I'm an old parallelizing compilers person, I'm curious what you did. (genuinely curious, not obnoxiously curious). You should know a serious fraction of folks commenting on these threads have resumes like you're bragging about.

> Is your thesis published and at a URL

yes but i'm not going to link it here in order to preserve my anonymity

> You should know a serious fraction of folks commenting on these threads

not because i'm not aware there aren't lots of people with PhDs in tech, but because generally the comments on hn are from outsider wannabes

Re: Why study Diophantine equations?

#38

Post by jjtheblunt »

mathisfun123 wrote: post #37
jjtheblunt wrote: post #36

Earlier quoted context omitted.

Is your thesis published and at a URL? Since I'm an old parallelizing compilers person, I'm curious what you did. (genuinely curious, not obnoxiously curious). You should know a serious fraction of folks commenting on these threads have resumes like you're bragging about.

> Is your thesis published and at a URL yes but i'm not going to link it here in order to preserve my anonymity > You should know a serious fraction of folks commenting on these threads not because i'm not aware there aren't lots of people with PhDs in tech, but because generally the comments on hn are from outsider wannabes

definitely increasingly over the last years from outsider folks, agreed. lots of obnoxious sniping nonsense over the last few years too.

anyway, fun stuff for folks like us otherwise still

Post reply on HN