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
Organizers
Former Organizers
2020/09/01 – 2021/08/31

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

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

Upcoming seminars and events

  • 25th Nov. 2022,
    LIP6 11:00
    seminar with GT TC

    Guessing with Little Data
    Christoph Koutschan
    Johann Radon Institute for Computational and Applied Mathematics

  • 25th Nov. 2022,
    LIP6 14:00
    seminar with GT TC

    Gerrymandering
    Manuel Kauers
    Institut für Algebra, Johannes Kepler Universität Linz

  • 25th Nov. 2022,
    LIP6 15:30
    seminar with GT TC

    Vector Spaces of Generalized Euler Integrals
    Claudia Fevola
    Max-Planck-Institut für Mathematik in den Naturwissenschaften

  • 9th Dec. 2022,
    IHP 14:30
    seminar with GT TC

    What do we know about the cogrowth sequence?
    Igor Pak
    Mathematics Department, University of California, Los Angeles

  • 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