Several results in algorithms and combinatorics are obtained by the probabilistic method: one analyzes a random structure and shows that it has the desired properties with nonzero probability. This workshop will focus on recently developed techniques based on the geometry of polynomials (for instance, the method of interlacing families of polynomials), which are sometimes able to beat traditional probabilistic analyses and establish the existence of rare objects that were previously out of reach. We will also have talks on nearby topics, such as discrepancy theory, approximation algorithms and high dimensional combinatorics, with the goal of finding new applications of these techniques.
Registration is required to attend this workshop. To submit your name for consideration, please register and await confirmation of your acceptance to the workshop before booking your travel. Space may be limited, and you are advised to register early.
Dimitris Achlioptas (UC Santa Cruz), Bibhas Adhikari (IIT Kharagpur), Karim Adiprasito (Hebrew University of Jerusalem), AmirMahdi Ahmadinejad (Stanford University), Nima Anari (Stanford University), Federico Ardila (San Francisco State University), Octavio Arizmendi (CIMAT), Nikhil Bansal (Eindhoven University of Technology), Alexander Barvinok (University of Michigan), Marie-Charlotte Brandenburg (Freie Universität Berlin), Johannes Buchmann (TU Darmstadt), Sarah Cannon (UC Berkeley), Charlie Carlson (University of Colorado Boulder), Yeshwanth Cherapanamjeri (UC Berkeley), Benoit Collins (Kyoto University), Péter Csikvári (Eötvös Loránd University), Ewan Davies (QuSoft, CWI and University of Amsterdam), Anthony Della Pella (University of Michigan), Papri Dey (Max Planck Institute (MIS, Leipzig), Farzam Ebrahimnejad (University of Washington), Shirshendu Ganguly (UC Berkeley), F Alberto Grunbaum (UC Berkeley), Leonid Gurvits (City University of New York), Olga Holtz (UC Berkeley and Technische Universität Berlin), June Huh (IAS), Fotis Iliopoulos (UC Berkeley), Katharina Victoria Jochemko (KTH Royal Institute of Technology), Ravi Kannan (Microsoft Research India), Tali Kaufman (Bar-Ilan University), Alexandra Kolla (University of Colorado Boulder), Rasmus Kyng (Harvard University), Rachel Lawrence (UC Berkeley), Jonathan Leake (UC Berkeley), Kuikui Liu (University of Washington), Jingcheng Liu (UC Berkeley), Shachar Lovett (UC San Diego), Rafael Mendes de Oliveira (University of Toronto), Marcus Michelen (University of Pennsylvania), Rad Niazadeh (Stanford University), Ryan O'Donnell (Carnegie Mellon University), Izhar Oppenheim (Ben-Gurion University), Yuval Peled (New York University), Will Perkins (University of Illinois at Chicago), Prasad Raghavendra (UC Berkeley), Mohan Ravichandran (Mimar Sinan University), Guus Regts (University of Amsterdam), Jim Renegar (Cornell University), Zvi Rosen (Florida Atlantic University), Nick Ryder (UC Berkeley), Amin Saberi (Stanford University), Peter Sarnak (IAS), Alistair Sinclair (UC Berkeley), Rainer Sinn (Freie Universität Berlin), Nikhil Srivastava (UC Berkeley), Piyush Srivastava (Tata Institute of Fundamental Research), Daniel Stefankovic (University of Rochester), Bernd Sturmfels (UC Berkeley), Levent Tunçel (University of Waterloo), Cynthia Vinzant (North Carolina State University), Jan Vondrák (Stanford University), David Wagner (University of Waterloo), Yitong Yin (Nanjing University)
The workshops in the "Geometry of Polynomials" program are supported in part by the National Science Foundation under Award No. 1835986.
We are required by the NSF Proposal & Award Policies & Procedures Guide (Chapter II.E.7), effective January 28, 2019, to provide all event participants with information on the University’s policy on sexual and other forms of harassment or sexual assault as well as directions on how to report any violations of this policy. For purposes of this requirement, “other forms of harassment” is defined as “non-gender or non-sex-based harassment of individuals protected under federal civil rights laws, as set forth in organizational policies or codes of conduct, statutes, regulations, or executive orders.” This information is available here.