Workshop description
Part of the workshop is devoted to complexity issues for numerical equation solving and optimization (in particular, condition numbers and probabilistic analysis of real number algorithms, distribution of real zeros of random systems, point distribution in manifolds, deterministic and random (real or complex) algebraic geometry). Another focus of the workshop is on various aspects of algebraic and computational complexity (e.g. Blum-Shub-Smale as well as Valiant's model). As in the previous FoCM conferences, Computational Algebraic Geometry will be covered by another workshop, although there shall be a great interest in the audience towards this topic, too.
Speakers
Semi-plenary speakers
- Cartis, Coralia - University of Oxford, UK
- Lerario, Antonio - SISSA (Trieste), Italy
Invited speakers
- Armentano, Diego - Universidad de La República, Uruguay
- Baldi, Lorenzo - Sorbonne Université, France
- Blekherman, Greg - Georgia Tech, USA
- Bürgisser, Peter - TU Berlin, Germany
- Cucker, Felipe - City University of Honk Kong, Hong Kong
- Gharan, Shayan - University of Washington, USA
- Kozhasov, Kazhgali - Technische Universität Braunschweig, Germany
- Lairez, Pierre - Inria Saclay Île-de-France, France
- Malajovich, Gregorio - Universidade Federal do Rio de Janeiro, Brasil
- Miltzow, Tillmann - Utrecht University, Netherlands
- Pouly, Amaury - CNRS Paris, France
- Riener, Cordian - Artic University of Norway, Norway
- Rojas, Maurice - Texas A&M, USA
- Roschina, Vera - UNSW Sidney, Australia
- Shub, Michael - The City College University of New York, USA
- Tavenas, Sébastien - Université Savoie Mont Blanc, France
- Yakoubsohn, Jean-Claude - Université de Toulouse, France
Preliminary program
This schedule is preliminary and could be updated.
Thursday, June 15
| 14:00 ~ 14:30 | New developments on the existential theory of the reals. Till Miltzow - Utrecht University, Netherlands |
| 14:30 ~ 15:00 | The Wonderful Geometry of the Vandermonde map Cordian Riener - UiT The Arctic University of Norway, Norway |
| 15:00 ~ 15:30 | Matrix decompositions with Newton's method Jean-Claude Yakoubsohn - Institut de Mathématiques de Toulouse, France |
| 15:30 ~ 16:00 | Characterisations of good convex cones Vera Roshchina - UNSW Sydney, Australia |
| 16:30 ~ 17:30 | Tensor methods for nonconvex optimization Coralia Cartis - University of Oxford, United Kingdom |
| 17:30 ~ 18:00 | Strongly Rayleigh distributions and Applications in Algorithm Design Shayan Oveis Gharan - University of Washington, USA |
Friday, June 16
| 14:00 ~ 14:30 | Geometry and Complexity of Binomial Inequalities in Combinatorics Greg Blekherman - Georgia Tech, US |
| 14:30 ~ 15:00 | The zonoid algebra and random intersections in symmetric spaces Peter Bürgisser - TU Berlin, Germany |
| 15:00 ~ 15:30 | Minimal Euclidean Distance degree of Segre-Veronese varieties Khazhgali Kozhasov - TU Braunschweig, Germany |
| 15:30 ~ 16:00 | On the complexity of sparse polynomial solving. Gregorio Malajovich - Universidade Federal do Rio de Janeiro, Brazil |
| 16:30 ~ 17:00 | Complexity in Polynomial Optimization: Asymptotic Convergence, Flat Trucation and Semidefinite Programming Lorenzo Baldi - Sorbonne University, France |
| 17:00 ~ 17:30 | Superpolynomial lower bounds for circuits of constant depth Sébastien Tavenas - CNRS, Université Savoie Mont Blanc, France |
Saturday, June 17
| 14:00 ~ 14:30 | Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems Pierre Lairez - Inria, France |
| 14:30 ~ 15:00 | Rigid continuation paths II. structured polynomial systems Felipe Cucker - City University of Hong Kong, Hong Kong |
| 15:00 ~ 16:00 | Optimal transport between algebraic hypersurfaces Antonio Lerario - SISSA and KTH, Italy and Sweden |
| 16:30 ~ 17:00 | On a general Kac-Rice formula for the measure of a level set Diego Armentano - Universidad de la República, Uruguay |
| 17:00 ~ 17:30 | On the Average-Case Complexity of Real Feasibility for Circuit Hypersurfaces J. Maurice Rojas - Texas A&M University, USA |
| 17:30 ~ 18:00 | The condition number in complexity theory Michael Shub - CUNY, USA |
Posters
- A geometric condition number for nonlinear underdetermined systems
Nick Dewaele - KU Leuven, Belgium - Real-number Computability from the Perspective of Computer Assisted Proofs in Analysis
Małgorzata Moczurad - Jagiellonian University, Poland - What is the probability that a random symmetric tensor is close to rank-one?
Andrea Rosana - SISSA , Italy - On the analytic Morse-Sard property for the endpoint maps in Carnot groups.
Daniele Tiberio - SISSA, Trieste, Italy - Condition-based Bounds on the Number of Real Zeros
Josue Tonelli-Cueto - The University of Texas at San Antonio, United States