Search arXivSearch

arXiv · 0710.3858

Tamagawa defect of Euler systems

Abstract

As remarked in [Kolyvagin systems, by Barry Mazur and Karl Rubin] Proposition 6.2.6 and Buyukboduk[ arXiv:0706.0377v1 ] Remark 3.25 one does not expect the Kolyvagin system obtained from an Euler system for a p-adic Galois representation T to be primitive (in the sense of [Kolyvagin systems, by Barry Mazur and Karl Rubin] Definition 4.5.5) if p divides a Tamagawa number at a prime \ell different from p; thus fails to compute the correct size of the relevant Selmer module. In this paper we obtain a lower bound for the size of the cokernel of the Euler system to Kolyvagin system map (see Theorem 3.2.4 of [Kolyvagin systems, by Barry Mazur and Karl Rubin] for a definition of this map) in terms of the Tamagawa numbers of T, refining [Kolyvagin systems, by Barry Mazur and Karl Rubin] Propostion 6.2.6. We show how this partially accounts for the missing Tamagawa factors in Kato's calculations with his Euler system.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kazim Buyukboduk. 2007-10-20. Tamagawa defect of Euler systems. https://doi.org/10.1016/j.jnt.2008.07.003

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