Search arXivSearch

arXiv · 1312.1237

8-rank of the class group and isotropy index

Abstract

Suppose $F=\mathbb{Q}(\sqrt{-p_1\dotsm p_t})$ is an imaginary quadratic number field with distinct primes $p_1,\dots,p_{t}$, where $p_i\equiv 1\pmod{4}$ ($i=1,\dots,t-1$) and $p_t\equiv 3\pmod{4}$. We express the possible values of the 8-rank $r_8$ of the class group of $F$ in terms of a quadratic form $Q$ over $\mathbb{F}_2$ which is defined by quartic symbols. In particular, we show that $r_8$ is bounded by the isotropy index of $Q$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qing Lu. 2014-04-27. 8-rank of the class group and isotropy index. https://doi.org/10.1007/s11425-014-4898-8

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