Search arXivSearch

arXiv · 1911.04141

$\mathbb Q$-linear dependence of certain Bessel moments

Abstract

Let $I_0$ and $K_0$ be modified Bessel functions of the zeroth order. We use Vanhove's differential operators for Feynman integrals to derive upper bounds for dimensions of the $\mathbb Q$-vector space spanned by certain sequences of Bessel moments \[ \left\{\left.\int_0^\infty [I_0(t)]^a[K_0(t)]^b t^{2k+1}\mathrm{d}\, t\right|k\in\mathbb Z_{\geq0}\right\},\]where $a$ and $b$ are fixed non-negative integers. For $ a\in\mathbb Z\cap[1,b)$, our upper bound for the $ \mathbb Q$-linear dimension is $\lfloor (a+b-1)/2\rfloor$, which improves the Borwein-Salvy bound $\lfloor (a+b+1)/2\rfloor$. Our new upper bound $\lfloor (a+b-1)/2\rfloor$ is not sharp for $ a=2,b=6$, due to an exceptional $ \mathbb Q$-linear relation $\int_0^\infty [I_0(t)]^2[K_0(t)]^6 t\mathrm{d}\, t=72\int_0^\infty [I_0(t)]^2[K_0(t)]^6 t^{3}\mathrm{d}\, t$, which is provable by integrating modular forms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yajun Zhou. 2021-02-16. $\mathbb Q$-linear dependence of certain Bessel moments. https://doi.org/10.1007/s11139-021-00416-9

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