相关论文: A simplified algorithmic realization of Galois act…

In this paper we discuss applications of our earlier work in studying certain Galois groups and splitting fields of rational functions in $\mathbb Q\left(X_0(N)\right)$ using Hilbert's irreducibility theorem and modular forms. We also…

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…

Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in…

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

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…

Let $P\in\mathbb Q[t,x]$ be a polynomial in two variables with rational coefficients, and let $G$ be the Galois group of $P$ over the field $\mathbb Q(t)$. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $c$…

We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…

We apply the differential Galois theory for difference equations developed by Hardouin and Singer to compute the differential Galois group for a second-order linear $q$-difference equation with rational function coefficients. This Galois…

We prove very general index formulae for integral Galois modules, specifically for units in rings of integers of number fields, for higher K-groups of rings of integers, and for Mordell-Weil groups of elliptic curves over number fields.…

For a differential operator $L$ of order $n$ over $C(z)$ with a finite (differential) Galois group $G\subset {\rm GL}(C^n)$, there is an algorithm, by M. van Hoeij and J.-A.~Weil, which computes the associated evaluation of the invariants…

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 present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…

In this expository paper, we illustrate two explicit methods which lead to special $L$-values of certain modular forms admitting complex multiplication (CM), motivated in part by properties of $L$-functions obtained from Calabi-Yau…

In this paper, we propose an improved algorithm for computing mod $\ell$ Galois representations associated to eigenforms of arbitrary levels prime to $\ell$. Precisely, we present a method to find the Jacobians of modular curves which have…

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…

We present an algorithm that determines the Galois group of linear difference equations with rational function coefficients.

This paper provides a realization of all classical and most exceptional finite groups of Lie type as Galois groups over function fields over F_q and derives explicit additive polynomials for the extensions. Our unified approach is based on…

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…

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…

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…