4 papers
A Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces
Aude Le Gluher, Pierre-Jean Spaenlehauer
We propose a probabilistic variant of Brill-Noether's algorithm for computing a basis of the Riemann-Roch space associated to a divisor on a projective nodal plane curve…
Counting points on genus-3 hyperelliptic curves with explicit real multiplication
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field , with explicit real multiplic…
A Polyhedral Method for Sparse Systems with many Positive Solutions
Frédéric Bihan, Francisco Santos, Pierre-Jean Spaenlehauer
We investigate a version of Viro's method for constructing polynomial systems with many positive solutions, based on regular triangulations of the Newton polytope of the system. Th…
Critical Point Computations on Smooth Varieties: Degree and Complexity bounds
Mohab Safey El Din, Pierre-Jean Spaenlehauer
Let V C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at th…