93 citations · 387 across the 28 of their papers we have counts for
4 papers · 1 filter
A nearly optimal algorithm to decompose binary forms
Matías Bender, Jean-Charles Faugère, Ludovic Perret +1
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. I…
In-depth comparison of the Berlekamp--Massey--Sakata and the Scalar-FGLM algorithms: the adaptive variants
Jérémy Berthomieu, Jean-Charles Faugère
The Berlekamp--Massey--Sakata algorithm and the Scalar-FGLM algorithm both compute the ideal of relations of a multidimensional linear recurrent sequence.Whenever quering a single…
Towards Mixed Gr{ö}bner Basis Algorithms: the Multihomogeneous and Sparse Case
Matías Bender, Jean-Charles Faugère, Elias Tsigaridas
One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{ö}bner basis computations that take into account the sparsity of the input po…
Bilinear systems with two supports: Koszul resultant matrices, eigenvalues, and eigenvectors
Matías Bender, Jean-Charles Faugère, Angelos Mantzaflaris +1
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whos…