Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2408.14182

Explicit bounds for Bell numbers and their ratios

Jerzy Grunwald·Grzegorz Serafin
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main results correspond to two asymptotic forms expressed by means of the Lambert $W$ function. As an application, some straightforward elementary bounds are derived. Additionally, an absolute convergence rate of the ratio of the consecutive Bell numbers is derived. The main challenge was to obtain satisfactory constants, as the Bell numbers grow rapidly, while the convergence rates are rather slow.

Explore related subjects

math.NTmath.CAmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jerzy Grunwald, Grzegorz Serafin. 2024-08-26. Explicit bounds for Bell numbers and their ratios. https://arxiv.org/abs/2408.14182

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗