Search arXivSearch

arXiv · 2307.10140

Remarks on a theorem of Pink in presence of bad reduction

Abstract

In this note we prove new cases of the Mumford-Tate conjecture by extending a theorem of Richard Pink for abelian varieties without nontrivial endomorphisms and with bad semistable reduction. We use quadratic pairs introduced by J.G.Thompson in the seventies, an important tool in the program of classifying all simple finite groups. Proof of our main result applies the classification of the quadratic pairs as described by Premet and Suprunenko. Along the way we reprove and generalize a theorem of Chris Hall on the image of Tate module representation of abelian variety as above, to all possible values of its toric dimension.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wojciech Gajda, Marc Hindry. 2023-07-19. Remarks on a theorem of Pink in presence of bad reduction. https://arxiv.org/abs/2307.10140

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