Indexed metadata

A Joint Local Limit Theorem for Prime Divisor Counting Functions

Jovan Andreevski

Source record

Source: arXiv

Published: Oct 20, 2026

arXiv: 2610.28328

Open original source ↗

Source abstract

We establish a uniform two-dimensional local limit theorem for the joint distribution of Ω(n)Ω(n) and Ω(n+1)Ω(n+1). More precisely, along a set of scales of logarithmic density one, the normalized joint counts are uniformly approximated by the density of two independent Gaussian random variables, each with mean and variance log⁡log⁡x\log\log x, up to a power-saving error. The proof builds upon a recent circle-method framework of Tao and Teräväinen. Our results equally hold for the additive function ωω. Additionally, we explore applications of our local limit theorem in the setting of uniquely ergodic systems.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A Joint Local Limit Theorem for Prime Divisor Counting Functions — Mathematical Frontier Network