Related papers: Computational aspects of modular forms and Galois …
For many finite groups, the Inverse Galois Problem can be approached through modular/automorphic Galois representations. This is a report explaining the basic strategy, ideas and methods behind some recent results. It focusses mostly on the…
This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…
We compute modular Galois representations associated with a newform $f$, and study the related problem of computing the coefficients of $f$ modulo a small prime $\ell$. To this end, we design a practical variant of the complex…
We construct plane models of the modular curve $X_H(\ell)$, and use their explicit equations to compute Galois representations associated to modular forms for values of $\ell$ that are significantly higher than in prior works.
This article surveys modularity, level raising and level lowering questions for two-dimensional representations modulo prime powers of the absolute Galois group of the rational numbers. It contributes some new results and describes…
We show how the output of the algorithm to compute modular Galois representations described in our previous article can be certified. We have used this process to compute certified tables of such Galois representations obtained thanks to an…
In this paper we explicitly compute mod-l Galois representations associated to modular forms. To be precise, we look at cases with l<=23 and the modular forms considered will be cusp forms of level 1 and weight up to 22. We present the…
The theories of hypergeometric functions and modular forms are highly intertwined. For example, particular values of truncated hypergeometric functions and hypergeometric character sums are often congruent or equal to Fourier coefficients…
The present notes are the expanded and polished version of three lectures given in Stanford, concerning the analytic and arithmetic properties of weight one modular forms. The author tried to write them in a style accessible to…
We show how to speed up the computation of isomorphisms of hyperelliptic curves by using covariants. We also obtain new theoretical and practical results concerning models of these curves over their field of moduli.
We give a classification of all possible $2$-adic images of Galois representations associated to elliptic curves over $\mathbb{Q}$. To this end, we compute the 'arithmetically maximal' tower of 2-power level modular curves, develop…
In previous works, we described algorithms to compute the number field cut out by the mod ell representation attached to a modular form of level N=1. In this article, we explain how these algorithms can be generalised to forms of higher…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
For each of the groups PSL2(F25), PSL2(F32), PSL2(F49), PGL2(F25), and PGL2(F27), we display the first explicitly known polynomials over Q having that group as Galois group. Each polynomial is related to a Galois representation associated…
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
We propose an improved algorithm for computing mod $\ell$ Galois representations associated to a cusp form $f$ of level one. The proposed method allows us to explicitly compute the case with $\ell=29$ and $f$ of weight $k=16$, and the cases…
To study statistical properties of modular forms, including for instance Sato-Tate like problems, it is essential to have a large number of Fourier coefficients. In this article, we exhibit three bases for the space of modular forms of any…
In this paper we describe an algorithm for computing mod $\ell$ Galois representations associated to modular forms of weight $k$ when $\ell <k-1$. As applications, we use this algorithm to explicitly compute the cases with $\Delta_{k}$ for…
Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…
In this paper, we consider Galois representations of the absolute Galois group $\text{Gal}(\overline {\mathbb Q}/\mathbb Q)$ attached to modular forms for noncongruence subgroups of $\text{SL}_2(\mathbb Z)$. When the underlying modular…