arXiv · 0909.2724
Computing Congruences of Modular Forms and Galois Representations Modulo Prime Powers
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.
Explore related subjects
Keep this discovery
Xavier Taixes i Ventosa, Gabor Wiese. 2010-01-21. Computing Congruences of Modular Forms and Galois Representations Modulo Prime Powers. https://arxiv.org/abs/0909.2724
Cite the original work for its findings. Save a collection to share your selection of sources.