Math 205A: Complex Analysis — Winter 2018

(ARCHIVED)

Welcome to the Math 205A course portal.

Quick information

• Instructor: Dan Romik
• Lecture times and place: MWF 1:10-2, Bainer 1134
• Office hours time and place: F 10:30-11:30, MSB 2218
• Final exam time and place: M 03/19 at 3:30-5:30, Bainer 1134
• Course textbook: Complex Analysis by Elias M. Stein and Rami Shakarchi. Princeton University Press, 2003.
• Course syllabus: click to download (PDF)

Homework assignments

• Problem Set 0
• Problem Set 1
• Problem Set 2
• Problem Set 3
• Problem Set 4
• Problem Set 5
• Problem Set 6
• Problem Set 7
• Problem Set 8

Course lecture notes

• Course lecture notes (PDF, 1.4 MB; last updated April 20, 2018)

Other recommended reading

Here is a list of links to some of my favorite complex analysis-related papers.

• D. Zagier. Newman's short proof of the prime number theorem. Amer. Math. Monthly 104 (1997), 705–708. A classic complex analysis paper, discussed in detail in section 16 in my lecture notes.
• B. de Smit, H. W. Lenstra Jr. Artful mathematics: the legacy of M.C. Escher. Notices of the Amer. Math. Soc. 50 (2003), 446–457. A beautiful article about connections between complex analysis and the work of M. C. Escher.
• H. Cohn. A conceptual breakthrough in sphere packing. Notices of the Amer. Math. Soc. 64 (2017), 102–115. Another beautiful paper about an amazing recent application of complex analysis to solve a longstanding open problem in geometry.
• H. Duminil-Copin, S. Smirnov. The connective constant of the honeycomb lattice equals sqrt(2+sqrt(2)). Ann. Math. 175 (2012), 1653–1665. This paper uses very basic ideas from complex analysis in an extremely clever way to prove a conjecture from 1982 about the asymptotic number of self-avoiding walks in the hexagonal lattice.
• A proof of the Hardy-Ramanujan formula. An unpublished expository note I wrote around 2003.