Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1501.04974

Insufficiency of the Brauer-Manin obstruction for Enriques surfaces

Francesca Balestrieri·Jennifer Berg·Michelle Manes·Jennifer Park·Bianca Viray
View original source ↗Read source document ↗Export metadata ↓

Abstract

In 2011, Vàrilly-Alvarado and the last author constructed an Enriques surface $X$ over $\mathbb{Q}$ with an étale-Brauer obstruction to the Hasse principle and no algebraic Brauer-Manin obstruction. In this paper, we show that the nontrivial Brauer class of $X_{\bar{\mathbb{Q}}}$ does not descend to $\mathbb{Q}$. Together with the results of Vàrilly-Alvarado and the last author, this proves that the Brauer-Manin obstruction is insufficient to explain all failures of the Hasse principle on Enriques surfaces. The methods of this paper build on the ideas in several recent papers by the last author and various collaborators: we study geometrically unramified Brauer classes on $X$ via pullback of ramified Brauer classes on a rational surface. Notably, we develop techniques which work over fields which are not necessarily separably closed, in particular, over number fields.

Explore related subjects

math.NTmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francesca Balestrieri, Jennifer Berg, Michelle Manes, Jennifer Park, Bianca Viray. 2015-01-20. Insufficiency of the Brauer-Manin obstruction for Enriques surfaces. https://arxiv.org/abs/1501.04974

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↗