You are currently browsing the tag archive for the ‘extension theorems’ tag.

The first Distinguished Lecture Series at UCLA of this academic year is being given this week by my good friend and fellow Medalist Charlie Fefferman, who also happens to be my “older brother” (we were both students of Elias Stein). The theme of Charlie’s lectures is “Interpolation of functions on ${\Bbb R}^n$“, in the spirit of the classical Whitney extension theorem, except that now one is considering much more quantitative and computational extension problems (in particular, viewing the problem from a theoretical computer science perspective). Today Charlie introduced the basic problems in this subject, and stated some of the results of his joint work with Bo’az Klartag; he will continue the lectures on Thursday and Friday.

The general topic of extracting quantitative bounds from classical qualitative theorems is a subject that I am personally very fond of, and Charlie gave a wonderfully accessible presentation of the main results, though the actual details of the proofs were left to the next two lectures.

As usual, all errors and omissions here are my responsibility, and are not due to Charlie.

 Marco Barone on Heuristic computation of corre… Anonymous on Heuristic computation of corre… Heuristic computatio… on Derived multiplicative functio… Heuristic computatio… on 254A, Supplement 4: Probabilis… Heuristic computatio… on 254A, Notes 8: The Hardy-Littl… Heuristic computatio… on A wave equation approach to au… Yuval Filmus on Notes on the “slice rank… Anonymous on 245C, Notes 3: Distributi… Paul on Notes on the Bombieri asymptot… Robert Schneider on Notes on the Bombieri asymptot… Tao Chi on Finite time blowup for an aver… giorgi on A remark on the lonely runner… Miklos Kontra on The Collatz conjecture, Little… random reader on It ought to be common knowledg… Dejan Kovacevic on Finite time blowup for Lagrang…