11 citations · 14 across the 5 of their papers we have counts for
6 papers
Solving conics over Q(t1,..,tk)
Mark van Hoeij
Let K = Q(t1,..,tk) and a,b,c in K. We give a simple algorithm to find, if it exists, X,Y,Z in K, not all zero, for which aX^2 + bY^2 + cZ^2 = 0.
Factoring polynomials over global fields
K. Belabas, M. van Hoeij, J. Klueners +1
Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.
Apparent Singularities of Linear Difference Equations with Polynomial Coefficients
S. A. Abramov, M. A. Barkatou, M. van Hoeij
Let L be a linear difference operator with polynomial coefficients. We consider singularities of L that correspond to roots of the trailing (resp. leading) coefficient of L. We pro…
A conjecture in the problem of rational definite summation
Mark van Hoeij
A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.
Computing Riemann Theta Functions
Bernard Deconinck, Matthias Heil, Alexander Bobenko +2
The Riemann theta function is a complex-valued function of g complex variables. It appears in the construction of many (quasi-) periodic solutions of various equations of mathemati…
An algorithm for computing the Weierstrass normal form of hyperelliptic curves
Mark van Hoeij
An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.