Joint MATHEXPPolSys Seminar (Archive)


This seminar focuses mainly on computer algebra algorithms and implementations for solving mathematical problems exactly, with a special focus on polynomial system solving and its broad range of applications.

Among others, topics which are covered are:
  • Foundational computer algebra algorithms for polynomials, series and matrices
  • Polynomial system solving with algebraic and/or certified numerical methods
  • Applications of non-linear algebra algorithms such as cryptography, polynomial optimization, and computational geometry
We also organize reading groups on important computer algebra algorithms.
Location
LIP6 (UMR CNRS 7606)
Campus Pierre-et-Marie-Curie
Sorbonne Université
4 place Jussieu
75005 Paris, France
or
Inria Saclay – Île-de-France
Bâtiment Alan Turing
Campus de l'École polytechnique
1 rue Honoré d'Estienne d'Orves
91120 Palaiseau, France

To receive further anouncements, register for the mailing list here:

https://listes.lip6.fr/sympa/subscribe/polsys-seminar