Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/10230/11723

Computing congruences of modular forms and Galois representations modulo prime powers
Taixés, Xavier; Wiese, Gabor
Universitat Pompeu Fabra. Departament d'Economia i Empresa
This article starts a computational study of congruences of modular forms and modular Galoisrepresentations modulo prime powers. Algorithms are described that compute the maximum integermodulo which two monic coprime integral polynomials have a root in common in a sensethat is defined. These techniques are applied to the study of congruences of modular forms andmodular Galois representations modulo prime powers. Finally, some computational results withimplications on the (non-)liftability of modular forms modulo prime powers and possible generalisationsof level raising are presented.
09-06-2011
L'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Documento de trabajo
         

Mostrar el registro completo del ítem

Documentos relacionados