Jérémy Berthomieu

Research – Projects

My research domain is computer algebra and more precisely, I am mainly interested in using algorithms for guessing linear recurrence relations in order to speed up Gröbner bases computations and polynomial system solving.

Projects coordinator

  • G.P.U.: Gröbner bases Performance Upwards.
    With T. Mary, Projet LIP6 2022.
  • Hmm: Symbolic-numeric algorithms for a Holonomic Method of Moments.
    With P. Lairez, DIM-RFSI 2021–2024.
  • CAMiSAdo: Computer Algebra Methods for Semi-Algebraic programming.
    PGMO 2019–2021.

Projects local coordinator or member

  • EAGLES: Efficient Algorithms for Guessing, inequaLitiEs, and Summation.
    Local coordinator of the Paris partner, ANR-FWF 2023–2027.
  • De Rerum Natura: Deciding irrationality and transcendence. Classification algorithms for number theory and combinatorics.
    Local coordinator of the Paris partner, ANR 2019–2024.
  • POEMA: Polynomial Optimization, Efficiency through Moments and Algebra.
    Member of the Paris partner, Marie Skłodowska-Curie Innovative Training Networks 2018–2022.
  • ECARP: Efficient Certified Algorithms for Robot motion Planning.
    Member of the Paris partner, ANR-FWF 2019–2024.
  • SESAME: Singularités Et Stabilité des AsservisseMEnts référencés capteurs.
    Member of the Paris partner, ANR 2019–2024.