Loading...
Loading...

Go to the content (press return)

Computing congruences of modular forms and Galois representations modulo prime powers

Author
Taixés, X.; Wiese, G.
Type of activity
Journal article
Journal
Contemporary mathematics
Date of publication
2010
Volume
521
First page
145
Last page
170
Repository
http://hdl.handle.net/2117/11544 Open in new window
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 o...
Citation
Taixés, X.; Wiese, G. Computing congruences of modular forms and Galois representations modulo prime powers. "Contemporary mathematics", 2010, vol. 521, p. 145-170.

Participants

  • Taixes Ventosa, Xavier  (author)
  • Wiese, Gabor  (author)

Attachments