Search arXivSearch

arXiv · 1712.05528

Lübeck's classification of representations of finite simple groups of Lie type and the inverse Galois problem for some orthogonal groups

Abstract

In this paper we prove that for each integer of the form $n=4\varpi$ (where $\varpi$ is a prime between $17$ and $73$) at least one of the following groups: $PΩ^+_n(\mathbb{F}_{\ell^s})$, $PSO^+_n(\mathbb{F}_{\ell^s})$, $PO_n^+(\mathbb{F}_{\ell^s})$ or $PGO^+_n(\mathbb{F}_{\ell^s})$ is a Galois group of $\mathbb{Q}$ for almost all primes $\ell$ and infinitely many integers $s > 0$. This is achieved by making use of the classification of small degree representations of finite simple groups of Lie type in defining characteristic of F. Lübeck and a previous result of the author on the image of the Galois representations attached to RAESDC automorphic representations of $GL_n(\mathbb{A}_\mathbb{Q})$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adrian Zenteno. 2019-07-16. Lübeck's classification of representations of finite simple groups of Lie type and the inverse Galois problem for some orthogonal groups. https://doi.org/10.1016/j.jnt.2019.06.010

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