111–120 of 145 posts
I did state though that all second derivatives of u would have L^p norms bounded by that of the Laplacian. Kleinermann asked me for an elementary explanation of this, but I couldn't think of one. I haven't the foggiest idea of what an "elementary explanation" of anything during a math graduate degree committee assessment would even sound like.
so has he accomplished anything big/groundbreaking other than being a child prodigy and having a high iq? serious question. i only know his name for being smart. not anything specific
I will implore you or anyone to ask ChatGPT to “eli5 compressive sensing”. It was a fun honeymoon day for me with ChatGPT when I did that.
There’s a big long list of these in https://web.math.princeton.edu/generals/ , not just Tao’s.
Bhargava's one is fun to read: https://web.math.princeton.edu/generals/bhargava_manjul
This seems a great way for system design interviews. Interviewer: what do you know about transactions? Candidate: Transactions can be serializable. Interviewer: great, tell me the difference between final state serializability and view state serializability and prove that they are the same if neither of them has dead step. Candidate: yada yada yada. Interviewer: Can you tell me how to use such concepts in implementin…
Earlier quoted context omitted.
My favorite? When Von Neumann(an Austrian aristocrat) walked into his oral exam, Hilbert asked another of the admistrators who his tailor was.
> Von Neumann(an Austrian aristocrat) Usually Von Neumann is thought to be Hungarian. Born in Budapest, which at the time was part of the Austro-Hungarian Empire.
Earlier quoted context omitted.
My favorite? When Von Neumann(an Austrian aristocrat) walked into his oral exam, Hilbert asked another of the admistrators who his tailor was.
> Von Neumann(an Austrian aristocrat) Usually Von Neumann is thought to be Hungarian. Born in Budapest, which at the time was part of the Austro-Hungarian Empire.
Funny, because he received the Fields medal 1o years later for "his contributions to partial differential equations, combinatorics, harmonic analysis and additive number theory". So either his knowledge wasn't that bad or he is a very quick learner. ;)
Earlier quoted context omitted.
Bhargava's one is fun to read: https://web.math.princeton.edu/generals/bhargava_manjul
I noticed that Evan O’Dorney’s generals was chaired by Bhargava and this question was asked: What is Brauer's theorem? [I had no idea and they moved on] He clearly should have read Bhargava’s generals, where Andrew Wiles asks Bhargava the same question!
Worst case I've seen of this was when I was in 9th grade and our geometry teacher required us to memorize the chapter and section names of theorems in the book when proving. For example, in our proofs about triangles, we had to write "theorem 12.5" or else we wouldn't get credit on the test, and here 12.5 was the chapter and section number in the particular textbook, which is an utterly useless piece of info.
Of course, the name Brauer is not nearly as useless as a chapter name, but still being familiar with math history probably shouldn't be hard requirement for being a professional mathematician.
Earlier quoted context omitted.
I'm not familiar either, but here they are talking about graduate students [0]. I guess it's a sort of final cumulative exam at the end of the programme. [0] https://web.math.princeton.edu/generals/
The exams would be at the beginning to middle of the program.
This seems a great way for system design interviews. Interviewer: what do you know about transactions? Candidate: Transactions can be serializable. Interviewer: great, tell me the difference between final state serializability and view state serializability and prove that they are the same if neither of them has dead step. Candidate: yada yada yada. Interviewer: Can you tell me how to use such concepts in implementin…