Mathematics > Number Theory
[Submitted on 23 May 2018 (v1), last revised 19 Jun 2021 (this version, v3)]
Title:On the congruences of Eisenstein series with polynomial indexes
View PDFAbstract:In this paper, based on Serre's $p$-adic family of Eisenstein series, we prove a general family of congruences for Eisenstein series $G_k$ in the form $$ \sum_{i=1}^n g_i(p)G_{f_i(p)}\equiv g_0(p)\mod p^N, $$ where $f_1(t),\ldots,f_n(t)\in\mathbb{Z}[t]$ are non-constant integer polynomials with positive leading coefficients and $g_0(t),\ldots,g_n(t)\in\mathbb{Q}(t)$ are rational functions. This generalizes the classical von Staudt-Clausen's and Kummer's congruences of Eisenstein series, and also yields some new congruences.
Submission history
From: Min Sha [view email][v1] Wed, 23 May 2018 15:32:39 UTC (9 KB)
[v2] Mon, 17 Sep 2018 13:14:28 UTC (9 KB)
[v3] Sat, 19 Jun 2021 12:56:22 UTC (10 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.