Search arXivSearch

arXiv · 2312.16796

The $T$-adic Galois representation is surjective for a positive density of Drinfeld modules

Abstract

Let $\mathbb{F}_q$ be the finite field with $q\geq 5$ elements, $A:=\mathbb{F}_q[T]$ and $F:=\mathbb{F}_q(T)$. Assume that $q$ is odd and take $|\cdot|$ to be the absolute value at $\infty$ that is normalized by $|T|=q$. Given a pair $w=(g_1, g_2)\in A^2$ with $g_2\neq 0$, consider the associated Drinfeld module $ϕ^w: A\rightarrow A\{τ\}$ of rank $2$ defined by $ϕ_T^w=T+g_1τ+g_2τ^2$. Fix integers $c_1, c_2\geq 1$ and define $|w|:=max\{|g_1|^{\frac{1}{c_1}}, |g_2|^{\frac{1}{c_2}}\}$. I show that when ordered by height, there is a positive density of pairs $w=(g_1, g_2)$, such that the $T$-adic Galois representation attached to $ϕ^w$ is surjective.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anwesh Ray. 2023-12-28. The $T$-adic Galois representation is surjective for a positive density of Drinfeld modules. https://doi.org/10.1007/s40993-024-00541-6

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