Joint PolSysSpecFun 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.
Laboratoire d'Informatique de Paris 6 (UMR CNRS 7606)
Campus Pierre-et-Marie-Curie
Sorbonne Université
4 place Jussieu
75005 Paris, France
Inria Saclay – Île-de-France
Bâtiment Alan Turing
Campus de l'École polytechnique
1 rue Honoré d'Estienne d'Orves
91120 Palaiseau, France
Former Organizers
2020/09/01 – 2021/08/31

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

Upcoming seminars and events

  • 10 Dec. 2021, 10:30

    Multiplication in finite fields with Chudnovsky-type algorithms over the projective line,
    Bastien Pacifico,

    I2M, Aix Marseille Université.

  • 21 Jan. 2022, 11:00

    Erik Panzer,

    Mathematical Institute, University of Oxford.

  • Sep. to Dec. 2023

    Thematic program on Recent Trends in Computer Algebra.

  • Sep. to Dec. 2021 POSTPONED to 2024

    Thematic program at Institut Henri Poincaré on post-quantum algebraic cryptography.