54 citations · 220 across the 21 of their papers we have counts for
8 papers · 1 filter
Hypergeometric Solutions of Linear Difference Systems
Moulay Barkatou, Mark van Hoeij, Johannes Middeke +1
We extend Petkovšek's algorithm for computing hypergeometric solutions of scalar difference equations to the case of difference systems , with ,…
Submodule approach to creative telescoping
Mark van Hoeij
This paper proposes ideas to speed up the process of creative telescoping, particularly when the telescoper is reducible. One can interpret telescoping as computing an annihilator…
Functional Decomposition using Principal Subfields
Luiz E. Allem, Juliane Capaverde, Mark van Hoeij +1
Let be a univariate rational function. It is well known that any non-trivial decomposition , with , corresponds to a non-trivial subfield $K(f(t…
Reduction-Based Creative Telescoping for Fuchsian D-finite Functions
Shaoshi Chen, Mark van Hoeij, Manuel Kauers +1
Continuing a series of articles in the past few years on creative telescoping using reductions, we adapt Trager's Hermite reduction for algebraic functions to fuchsian D-finite fun…
The Complexity of Computing all Subfields of an Algebraic Number Field
Jonas Szutkoski, Mark van Hoeij
For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute the…
A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions
Mark van Hoeij, Michael Monagan
We consider the problem of computing the monic gcd of two polynomials over a number field L = Q(alpha_1,...,alpha_n). Langemyr and McCallum have already shown how Brown's modular G…
Explicit formula for the generating series of diagonal 3D rook paths
Alin Bostan, Frédéric Chyzak, Mark van Hoeij +1
Let denote the number of ways in which a chess rook can move from a corner cell to the opposite corner cell of an three-dimensional chessboard, assuming…
Gradual sub-lattice reduction and a new complexity for factoring polynomials
Mark Van Hoeij, Andrew Novocin
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type s…