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

Upcoming seminars and events

  • 27th Jan. 2023,
    Inria Saclay 11:00
    seminar

    Faster computation of elementary functions
    Fredrik Johansson
    LFANT, Institut de Mathématiques de Bordeaux, Centre Inria de l'Université de Bordeaux

  • 17th Feb. 2023,
    LIP6 11:00
    seminar

    The moment problem and convex hulls of semialgebraic sets
    Simone Naldi
    Computer Algebra team, XLIM, Université de Limoges

  • Sept. – Dec. 2023
    conference

    Thematic program at Institut Henri Poincaré on Recent Trends in Computer Algebra.
    See here for the program and here (IHP page).

  • 2024
    conference