Search arXivSearch

arXiv · 1612.08035

Non-parametricity of rational translates of regular Galois extensions

Abstract

We generalize a result of F.\ Legrand about the existence of non-parametric Galois extensions for a given group $G$. More precisely, for a $K$-regular Galois extension $F|K(t)$, we consider the translates $F(s)|K(s)$ by an extension $K(s)|K(t)$ of rational function fields (in other words, $s$ is a root of $g(X)-t$ for some rational function $g\in K(X)$). We then show that if $F|K(t)$ is a $K$-regular Galois extension with group $G$ over a number field $K$, then for any degree $k\ge 2$ and almost all (in a density sense) rational functions $g$ of degree $k$, the translate of $F$ by a root field of $g(X)-t$ over $K(t)$ is non-$G$-parametric, i.e.\ not all Galois extensions of $K$ with group $G$ arise as specializations of $F(s)|K(s)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joachim König. 2017-06-11. Non-parametricity of rational translates of regular Galois extensions. https://arxiv.org/abs/1612.08035

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