54 citations · 220 across the 21 of their papers we have counts for
6 papers · 1 filter
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…
Hypergeometric Expressions for Generating Functions of Walks with Small Steps in the Quarter Plane
Alin Bostan, Frédéric Chyzak, Mark van Hoeij +2
We study nearest-neighbors walks on the two-dimensional square lattice, that is, models of walks on defined by a fixed step set that is a subset of the non-zero vect…
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…
Classifying (almost)-Belyi maps with Five Exceptional Points
Mark van Hoeij, Vijay Jung Kunwar
We classify all rational functions whose branching pattern above {0, 1, infinity} satisfy a certain regularity condition with precisely d=5 exceptions. This work is motivated by so…
The perimeter generating functions of three-choice, imperfect, and 1-punctured staircase polygons
M. Assis, M. van Hoeij, J-M. Maillard
We consider the isotropic perimeter generating functions of three-choice, imperfect, and 1-punctured staircase polygons, whose 8th order linear Fuchsian ODEs are previously known.…
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…