Special sessions

Symbolic and Numerical Computation with Polynomials

Organizers:

  • Diego Armentano, Universidad de la Republica, Uruguay
  • Matias R. Bender, Technische Universitaet Berlin, Germany
  • Alperen A. Ergur, University of Texas at San Antonio, USA
  • Josue Tonelli-Cueto, Inria Paris and IMJ-PRG, France

Contact organizer:

  • Matias R. Bender, Technische Universitaet Berlin, Germany, This email address is being protected from spambots. You need JavaScript enabled to view it. 

Schedule:

  • Wedsnesday 14, 11:00 to 16:00 UTC-3.
  • Friday 16, 11:00 to 16:00 UTC-3.
  • Wednesday 21, 16:00 to 21:00 UTC-3.

Wednesday, July 14, 11:00 ~ 16:00
11:00 ~ 11:30 A new algorithm for the equidimensional decomposition of affine varieties given by sparse polynomials
María Isabel Herrero - UBA - CONICET, Argentina
13:00 ~ 13:30 Symbolic vs Numerical: Allies or Enemies?
Josué Tonelli-Cueto - Inria Paris & IMJ-PRG, France
13:30 ~ 14:00 Bounds for degrees of syzygies
Carlos D'Andrea - Universitat de Barcelona, Spain
14:00 ~ 14:30 Computing efficiently the non-properness set of polynomial maps on the plane
Elias Tsigaridas - Inria Paris, France
14:30 ~ 15:00 Distance to the stochastic part of phylogenetic varieties
Marina Garrote-López - Universitat Politècnica de Catalunya, Spain
15:00 ~ 15:30 Approaching equidistribution through Determinantal Point Processes.
Ujué Etayo - Universidad de Cantabria, Spain
15:30 ~ 16:00 Weak identifiability of differential algebraic equation systems
Gabriela Jeronimo - Universidad de Buenos Aires, Argentina
Friday, July 16, 11:00 ~ 16:00
11:30 ~ 12:00 General witness sets
Frank Sottile - Texas A&M University, USA
12:00 ~ 12:30 Rigid homotopy and structured polynomial systems
Felipe Cucker - City University of Hong Kong, Hong Kong
12:30 ~ 13:00 Numerical homotopies from Khovanskii bases
Elise Walker - Texas A&M University, USA
13:00 ~ 13:30 A complete error analysis on solving an overdetermined system in computer vision using linear algebra
Margaret H. Regan - Duke University, USA
13:45 ~ 14:15 On the normalized condition number of a computational problem
Federico Carrasco - UdelaR, Uruguay
14:15 ~ 14:45 Efficient algorithms for torus actions by interior-points methods for unconstrained geometric programming
Peter Bürgisser - TU Berlin, Germany
14:45 ~ 15:15 Sub-Linear Point Counting for Arbitrary Curves Over Prime Power Rings
J. Maurice Rojas - Texas A&M University, USA
15:15 ~ 15:45 Towards correct and efficient computations with polynomials
Michael Burr - Clemson University, United States
Wednesday, July 21, 16:00 ~ 21:00
16:00 ~ 16:30 Multigraded Sylvester forms, duality and elimination matrices
Laurent Busé - Université Côte d'Azur, Inria, France
16:30 ~ 17:00 Sign conditions for the existence of at least one positive solution of a sparse polynomial system
Alicia Dickenstein - Universidad de Buenos Aires, Argentina
17:00 ~ 17:30 A Macaulay formula for the sparse resultant
Martín Sombra - ICREA and Universitat de Barcelona, Spain
17:30 ~ 18:00 Subresultants of $(x-a)^m$ and $(x-b)^n$, Jacobi polynomials and complexity
Teresa Krick - University of Buenos Aires and CONICET, Argentina
18:00 ~ 18:30 Complexity of Plantinga-Vegter Algorithm
Alperen Ergur - UTSA, USA
18:45 ~ 19:15 Smooth Points on Semi-algebraic sets
Agnes Szanto - North Carolina State University, United States
19:15 ~ 19:45 Decomposable Sparse Polynomial Systems
Jose Israel Rodriguez - University of Wisconsin --- Madison, USA
19:45 ~ 20:15 Novel Range Functions via Recursive Lagrange Interpolation, and its effectiveness in Real Root Isolation
Chee Yap - Courant, NYU, United States
20:15 ~ 20:45 Mixed volume, mixed area and the cost of sparse homotopy
Gregorio Malajovich - Universidade Federal do Rio de Janeiro, Brasil

 

All abstracts

View all abstracts of this session