Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1612.08592

Arithmetic of Eisenstein quotients

Yuan Ren
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we will study the arithmetic of the Eisenstein part of the modular Jacobians. In the first section, we introduce some general preliminaries of the arithmetic theory of modular curves that we will need later. In the second section, we give an example of modular abelian varieties due to Gross and study its properties in some details. In the third section, we define Eisenstein quotients of the modular Jacobians in general and give a criterion of the non-triviality of Heegner points on such Eisenstein quotients. The last two sections return to the concrete examples when the level of the modular Jacobian ia a prime or a square of a prime.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuan Ren. 2016-12-27. Arithmetic of Eisenstein quotients. https://arxiv.org/abs/1612.08592

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗