Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2207.04393

Twists of the Burkhardt Quartic Threefold

Nils Bruin·Eugene Filatov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study twists of the Burkhardt quartic threefold over non-algebraically closed base fields of characteristic different from 2,3,5. We show they all admit quartic models in projective four-space. We identify a Galois-cohomological obstruction that measures if a given twist is birational to a moduli space of abelian varieties. This obstruction has implications for the rational points on these varieties. As a result, we see that all possible 3-level structures can be realized by abelian surfaces, whereas Kummer 3-level structures that group-theoretically may be admissible, may not be realizable over certain base fields. We give an example of a Burkhardt quartic over a bivariate function field whose desingularization has no rational points at all. Our methods are based on the representation theory of Sp(4,3), Galois cohomology, and the classical algebraic geometry of the Burkhardt quartic.

Explore related subjects

math.NTmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nils Bruin, Eugene Filatov. 2022-08-23. Twists of the Burkhardt Quartic Threefold. https://doi.org/10.1007/s40993-022-00372-3

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↗