You are currently browsing the tag archive for the ‘theoretical computer science’ 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.

### Recent Comments

 Math Genius: Spectra… on 254A, Lecture 11: Compact… ClemensB on Additive combinatorics Anonymous on Analysis I Anonymous on Analysis I Jason Zhao on The Guth-Katz bound on the Erd… Zcp on Einstein’s derivation of… Anonymous on Analysis I Z Liu on An introduction to measure… Who can learn math?… on Does one have to be a genius t… Karim Taha on Analysis I trucupey on The uncertainty principle Anonymous on The Collatz conjecture, Little… Bob Copeland on Sign patterns of the Mobius an… Las herramientas mat… on Compressed sensing and single-… Anonymous on Almost all Collatz orbits atta…