Non-paritious Hilbert modular forms
The arithmetic of Hilbert modular forms has been extensively studied under the assumption that the forms concerned are “paritious”—all the components of the weight are congruent modulo 2. In contrast, non-paritious Hilbert modular forms have been relatively little studied, both from a theoretical an...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2019 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/119772 |
| Acceso en línea: | http://hdl.handle.net/11336/119772 |
| Access Level: | acceso abierto |
| Palabra clave: | GALOIS REPRESENTATIONS HILBERT MODULAR FORMS https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Sumario: | The arithmetic of Hilbert modular forms has been extensively studied under the assumption that the forms concerned are “paritious”—all the components of the weight are congruent modulo 2. In contrast, non-paritious Hilbert modular forms have been relatively little studied, both from a theoretical and a computational standpoint. In this article, we aim to redress the balance somewhat by studying the arithmetic of non-paritious Hilbert modular eigenforms. On the theoretical side, our starting point is a theorem of Patrikis, which associates projectiveℓ-adic Galois representations to these forms. We show that a general conjecture of Buzzard and Gee actually predicts that a strengthening of Patrikis’ result should hold, giving Galois representations into certain groups intermediate between GL2 and PGL 2 ; and we verify that the predicted Galois representations do indeed exist. On the computational side, we give an algorithm to compute non-paritious Hilbert modular forms using definite quaternion algebras. To our knowledge, this is the first time such a general method has been presented. We end the article with an example. |
|---|