|
|
|
Laurent Demanet
|
Szego Assistant Professor
Mathematics
|
|
|
|
|
What Was New?
|
-
Given a finite set of scattered point values, the Whitney extension
problem is to find lower bounds on the derivatives of all smooth functions
passing through those points. Charles Fefferman recently made progress on
this tough math problem. While not all engineers may care, high-level
mathematics flirting with the limits of sampling theory — or how
simple a continuous model can explain data — is rare enough to be
noticed. Link added September 2006. The
paper in Annals of Mathematics.
- The Fields medal to Tao, Okounkov, Perelman and Werner. The Nevanlinna prize to Kleinberg. The Gauss prize to Ito (of the Ito calculus). August 2006.
- Perhaps the first conclusive numerical simulation of a binary black hole merger, by J.G. Baker and collaborators, February 2006. The paper on ArXiv.
-
Quantum chemistry is scientific computing in high dimensions. Some insights from applied mathematics to break the complexity of the full Schroedinger equation, without ``modeling'' or choice of basis functions:
- Separated Representations, by G. Beylkin, M. Mohlenkamp, R. Harrison and collaborators. Link added April 2005. The project webpage.
- Sparse Grids, by H. Yserentant. Link added July 2005. One paper.
-
Analyzing the US political landscape with mathematics looks like a good recipe to get media attention:
- Statistical ``proof'' that the range of political opinions in the US is truly one-dimensionalat least in the Supreme Court. A study of the (dis)agreements among justices, by L. Hubert and D. Steinley, September 2005.
- Network visualization of the ties between the congressional committees, by M. Porter et al., May 2005. The ScienceNOW news release.
- How to skew the US electoral map to make the area proportional to population, by M. Gastner, C. Shalizi, and M. Newman, November 2004.The project webpage.
- In the news: Peter Lax to Receive Abel Prize, March 2005.
- Robust uncertainty principles: how to recover a sparse sequence from its very incomplete spectrum, by E. Candes, J. Romberg and T. Tao, May 2004. Many extensions have been considered since then by E. Candes, D. Donoho and their collaborators, in particular on sparse solutions of large underdetermined systems.
- Statistically optimal and computationally fast detection of filamentary and sheet-like structures in 3-D point clouds, by D. Donoho, April 2004. (Professor Donoho, please come back soon and write a beautiful theory.)
- Computational geometric mechanics: how to consistently discretize and integrate PDE's with strong geometric structure, by M. Leok, 2003. PDF.
- A Fast Multipole Method based only on point evaluations of the kernel, by L. Ying, G. Biros, and D. Zorin, October 2003. PDF.
- Primes is in P! A deterministic polynomial-time algorithm to determine whether a number is prime or composite. By Agrawal, Kayal and Saxena, August 2002.
- Near-optimal computation of the Fourier transform in O(polylog(N)), without even browsing all the data. By A. Gilbert et al., 2002. Homepage.
- One-bit sigma-delta quantization of bandlimited signals is exponentially accurate. By S. Gunturk, 2002. Homepage.
|
|
|
|
|