Computing congruences of modular forms and Galois representations modulo prime powers
From MaRDI portal
Abstract: 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 have a root in common in a sense that is defined. These techniques are applied to the study of congruences of modular forms and modular Galois representations modulo prime powers. Finally, some computational results with implications on the (non-)liftability of modular forms modulo prime powers and possible generalisations of level raising are presented.
Recommendations
Cited in
(13)- Examples of abelian surfaces failing the local-global principle for isogenies
- Realization of modular Galois representations in the Jacobians of modular curves
- Computational Aspects of Modular Forms and Galois Representations
- Computing coefficients of modular forms
- scientific article; zbMATH DE number 6497737 (Why is no real title available?)
- Computing modular Galois representations
- Topics on modular Galois representations modulo prime powers
- Byte weight enumerators and modular forms of genus r
- Computing Power Series Expansions of Modular Forms
- The theta cycles for modular forms modulo prime powers
- Fully homomorphic encryption for cyclotomic prime moduli
- Around the GCD of the Values of Two Polynomials
- Dihedral group, 4-torsion on an elliptic curve, and a peculiar eigenform modulo 4
This page was built for publication: Computing congruences of modular forms and Galois representations modulo prime powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3062349)