Search arXivSearch

arXiv · 2509.03602

The Beilinson-Bloch conjecture for some non-isotrivial varieties over global function fields

Abstract

The Beilinson--Bloch conjecture is a generalization of the Birch and Swinnerton-Dyer conjecture, which relates the ranks of Chow groups of smooth projective varieties over global fields to the order of vanishing of $L$-functions. We prove the conjecture for certain classes of non-isotrivial varieties over $\mathbb{F}_q(t)$, including some cubic threefolds and fivefolds. We deduce the Birch and Swinnerton-Dyer conjecture for their intermediate Jacobians, and use it to establish new cases of the Tate conjecture over finite fields. We also prove further results on the arithmetic of these intermediate Jacobians. To that end, we show that a few classes of varieties over an arbitrary field have motive of abelian type, generalizing previously known examples over the complex numbers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matt Broe. 2026-02-23. The Beilinson-Bloch conjecture for some non-isotrivial varieties over global function fields. https://arxiv.org/abs/2509.03602

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