The Mathematics Community on Google+ had our second ever Hangout On Air last week. I was joined by Luis Guzman, Jason Davison, and Amy Robinson in a conversation that ranged from fluid dynamics to applying the mathematics of networks to map our ideas to JPEG image compression. (We shared links live to the Event Page for the Hangout during our conversation.)
Here are a few of my favorite topics we touched on during the hangout.
The mathematics of networks of people and ideas
Amy described her interest in creating networks to discover hidden relationships - networks of people and networks of ideas. She used Quid and other technologies to create a network from “30 Moleskine notebooks, 3.5G or 756 voice memos, 6,000 Tweets and gigs of autotune on t-payne (don’t judge).” You can read more about Amy’s ambitious project on her blog, including a talk she gave for Quantified Self at Stanford.
If you want to do some social network number crunching yourself, Wolfram Alpha can analyze your Facebook and compute a sophisticated report of your interactions.
Jason showed us a wild video demonstrating the behavior of a very low Reynolds number fluid. We can describe the behavior of fluids with the famous Navier-Stokes equations from fluid dynamics. Since fluids are so common (think of all the reasons you’d want to describe air or water), the Navier-Stokes equations are extraordinarily important.
Despite it’s importance, mathematicians still haven’t even figured out if solutions exist. In January, Mukhtarbay Otelbaev, Director of the Eurasian Mathematical Institute of the Eurasian National University, claimed to have a solution to the Navier–Stokes existence and smoothness problem. Mathematicians are still checking his work. There seems to be some reason to be skeptical that the proof is correct.
Millennium Prize Problems of the Clay Mathematics Institute
But if Otelbaev really has solved the Navier-Stokes existence and regularity problem, then the Clay Mathematics Institute will award him a $1 million prize for solving one of seven Millenium Problems. These famous problems are extraordinarily difficult.
Fourier series and wavelets
We talked about a beautiful circle of ideas related to Fourier series. Fourier series are a way of decomposing a signal (think the graph of a function) into sines and cosines.
This way of representing a signal is incredibly useful. If we truncate the infinite sum, we get an approximation to $f(x)$. We can use this to compress our signal. This is how the JPEG digital image format compresses images, for example.
More mathematical readers will notice that we are actually talking about a constellation of ideas involving Fourier series, the discrete Fourier transform, and the fast Fourier transform.
Newer digital image compression technologies (such as the JPEG 2000 standard) use wavelets instead of Fourier series. While sines and cosines are periodic functions, wavelets are localized “bumps.” Here’s an example:
We can reproduce signals by adding up shifts and scales of this bump.
If you’d like to learn more about using Fourier series and wavelets to compress digital images, check out this AMS web essay by David Austin titled, “Image Compression: Seeing What’s Not There.”