Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.08121

Residue of special functions of Anderson $A$-modules at the characteristic graph

Quentin Gazda·Andreas Maurischat
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $E$ be an Anderson $A$-module over $\mathbb{C}_{\infty}$. The period lattice of $E$ is related to its module of special functions by means of a non-canonical isomorphism introduced by the authors in [GM21]. In this paper, we explain how a modification of the inverse map is canonical by interpreting it as a residue morphism along the characteristic graph. This phenomenon has already been observed in various situations. The main innovation of this text is that of costability (costable admissible opens, costable site, etc.) which provides a convenient framework to develop the notion of sheaves of $E(\mathbb{C}_{\infty})$-valued meromorphic functions on the rigid analytic plane.

Explore related subjects

math.NTmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Quentin Gazda, Andreas Maurischat. 2024-02-22. Residue of special functions of Anderson $A$-modules at the characteristic graph. https://doi.org/10.1016/j.jnt.2024.01.013

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗