Grégoire Lecerf
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Grégoire Lecerf has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Bernd Bank
Humboldt-Universität zu Berlin
2 shared publications - Guillermo Matera
National Council of Science and Technology (CONICET), Buenos Aires, Argentina
2 shared publications - Joos Heintz
Departamento de Computación Universidad de Buenos Aires and CONICET Ciudad Univ., Pab.I 1428 Buenos Aires Argentina
2 shared publications - Marc Giusti
Laboratoire STIX, Ecole Polytechnique, 91128 Palaiseau
2 shared publications - Pablo Solernó
Departamento de Matemática and IMAS Facultad de Ciencias Exactas y Naturales UBA-CONICET Universidad de Buenos Aires Ciudad Universitaria 1428 Buenos Aires Argentina
2 shared publications - Guillaume Quintin
LIX École polytechnique 91128 Palaiseau France
1 shared publication
Latest Publications
- 23 October 2014
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 15 (1) , 159-184
Degeneracy Loci and Polynomial Equation Solving
- 23 October 2014
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 15 (1) , 159-184
Degeneracy Loci and Polynomial Equation Solving
- Open Access
Degeneracy loci and polynomial equation solving
Let V be a smooth equidimensional quasi-affine variety of dimension r over the complex numbers $C$ and let $F$ be a $(p\times s)$-matrix of coordinate functions of $C[V]$, where $s\ge p+r$. The pair $(V,F)$ determines a vector bundle $E$ of rank $s-p$ over $W:=\{x\in V:\mathrm{rk} F(x)=p\}$. We associate with $(V,F)$ a descending chain of degeneracy loci of E (the generic polar varieties of $V$ represent a typical example of this situation). The maximal degree of these degeneracy loci constitutes the essential ingredient for the uniform, bounded error probabilistic pseudo-polynomial time algorithm which we are going to design and which solves a series of computational elimination problems that can be formulated in this framework. We describe applications to polynomial equation solving over the reals and to the computation of a generic fiber of a dominant endomorphism of an affine space.Open AccessDegeneracy loci and polynomial equation solving
Let V be a smooth equidimensional quasi-affine variety of dimension r over the complex numbers $C$ and let $F$ be a $(p\times s)$-matrix of coordinate functions of $C[V]$, where $s\ge p+r$. The pair $(V,F)$ determines a vector bundle $E$ of rank $s-p$ over $W:=\{x\in V:\mathrm{rk} F(x)=p\}$. We associate with $(V,F)$ a descending chain of degeneracy loci of E (the generic polar varieties of $V$ represent a typical example of this situation). The maximal degree of these degeneracy loci constitutes the essential ingredient for the uniform, bounded error probabilistic pseudo-polynomial time algorithm which we are going to design and which solves a series of computational elimination problems that can be formulated in this framework. We describe applications to polynomial equation solving over the reals and to the computation of a generic fiber of a dominant endomorphism of an affine space. - 11 July 2013
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 24 (6) , 413-443
Polynomial root finding over local rings and application to error correcting codes
- 11 July 2013
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 24 (6) , 413-443
Polynomial root finding over local rings and application to error correcting codes
- Open Access
Interfacing Mathemagix with C++
In this paper, we give a detailed description of the interface between the Mathemagix language and C++. In particular, we describe the mechanism which allows us to import a C++ template library (which only permits static instantiation) as a fully generic Mathemagix template library.
Open AccessInterfacing Mathemagix with C++
In this paper, we give a detailed description of the interface between the Mathemagix language and C++. In particular, we describe the mechanism which allows us to import a C++ template library (which only permits static instantiation) as a fully generic Mathemagix template library.
- Open Access
- 1 September 2012
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 81 (279) , 1799-1821
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
In this article we present a new algorithm for reducing the usual sparse bivariate factorization problems to the dense case. This reduction simply consists of computing an invertible monomial transformation that produces a polynomial with a dense size of the same order of magnitude as the size of the integral convex hull of the support of the input polynomial. This approach turns out to be very efficient in practice, as demonstrated with our implementation.
- 1 September 2012
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 81 (279) , 1799-1821
Open AccessReduction of bivariate polynomials from convex-dense to dense, with application to factorizations
In this article we present a new algorithm for reducing the usual sparse bivariate factorization problems to the dense case. This reduction simply consists of computing an invertible monomial transformation that produces a polynomial with a dense size of the same order of magnitude as the size of the integral convex hull of the support of the input polynomial. This approach turns out to be very efficient in practice, as demonstrated with our implementation.