Search arXivSearch

arXiv · 2609.20201

Sampling and Moments of Reciprocal Quadratic Mellin Integrals

Abstract

We study logarithmic Mellin integrals attached to a reciprocal quadratic rational function. When the rational kernel has algebraic coefficients, positive-integer samples of an entire deformation have a generating function which, after division by $π$, is algebraic for every $a\in\mathbb Q$ with $0<\vert{}a\vert{}<1$. For the principal half-weight example we determine the minimal quartic, complete finite branch locus, minimal differential equation, polynomial recurrence, and coefficient asymptotics. Throughout the saddle region $c>1$, $-2\sqrt c<b<0$, positive hyperbolic formulas for real $0<a<1$ give determinate Hausdorff moment sequences, strict total positivity, and monotone quotient limits. For real $\vert{}a\vert{}<1$, a general coefficient asymptotic in the same region shows that one maximum controls both the sampling radius and the high logarithmic moments. On the fixed-critical locus, two-term diagonal asymptotics give a normalized product tending to $π$; division by the displayed correction $1+γ/M$ gives an $O(M^{-2})$ approximation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

K. Srinivasa Raghava. 2026-07-25. Sampling and Moments of Reciprocal Quadratic Mellin Integrals. https://arxiv.org/abs/2609.20201

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