English

Distributional asymptotics mod 1 of $(\log_bn)$

Number Theory 2019-03-06 v3 Probability

Abstract

This paper studies the distributional asymptotics of the slowly changing sequence of logarithms (logbn)(\log_bn) with bN{1}.b\in\mathbb{N}\setminus\{1\}. It is known that (logbn)(\log_bn) is not uniformly distributed modulo one, and its omega limit set is composed of a family of translated exponential distributions with constant logb.\log b. An improved upper estimate (logN/N)\left(\sqrt{\log N}/N\right) is obtained for the rate of convergence with respect to (w.r.t.) the Kantorovich metric on the circle, compared to the general results on rates of convergence for a class of slowly changing sequences in the author's companion in-progress work. Moreover, a sharp rate of convergence (logN/N)\left(\log N/N\right) w.r.t. the Kantorovich metric on the interval [0,1][0,1], is derived. As a byproduct, the rate of convergence w.r.t. the discrepancy metric (or the Kolmogorov metric) turns out to be (logN/N)\left(\log N/N\right) as well, which verifies that an upper bound for this rate derived in [Y. Ohkubo and O. Strauch, Distribution of leading digits of numbers, Unif. Distrib. Theory, 11\textbf{11} (2016), no.1, 23--45.] is sharp.

Keywords

Cite

@article{arxiv.1609.08207,
  title  = {Distributional asymptotics mod 1 of $(\log_bn)$},
  author = {Chuang Xu},
  journal= {arXiv preprint arXiv:1609.08207},
  year   = {2019}
}

Comments

To appear in Unif. Distrib. Theory

R2 v1 2026-06-22T16:02:10.580Z