Related papers: Tweaking Ramanujan's Approximation of n!
Richard Stanley proved that the centralized/normalized version of the random variable "length of largest up-down subsequence" in a random permutation of length n is asymptotically normal. We go beyond and present a more refined asymptotic…
In this paper, we give direct theorems on point wise and global approximation by new variants of Bernstein-Durrmeyer operator, introduced by A.-M. et al.[1].
In a series of papers the author and others have studied an asymptotic expansion of the errors of the eigenvalue approximation, using the spectral symbol, in connection with Toeplitz (and Toeplitz-like) matrices, that is, $E_{j,n}$ in…
We provide a rigorous formulation of Entry 17(v) in Ramanujan's Notebooks and show how this relates to the first Stieltjes constant. A new proposition 4.5 is included to show the close relationship with some analysis presented by…
Azadkia and Chatterjee (2021) recently introduced a simple nearest neighbor (NN) graph-based correlation coefficient that consistently detects both independence and functional dependence. Specifically, it approximates a measure of…
We consider the asymptotic expansion for $x\to\pm\infty$ of the entire function \[F_{n,\sigma}(x;\mu)=\sum_{k=0}^\infty \frac{\sin\,(n\gamma_k)}{\sin \gamma_k}\,\frac{x^k}{k! \Gamma(\mu-\sigma k)},\quad \gamma_k=\frac{(k+1)\pi}{2n}\] for…
In the paper, the authors establish some asymptotic formulas and double inequalities for the factorial $n!$ and the gamma function $\Gamma$ in terms of the tri-gamma function $\psi'$.
Srinivasa Ramanujan posed a problem on infinite nested radical of the square root in the Journal of Indian Mathematical Society in 1911. He had generated the problem years before in the form of an example illustrating a more general…
The aim of this paper is to apply an original computation method due to Malesevic and Makragic [5] to the problem of approximating some trigonometric functions. Inequalities of Wilker-Cusa-Huygens are discussed, but the method can be…
Ramanujan wrote the following identity \begin{align*} \sqrt{2 \left(1 - \frac{1}{3^2}\right) \left(1 - \frac{1}{7^2}\right) \left(1 - \frac{1}{11^2}\right) \left(1 - \frac{1}{19^2}\right)} \ = \ \left(1 + \frac{1}{7}\right) \left(1 +…
RRT* is one of the most widely used sampling-based algorithms for asymptotically-optimal motion planning. This algorithm laid the foundations for optimality in motion planning as a whole, and inspired the development of numerous new…
Ramanujan studied a general class of Stirling constants that are the resummation of some natural divergent series. These constants include the classical Euler-Mascheroni, Stirling and Glaisher-Kinkelin constants. We find natural integral…
The self-consistent expansion (SCE) is a powerful technique for obtaining perturbative solutions to problems in statistical physics but it suffers from a subtle problem - too much freedom! The SCE can be used to generate an enormous number…
Let $S_r(p,q)$ be the $r$-associated Stirling numbers of the second kind, the number of ways to partition a set of size $p$ into $q$ subsets of size at least $r$. For $r=1$, these are the standard Stirling numbers of the second kind, and…
We present a detailed error analysis of Ramanujan's most accurate approximation to the perimeter of an ellipse.
We present a new asymptotic formula for the Stieltjes constants which is both simpler and more accurate than several others published in the literature (see e.g. \cite{Fekih-Ahmed}, \cite{Knessl Coffey}, \cite{Paris}). More importantly, it…
Let $f(q)=1+\sum_{n=1}^{\infty} \alpha(n)q^n$ be the well-known third order mock theta of Ramanujan. In 1964, George Andrews proved an asymptotic formula of the form $$\alpha(n)= \sum_{c\leq\sqrt{n}}…
In [8], asymptotic expansion of the martingale with mixed normal limit was provided. The expansion formula is expressed by the adjoint of a random symbol with coefficients described by the Malliavin calculus, differently from the standard…
This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…
In this paper we consider approximations to the popular Pitman-Yor process obtained by truncating the stick-breaking representation. The truncation is determined by a random stopping rule that achieves an almost sure control on the…