11,008 research outputs found

    Computations of Galois Representations Associated to Modular Forms

    Full text link
    We propose an improved algorithm for computing mod \ell Galois representations associated to a cusp form ff of level one. The proposed method allows us to explicitly compute the case with =29\ell=29 and ff of weight k=16k=16, and the cases with =31\ell=31 and ff of weight k=12,20,22k=12,20, 22. All the results are rigorously proved to be correct. As an example, we will compute the values modulo 3131 of Ramanujan's tau function at some huge primes up to a sign. Also we will give an improved higher bound on Lehmer's conjecture for Ramanujan's tau function.Comment: This paper has been published in Acta Arithmetic

    Computing the cardinality of CM elliptic curves using torsion points

    Full text link
    Let E be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Omega of the order. If the prime p splits completely in Omega, then we can reduce E modulo one the factors of p and get a curve Ep defined over GF(p). The trace of the Frobenius of Ep is known up to sign and we need a fast way to find this sign. For this, we propose to use the action of the Frobenius on torsion points of small order built with class invariants a la Weber, in a manner reminiscent of the Schoof-Elkies-Atkin algorithm for computing the cardinality of a given elliptic curve modulo p. We apply our results to the Elliptic Curve Primality Proving algorithm (ECPP).Comment: Revised and shortened version, including more material using discriminants of curves and division polynomial

    Black Box Galois Representations

    Get PDF
    We develop methods to study 22-dimensional 22-adic Galois representations ρ\rho of the absolute Galois group of a number field KK, unramified outside a known finite set of primes SS of KK, which are presented as Black Box representations, where we only have access to the characteristic polynomials of Frobenius automorphisms at a finite set of primes. Using suitable finite test sets of primes, depending only on KK and SS, we show how to determine the determinant detρ\det\rho, whether or not ρ\rho is residually reducible, and further information about the size of the isogeny graph of ρ\rho whose vertices are homothety classes of stable lattices. The methods are illustrated with examples for K=QK=\mathbb{Q}, and for KK imaginary quadratic, ρ\rho being the representation attached to a Bianchi modular form. These results form part of the first author's thesis.Comment: 40 pages, 3 figures. Numerous minor revisions following two referees' report

    Computing fundamental domains for the Bruhat-Tits tree for GL2(Qp), p-adic automorphic forms, and the canonical embedding of Shimura curves

    Full text link
    We describe an algorithm for computing certain quaternionic quotients of the Bruhat-Tits tree for GL2(Qp). As an application, we describe an algorithm to obtain (conjectural) equations for the canonical embedding of Shimura curves.Comment: Accepted for publication in LMS Journal of Computation and Mathematic
    corecore