• Publications
  • Influence
Factorization of Differential Operators with Rational Functions Coefficients
  • M. V. Hoeij
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1 November 1997
TLDR
In this paper we give a new efficient method for factorizing differential operators with rational functions coefficients. Expand
  • 128
  • 9
  • PDF
Finite singularities and hypergeometric solutions of linear recurrence equations
Abstract In this paper the notion of finite singularities of difference operators is introduced, in order to adapt methods for differential equations to the case of recurrence equations.
  • 86
  • 9
Rational solutions of linear difference equations
  • M. V. Hoeij
  • Mathematics, Computer Science
  • ISSAC '98
  • 1 August 1998
TLDR
This paper presents a new and sharper bound for denominators of rational solutions of linear di erence and q-di erence equations. Expand
  • 71
  • 9
An Algorithm for Computing an Integral Basis in an Algebraic Function Field
  • M. V. Hoeij
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1 October 1994
TLDR
Algorithms for computing integral bases of an algebraic function field based on Puiseux expansions . Expand
  • 74
  • 8
  • PDF
Formal Solutions and Factorization of Differential Operators with Power Series Coefficients
  • M. V. Hoeij
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1 July 1997
TLDR
The topic of this paper is formal solutions of linear differential equations with formal power series coefficients. Expand
  • 62
  • 7
  • PDF
Liouvillian Solutions of Linear Differential Equations of Order Three and Higher
TLDR
Singer and Ulmer (1997) gave an algorithm to compute Liouvillian (“closed-form") solutions of homogeneous linear differential equations. Expand
  • 63
  • 6
  • PDF
A modular GCD algorithm over number fields presented with multiple extensions
TLDR
We consider the problem of computing the monic gcd of two polynomials over a number field L = ℚ(α1,…,αn) without converting to a single field extension. Expand
  • 43
  • 6
  • PDF
Computing Riemann theta functions
TLDR
The Riemann theta function is a complex-valued function of g complex variables. Expand
  • 82
  • 5
  • PDF
Factoring Polynomials and the Knapsack Problem
Abstract For several decades the standard algorithm for factoring polynomials f with rational coefficients has been the Berlekamp–Zassenhaus algorithm. The complexity of this algorithm dependsExpand
  • 111
  • 4
  • PDF
Towards factoring bivariate approximate polynomials
TLDR
A new algorithm is presented for factoring bivariate approximate polynomials over C[x, y]. Expand
  • 64
  • 4
  • PDF