arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0909.2724math.NT
收藏

模形式的同余与模素幂的伽罗瓦表示

Computing Congruences of Modular Forms and Galois Representations Modulo Prime Powers

Xavier Taixes i Ventosa, Gabor Wiese

摘要:

本文开始了对模形式和模素幂的模伽罗瓦表示的同余关系的计算研究。算法描述计算最大整数模,其中两个一元互质积分多项式有一个共同的根在某种意义上说,是定义。这些技巧被应用到研究的同余的模形式和模伽罗瓦表示模素幂。最后,一些计算结果的影响(非)提升的模形式模素幂和可能的推广的水平提高。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑