Computing congruences of modular forms and Galois representations modulo prime powers

Xavier Taixés () and Gabor Wiese

Economics Working Papers from Department of Economics and Business, Universitat Pompeu Fabra

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.

Date: 2010-01
New Economics Papers: this item is included in nep-cmp
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://econ-papers.upf.edu/papers/1248.pdf Whole Paper (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:upf:upfgen:1248

Access Statistics for this paper

More papers in Economics Working Papers from Department of Economics and Business, Universitat Pompeu Fabra
Bibliographic data for series maintained by ( this e-mail address is bad, please contact ).