• Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

–
Coffee and Check-In
–
Opening Remarks
–
Solvability of Systems of Polynomial Equations over Finite Fields
Neeraj Kayal (Microsoft Research India)
–
Break
–
A Complexity Theory for Constructible Functions and Sheaves
Saugata Basu (Purdue University)
–
Lunch
–
Sign Conditions for Injectivity of Generalized Polynomial Maps with Applications to Chemical Reaction Networks and Real Algebraic Geometry
Anne Shiu, Texas A&M University
–
Break
–
Identifiability of Viscoelastic Mechanical Systems
Nikki Meshkat, North Carolina State University
–
Matrix Completion for the Independence Model
Kaie Kubjas (Aalto University)
–
Polynomial Systems Arising in the Study of Biochemical Reaction Networks
Alicia Dickenstein, Universidad de Buenos Aires
–
Reception
–
Coffee and Check-In
–
Advances in Numerical Algebraic Geometry with Applications
Charles Wampler, General Motors Research and Development Center
–
Break
–
Numerical Algebraic Geometry for Maximum Likelihood Estimation
Jose Rodriguez (North Carolina State University)
–
Computing Tropical Curves Using Homotopy Continuation
Anton Leykin (Georgia Institute of Technology)
–
Generalized Mixed Volume of Polynomial Systems
Matthew Niemerg (IBM Postdoctoral Fellow)
–
Lunch
–
Arithmetic Nullstellensätze and Applications
Teresa Krick (Universidad de Buenos Aires)
–
Break
–
Characterization of the Affine Solutions of Sparse Polynomial Systems
María Isabel Herrero (Pontificia Universidad Católica Argentina)
–
Bertini_real: Software for Real Algebraic Sets
Daniel Brake, University of Notre Dame
–
Certifying Solutions to Overdetermined and Singular Polynomial Systems over Q
Agnes Szanto, North Carolina State University
–
Coffee and Check-In
–
On the Critical Point Method and Deciding Connectivity Queries in Real Algebraic Sets: From Theory to Practice
Mohab Safey El Din, Université Pierre et Marie Curie
–
Break
–
Real Algebraic Geometry in Computational Game Theory
Peter Bro Miltersen, Aarhus University
–
On the Intersection of a Sparse Curve and a Low-degree Curve: A Polynomial Version of the Lost Theorem
Sébastien Tavenas, École Normale Supérieure de Lyon
–
Descartes' Rule of Signs for Polynomial Systems Supported on Circuits
Frédéric Bihan, Université de Savoie
–
Lunch
–
Reconstruction of Algebraic-exponential Data from Moments and Solving a Generalized Lowner-John Problem
Jean-Bernard Lasserre, CNRS - Toulouse
–
Break
–
Chordal Structure and Polynomial Systems
Pablo Parrilo (Massachusetts Institute of Technology)
–
Families of Anticommuting Matrices and the Sum of Squares Problem
Pavel Hrubeš, Academy of Sciences of the Czech Republic
–
Degree of Central Curve in Quadratic Programming
Serkan Hosten (San Francisco State University)
–
Coffee and Check-In
–
A Taxonomy of Fixed Point Computation Problems for Algebraically-Defined Functions, and their Computational Complexity
Kousha Etessami, University of Edinburgh
–
Break
–
On the Complexity of Solving Bivariate Systems
Éric Schost, Western University
–
Recent Progress on Computing Groebner Bases
Shuhong Gao, Clemson University
–
Mixed Volume Computation in (another) Mixed Volume Time
Gregorio Malajovich (Universidade Federal do Rio de Janeiro)
–
Lunch
–
Solving Polynomial Equations in Smoothed Polynomial Time
Peter Bürgisser (TU Berlin)
–
Break
–
A Theory of Complexity, Condition and Roundoff
Felipe Cucker, City University of Hong Kong
–
Some Results and Questions as to the Complexity of the (Eigenvalue, Eigenvector) Problem
Michael Shub (City University of New York)