Related papers: Modular algorithms for Gross-Stark units and Stark…
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degree and nontrivial class group. Using the algorithm over…
We give an explicit description of the matrix associated to the $U_p$ operator acting on spaces of overconvergent Hilbert modular forms over totally real fields. Using this, we compute slopes for weights in the centre and near the boundary…
We exhibit algorithms to compute systems of Hecke eigenvalues for spaces of Hilbert modular forms over a totally real field. We provide many explicit examples as well as applications to modularity and Galois representations.
For any additive functor from modules (or, more generally, from an abelian category with enough projectives or injectives), we construct long sequences tying up together the derived functors, the satellites, and the stabilizations of the…
The aim of this paper is to present an explicit reduction algorithm for Hilbert modular groups over arbitrary totally real number fields. An implementation of the algorithm is available to download from [19]. The exposition is…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
We introduce some general tools to design exact splitting methods to compute numerically semigroups generated by inhomogeneous quadratic differential operators. More precisely, we factorize these semigroups as products of semigroups that…
Computations over the rational numbers often encounter the problem of intermediate coefficient growth. A solution to this is provided by modular methods, which apply the algorithm under consideration modulo a number of primes and then lift…
For any number $m \equiv 0,1 \, (4)$ we correct the generating function of Hurwitz class number sums $\sum_r H(4n - mr^2)$ to a modular form (or quasimodular form if $m$ is a square) of weight two for the Weil representation attached to a…
In this paper, we develop a new type of accelerated algorithms to solve some classes of maximally monotone equations as well as monotone inclusions. Instead of using Nesterov's accelerating approach, our methods rely on a so-called…
Let p be prime and Zpn the degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast algorithms for common operations in Zpn modulo p^N. Combining existing methods with recent work…
Moduli of rings and quadrilaterals are frequently applied in geometric function theory, see e.g. the Handbook by K\"uhnau. Yet their exact values are known only in a few special cases. Previously, the class of planar domains with polygonal…
For Atkin-Lehner quotients $X_0^+(N)$, of prime level and of genus at least 2, we provide an algorithm for computing one of the main objects in the quadratic Chabauty algorithm in terms of weakly holomorphic modular forms associated to the…
The present paper deals with Atkin-Lehner theory for Drinfeld modular forms. We provide an equivalent definition of $\mathfrak{p}$-newforms (which makes computations easier) and commutativity results between Hecke operators and Atkin-Lehner…
Integral linear systems $Ax=b$ with matrices $A$, $b$ and solutions $x$ are also required to be in integers, can be solved using invariant factors of $A$ (by computing the Smith Canonical Form of $A$). This paper explores a new problem…
We develop an algorithm to compute Fourier expansions of vector valued modular for Weil representations. As an application, we compute explicit linear equivalences of special divisors on modular varieties of orthogonal type. We define three…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
For a normalized newform $g \in S_{k}(\Gamma_{0}(N))$ with complex multiplication by an imaginary quadratic field $K$, there is a mock modular form $F^{+}$ corresponding to $g$. K. Bringmann et al. modified $F^{+}$ in order to obtain a…
In this article we give an analogue of Hecke and Sturm bounds for Hilbert modular forms over real quadratic fields. Let $K$ be a real quadratic field and $\Om_K$ its ring of integers. Let $\Gamma$ be a congruence subgroup of $\SL_2(\Om_K)$…