Combinatorics and Complexity

During Academic year 2017-18, the CMSA will be hosting a Program on Combinatorics and Complexity.  This year will be organized by Noga Alon, Boaz Barak, Jacob Fox, Madhu Sudan, Salil Vadhan, and Leslie Valiant.

Combinatorics and Computational Complexity have enjoyed a rich history of interaction leading to many significant developments in the two fields, such as the theories of NP-completeness, expander graphs, pseudorandomness, and property testing. Lately these fields have seen many new points of intersection such as in the development of the polynomial method (used, for example, in recent advances on the cap-set problem as well as in development of optimal list-decodable codes), the method of interlacing families of polynomials (yielding Ramanujan graphs and the resolution of the Kadison-Singer problem), and the theory of randomness extractors (yielding explicit constructions of Ramsey graphs).  This special program will bring together experts in the fields to collaborate, to learn about the latest advances in the area, and to forge new connections.

The program will include a series of workshops in the intersection of the two fields. These four workshops will be on: 

There will also be a weekly seminar held every Friday from 1:00-4:00pm in room G10. A list of speakers and seminar topics can be found on the Combinatorics and Complexity seminar page.

Participation: Researchers interested in participating in the special year through a short- or long-term visit to CMSA are encouraged to contact the organizers through the CMSA Administrative Coordinator, Sarah LaBauve (  Each of the workshops is also open to participation by all interested researchers subject to capacity. Registration forms can be found on the webpages for the individual workshops. 

A list of lodging options convenient to the Center can also be found on our recommended lodgings page.

In addition, the program will feature a series of public lectures held at Askwith Hall in the Harvard Graduate School of Education. The scheduled speakers are:

Date Name Title
09-07-17 Noga Alon


Title: Graph Coloring: Local and Global

Abstract: Graph Coloring is arguably the most popular subject in Discrete Mathematics, and its combinatorial, algorithmic and computational aspects have been studied intensively. The most basic notion in the area, the chromatic number of a graph, is an inherently global property. This is demonstrated by the hardness of computation or approximation of this invariant as well as by the existence of graphs with arbitrarily high chromatic number and no short cycles. The investigation of these graphs had a profound impact on Graph Theory and Combinatorics. It combines
combinatorial, probabilistic, algebraic and topological techniques with number theoretic tools. I will describe the rich history of the subject focusing on some recent results.

11-02-17 Jennifer Chayes


02-01-2018 Jacob Fox


03-20-18 Dan Spielman




Combinatorics will also be featured in this year’s Ahlfors Lecture Series, given by Timothy Gowers (University of Cambridge) on October 11-12. For more information on this Harvard lecture series, please click here.