Search arXivSearch

arXiv · 2002.10854

Arithmetic complexity revisited

Abstract

The arithmetic complexity counts the number of algebraically independent entries in the periodic continued fraction $θ=[b_1,\dots, b_N, \overline{a_1,\dots,a_k}]$. If $\mathscr{A}_θ$ is a noncommutative torus corresponding to the rational elliptic curve $\mathscr{E}(K)$, then the rank of $\mathscr{E}(K)$ is given by a simple formula $r(\mathscr{E}(K))= c(\mathscr{A}_θ)-1$, where $c(\mathscr{A}_θ)$ is the arithmetic complexity of $θ$. We prove that $c(\mathscr{A}_θ)$ is equal to the dimension of the Brock-Elkies-Jordan variety of $θ$ introduced in [1]. Following Zagier and Lemmermeyer, we evaluate the Shafarevich-Tate group of $\mathscr{E}(K)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Igor Nikolaev. 2023-01-17. Arithmetic complexity revisited. https://doi.org/10.1007/s41478-023-00554-x

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