Workshops

Fall 2014

Solving Polynomial Equations

Oct 13, 2014 to Oct 16, 2014

Return to event »

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

All events take place in the Calvin Lab Auditorium.

Monday, October 13th, 2014
9:00 am–9:20 am		Coffee and Check-In
9:20 am–9:30 am		Opening Remarks
9:30 am–10:30 am		Solvability of Systems of Polynomial Equations over Finite Fields Neeraj Kayal, Microsoft Research India
10:30 am–11:00 am		Break
11:00 am–12:00 pm		A Complexity Theory for Constructible Functions and Sheaves Saugata Basu, Purdue University
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Sign Conditions for Injectivity of Generalized Polynomial Maps with Applications to Chemical Reaction Networks and Real Algebraic Geometry Anne Shiu, Texas A&M University
3:00 pm–3:30 pm		Break
3:30 pm–3:55 pm		Identifiability of Viscoelastic Mechanical Systems Nikki Meshkat, North Carolina State University
4:00 pm–4:25 pm		Matrix Completion for the Independence Model Kaie Kubjas, Aalto University
4:35 pm–5:00 pm		Polynomial Systems Arising in the Study of Biochemical Reaction Networks Alicia Dickenstein, Universidad de Buenos Aires
5:00 pm–6:00 pm		Reception

Tuesday, October 14th, 2014
8:30 am–9:00 am		Coffee and Check-In
9:00 am–10:00 am		Advances in Numerical Algebraic Geometry with Applications Charles Wampler, General Motors Research and Development Center
10:00 am–10:30 am		Break
10:30 am–10:55 am		Numerical Algebraic Geometry for Maximum Likelihood Estimation Jose Rodriguez, University of Notre Dame
11:00 am–11:25 am		Computing Tropical Curves Using Homotopy Continuation Anton Leykin, Georgia Institute of Technology
11:35 am–12:00 pm		Generalized Mixed Volume of Polynomial Systems Matthew Niemerg, Colorado State University
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Arithmetic Nullstellensätze and Applications Teresa Krick, Universidad de Buenos Aires and CONICET
3:00 pm–3:30 pm		Break
3:30 pm–3:55 pm		Characterization of the Affine Solutions of Sparse Polynomial Systems María Isabel Herrero, Universidad de Buenos Aires
4:00 pm–4:25 pm		Bertini_real: Software for Real Algebraic Sets Daniel Brake, University of Notre Dame
4:35 pm–5:00 pm		Certifying Solutions to Overdetermined and Singular Polynomial Systems over Q Agnes Szanto, North Carolina State University

Wednesday, October 15th, 2014
8:30 am–9:00 am		Coffee and Check-In
9:00 am–10:00 am		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
10:00 am–10:30 am		Break
10:30 am–10:55 am		Real Algebraic Geometry in Computational Game Theory Peter Bro Miltersen, Aarhus University
11:00 am–11:25 am		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
11:35 am–12:00 pm		Descartes' Rule of Signs for Polynomial Systems Supported on Circuits Frédéric Bihan, Université de Savoie
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Reconstruction of Algebraic-exponential Data from Moments and Solving a Generalized Lowner-John Problem Jean-Bernard Lasserre, CNRS - Toulouse
3:00 pm–3:30 pm		Break
3:30 pm–3:55 pm		Chordal Structure and Polynomial Systems Pablo Parrilo, Massachusetts Institute of Technology
4:00 pm–4:25 pm		Families of Anticommuting Matrices and the Sum of Squares Problem Pavel Hrubeš, Academy of Sciences of the Czech Republic
4:35 pm–5:00 pm		Degree of Central Curve in Quadratic Programming Serkan Hosten, San Francisco State University

Thursday, October 16th, 2014
8:30 am–9:00 am		Coffee and Check-In
9:00 am–10:00 am		A Taxonomy of Fixed Point Computation Problems for Algebraically-Defined Functions, and their Computational Complexity Kousha Etessami, University of Edinburgh
10:00 am–10:30 am		Break
10:30 am–10:55 am		On the Complexity of Solving Bivariate Systems Éric Schost, Western University
11:00 am–11:25 am		Recent Progress on Computing Groebner Bases Shuhong Gao, Clemson University
11:35 am–12:00 pm		Mixed Volume Computation in (another) Mixed Volume Time Gregorio Malajovich, Universidade Federal do Rio de Janeiro
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Solving Polynomial Equations in Smoothed Polynomial Time Peter Bürgisser, Technische Universität Berlin
3:00 pm–3:30 pm		Break
3:30 pm–3:55 pm		A Theory of Complexity, Condition and Roundoff Felipe Cucker, City University of Hong Kong
4:00 pm–4:25 pm		Some Results and Questions as to the Complexity of the (Eigenvalue, Eigenvector) Problem Michael Shub, City University of New York