Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2202.08120

Descent and étale-Brauer obstructions for 0-cycles

Francesca Balestrieri·Jennifer Berg
View original source ↗Read source document ↗Export metadata ↓

Abstract

For 0-cycles on a variety over a number field, we define an analogue of the classical descent set for rational points. This leads to, among other things, a definition of the étale-Brauer obstruction set for 0-cycles, which we show is contained in the Brauer-Manin set and is compatible with Suslin's singular homology of degree 0. We then transfer some tools and techniques used to study the arithmetic of rational points into the setting of 0-cycles. For example, we extend the strategy developed by Y. Liang, relating the arithmetic of rational points over finite extensions of the base field to that of 0-cycles, to torsors. We give applications of our results to study the arithmetic behaviour of 0-cycles for Enriques surfaces, torsors given by (twisted) Kummer varieties, universal torsors, and torsors under tori.

Explore related subjects

math.NTmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francesca Balestrieri, Jennifer Berg. 2023-11-08. Descent and étale-Brauer obstructions for 0-cycles. https://arxiv.org/abs/2202.08120

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↗