Search arXivSearch

arXiv · 2406.00206

Frobenius intertwiners for q-difference equations

Abstract

We consider a class of $q$-hypergeometric equations describing the quantum difference equation for the cotangent bundles over projective spaces $X=T^{*}\mathbb{P}^{n-1}$ . We show that over $\mathbb{Q}_p$ these equations are equipped with the Frobenius action $(q,z)\to (q^p,z^p)$. We obtain an explicit formula for the constant term of the Frobenius intertwiner in terms of the $p$-adic $q$-gamma function of Koblitz. In the limit $q\to 1$ we arrive at the Frobenius structures for the $p$-adic hypergeometric and Bessel differential equations studied by Dwork. In particular, we find closed formulas for $p$-adic constants appearing in works of Dwork and Sperber in terms of $p$-adic zeta functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrey Smirnov. 2025-02-24. Frobenius intertwiners for q-difference equations. https://arxiv.org/abs/2406.00206

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