Search arXivSearch

arXiv · 2101.09972

Motivic congruences and Sharifi's conjecture

Abstract

Let $f$ be a cuspidal eigenform of weight two and level $N$, let $p\nmid N$ be a prime at which $f$ is congruent to an Eisenstein series and let $V_f$ denote the $p$-adic Tate module of $f$. Beilinson constructed a class $κ_f\in H^1(\mathbb Q,V_f(1))$ arising from the cup-product of two Siegel units and proved a striking relationship with the first derivative $L'(f,0)$ at the near central point $s=0$ of the $L$-series of $f$, which led him to formulate his celebrated conjecture. In this note we prove two congruence formulae relating the "motivic part" of $L'(f,0) \,(\mathrm{mod} \, p)$ and $L''(f,0) \,(\mathrm{mod} \, p)$ with circular units. The proofs make use of delicate Galois properties satisfied by various integral lattices within $V_f$ and exploits Perrin-Riou's, Coleman's and Kato's work on the Euler systems of circular units and Beilinson--Kato elements and, most crucially, the work of Sharifi, Fukaya--Kato and Ohta.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Óscar Rivero, Victor Rotger. 2021-01-25. Motivic congruences and Sharifi's conjecture. https://arxiv.org/abs/2101.09972

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT