Search arXivSearch

arXiv · 2411.07857

The constructive inverse Galois problem via Hilbert modular forms: realizing the transitive group 17T7

Abstract

We show how Hilbert modular forms can be used in the constructive inverse Galois problem over the rationals. In particular, we prove that the transitive permutation group 17T7, isomorphic to a split extension of C_2 by PSL_2(FF_16), is a Galois group over the rationals and exhibit an explicit degree 17 polynomial with this Galois group. The group arises from the field of definition of the 2-torsion on an abelian fourfold with real multiplication defined over a real quadratic field; we find such a fourfold attached to a Hilbert modular form. Building upon work of Dembele, we describe a method for reconstructing a period matrix attached to a Hilbert modular form, and we use it to construct the 2-isogeny polynomial. We also rigorously identify the relevant fourfold as the Jacobian of a genus 4 Shimura curve and compute explicit equations for this curve.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raymond van Bommel, Edgar Costa, Noam D. Elkies, Timo Keller, Sam Schiavone, John Voight. 2026-06-01. The constructive inverse Galois problem via Hilbert modular forms: realizing the transitive group 17T7. https://arxiv.org/abs/2411.07857

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