research
∙
07/06/2021
Polynomial-Division-Based Algorithms for Computing Linear Recurrence Relations
Sparse polynomial interpolation, sparse linear system solving or modular...
share
research
∙
05/26/2021
Koszul-type determinantal formulas for families of mixed multilinear systems
Effective computation of resultants is a central problem in elimination ...
research
∙
09/02/2020
Computing critical points for invariant algebraic systems
Let 𝐊 be a field and ϕ, 𝐟 = (f_1, …, f_s) in 𝐊[x_1, …, x_n] be multivari...
research
∙
02/01/2019
Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems
Gröbner bases is one the most powerful tools in algorithmic non-linear a...
research
∙
10/30/2018
A nearly optimal algorithm to decompose binary forms
Symmetric tensor decomposition is an important problem with applications...
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
∙
05/14/2018
Bilinear systems with two supports: Koszul resultant matrices, eigenvalues, and eigenvectors
A fundamental problem in computational algebraic geometry is the computa...
research
∙
05/09/2018
Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case
One of the biggest open problems in computational algebra is the design ...
research
∙
09/21/2017
In-depth comparison of the Berlekamp -- Massey -- Sakata and the Scalar-FGLM algorithms: the non adaptive variants
We compare thoroughly the Berlekamp -- Massey -- Sakata algorithm and th...
research
∙
05/19/2016
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems
Bézout 's theorem states that dense generic systems of n multivariate qu...
research
∙
05/03/2016
Determinantal sets, singularities and application to optimal control in medical imagery
Control theory has recently been involved in the field of nuclear magnet...
research
∙
02/19/2016
