Search arXivSearch

arXiv · 2212.03386

Artin's Conjecture for Abelian Varieties with Frobenius Condition

Abstract

$A$ be an abelian variety over a number field $K$ of dimension $r$, $a_1, \dots, a_g \in A(K)$ and $F/K$ a finite Galois extension. We consider the density of primes $\frak p$ of $K$ such that the quotient $\bar{A}(k({\frak p}))/\langle \bar{a}_1,\dots,\bar{a}_g\rangle$ has at most $2r-1$ cyclic components and $\frak p$ satisfies a Frobenius condition with respect to $F/K$, where $\bar{A}$ is the reduction of $A$ modulo $\frak p$, $k(\frak p)$ is the residue class field of $\frak p$ and $\langle \bar{a}_1,\dots,\bar{a}_g\rangle$ is the subgroup generated by the reductions $\bar{a}_1,\dots,\bar{a}_g$. We develop a general framework to prove the existence of the density under the Generalized Riemann Hypothesis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Florian Hess, Leonard Tomczak. 2022-12-07. Artin's Conjecture for Abelian Varieties with Frobenius Condition. https://doi.org/10.1016/j.jnt.2025.09.017

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