Ch. 1. Expository Articles
1.1. Quantum mechanics and Tomb Raider
1.2. Compressed sensing and single-pixel cameras
1.3. Soft analysis, hard analysis, and the finite convergence principle
1.4. Lebesgue differentiation theorem and the Szemeredi regularity lemma
1.5. Ultrafilters, non-standard analysis, and epsilon management
1.7. "Math doesn't suck", and the Chayes-McKellar-Winn theorem
1.8. Nonfirstorderisability
1.9. Amplification, arbitrage, and the tensor power trick
1.10. crossing number inequality
1.12. Unipotent elements of the Lorentz group, and conic sections
1.13. Jordan normal form and the Euclidean algorithm
1.14. John's blowup theorem for the non-linear wave equation
1.15. Hilbert's Nullstellensatz
1.16. Hahn-Banach theorem, Menger's theorem, and Belly's theorem
1.17. Einstein's derivation of E = mc[superscript 2]
2.1. Simons Lecture Series: Structure and randomness
2.2. Ostrowski Lecture: The uniform uncertainty principle and compressed sensing
2.3. Milliman Lecture Series: Recent developments in arithmetic combinatorics
3.1. Best bounds for cap sets
3.2. Non-commutative Freiman theorem
3.3. Mahler's conjecture for convex bodies
3.4. Why global regularity for Navier-Stokes is hard
3.5. Scarring for the Bunimovich stadium
3.6. Triangle and diamond densities in large dense graphs
3.7. What is a quantum honeycomb?
3.8. Boundedness of the trilinear Hilbert transform
3.9. Effective Skolem-Mahler-Lech theorem
3.10. parity problem in sieve theory
3.11. Deterministic RIP matrices
3.12. non-linear Carleson conjecture.
