News!!

• JNCF - Francophone Computer Algebra Days (Journées Nationales de Calcul Formel) from 2023/03/06 to 2023/03/10 at CIRM (Centre International de Rencontre Mathématiques).
• Andrew Ferguson will defend his Ph.D. thesis on 2022/10/24 at Sorbonne Université!
• Release of msolve, an open-source library for solving polynomial systems, written in C.
  with Christian Eder (Technische Universität Kaiserslautern) and Mohab Safey El Din (Sorbonne Université).
  
• Accepted and published papers
  • Faster change of order algorithm for Gröbner bases under shape and stability assumptions
    published at ISSAC '22.
    With Vincent Neiger (Sorbonne Université) and Mohab Safey El Din (Sorbonne Université).
  • Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems
    published in Journal of Algebra.
    With Alin Bostan (INRIA), Andrew Ferguson (Sorbonne Université) and Mohab Safey El Din (Sorbonne Université).
  • Guessing Gröbner Bases of Structured Ideals of Relations of Sequences
    published in Journal of Symbolic Computation.
    With Mohab Safey El Din (Sorbonne Université)
  • msolve: A Library for Solving Polynomial Systems
    published at ISSAC '21.
    With Christian Eder (Technische Universität Kaiserslautern) and Mohab Safey El Din (Sorbonne Université).
    
  • Polynomial-Division-Based Algorithms for Computing Linear Recurrence Relations
    published in Journal of Symbolic Computation.
    With Jean-Charles Faugère (CryptoNext Security and INRIA)
• Recent submissions
  • New efficient algorithms for computing Gröbner bases of saturation ideals (F₄SAT) and colon ideals (Sparse-FGLM-colon)
    With Christian Eder (Technische Universität Kaiserslautern) and Mohab Safey El Din (Sorbonne Université).
  • On the computation of asymptotic critical values of polynomial maps and applications
    With Andrew Ferguson (Sorbonne Université) and Mohab Safey El Din (Sorbonne Université).