research
∙
03/18/2022
Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems
We consider ideals involving the maximal minors of a polynomial matrix. ...
share
research
∙
02/27/2022
New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon)
This paper is concerned with linear algebra based methods for solving ex...
research
∙
02/18/2022
Faster change of order algorithm for Gröbner bases under shape and stability assumptions
Solving zero-dimensional polynomial systems using Gröbner bases is usual...
research
∙
07/06/2021
Polynomial-Division-Based Algorithms for Computing Linear Recurrence Relations
Sparse polynomial interpolation, sparse linear system solving or modular...
research
∙
04/08/2021
msolve: A Library for Solving Polynomial Systems
We present a new open source C library dedicated to solving multivariat...
research
∙
04/02/2021
On the computation of asymptotic critical values of polynomial maps and applications
Let 𝐟 = (f_1, …, f_p) be a polynomial tuple in ℚ[z_1, …, z_n] and let d ...
research
∙
09/11/2020
Guessing Gröbner Bases of Structured Ideals of Relations of Sequences
Assuming sufficiently many terms of a n-dimensional table defined over a...
research
∙
06/04/2018
In-depth comparison of the Berlekamp–Massey–Sakata and the Scalar-FGLM algorithms: the adaptive variants
The Berlekamp–Massey–Sakata algorithm and the Scalar-FGLM algorithm both...
research
∙
09/21/2017