|
Lecture 1 -
Lecture 1 states the problems, defines a relevant family of convex sets, and establishes their basic properties.
Tuesday, Nov 13, 2:00 PM, MS 6627
Lecture 2 -
Lecture 2 explains a main lemma on the family of convex sets from the first lecture, and relates the main lemma to the problems at hand.
Thursday, Nov 15, 2 PM, MS 6627
Lecture 3 -
Lecture 3 introduces the relevant tools from computer science, and ends by discussing two unsolved problems.
Friday, Nov 16, 2 PM, MS 6627
Notes:
1. Warmup Seminar to be held Nov. 6 at 4:30 in MS 6621 (UCLA Participating Analysis Seminar, see http://www.math.ucla.edu/events/seminars/pa.shtml). background topics to be covered include the Whitney Extension Theorem.
2. Research to be discussed in lectures is available at the links below. Other papers available at http://www.math.princeton.edu/facultypapers/Fefferman/.
Research Papers: Fitting a Cm-Smooth Function to Data II & III.
|
Charles Fefferman