Related papers: Tweaking Ramanujan's Approximation of n!
This paper introduces a new version of the smoothly trimmed mean with a more general version of weights, which can be used as an alternative to the classical trimmed mean. We derive its asymptotic variance and to further investigate its…
We prove and generalize a conjecture in arXiv:1610.0474(4) about the asymptotics of $\frac{1}{\sqrt{n!}} f^{\lambda/\mu}$, where $f^{\lambda/\mu}$ is the number of standard Young tableaux of skew shape $\lambda/\mu$ which have stable limit…
We present the first nontrivial approximation algorithm for the bottleneck asymmetric traveling salesman problem. Given an asymmetric metric cost between n vertices, the problem is to find a Hamiltonian cycle that minimizes its bottleneck…
The review presents the development of an approach of constructing approximate solutions to complicated physics problems, starting from asymptotic series, through optimized perturbation theory, to self-similar approximation theory. The…
In this paper we have adapted Bahl and Tuteja (1991) estimator in systematic sampling using auxiliary information. Using Bedi (1996) transformation an improved estimator is also proposed under systematic sampling. The expressions of bias…
An asymptotic expansion of a ratio of products of gamma functions is derived. It generalizes a formula which was stated by Dingle, first proved by Paris, and recently reconsidered by Olver.
Recently, symbolic regression (SR) has demonstrated its efficiency for discovering basic governing relations in physical systems. A major impact can be potentially achieved by coupling symbolic regression with asymptotic methodology. The…
The Asymptotic Iteration Method (AIM) is a technique for solving analytically and approximately the linear second-order differential equation, especially the eigenvalue problems that frequently appear in theoretical and mathematical…
In 1986, Andrews studied the function $\sigma(q)$ from Ramanujan's ``Lost" Notebook, and made several conjectures on its Fourier coefficients $S(n)$, which count certain partition ranks. In 1988, Andrews-Dyson-Hickerson famously resolved…
We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…
We study the convergence of a class of asymptotic preserving numerical schemes initially proposed by F. Filbet & S. Jin \cite{filb1} and G. Dimarco & L. Pareschi \cite{DimarcoP} in the context of nonlinear and stiff kinetic equations. Here,…
A recent article on generalised linear mixed model asymptotics, Jiang et al. (2022), derived the rates of convergence for the asymptotic variances of maximum likelihood estimators. If $m$ denotes the number of groups and $n$ is the average…
Srinivasa Ramanujan provided series expansions of certain arithmetical functions in terms of the exponential sums defined by $c_r(n) = \sum\limits_{\substack{{m=1}\\ (m,r)=1}}^{r} e^{\frac{2 \pi imn}{r}}$ in [Trans. Cambridge Phillos. Soc,…
We obtain the Strichartz inequalities $$ \| u \|_{L^q_t L^r_x([0,1] \times M)} \leq C \| u(0) \|_{L^2(M)}$$ for any smooth $n$-dimensional Riemannian manifold $M$ which is asymptotically conic at infinity (with either short-range or…
Recent work by M. Afifurrahman established the first asymptotic estimates with error terms for the number of $2\times 2$ matrices with fixed non-zero determinant $n\in\mathbb{N}$, and with coefficients bounded in absolute value by $X$. In…
A representation for the Riemann zeta function valid for arbitrary complex $s=\sigma+it$ is $\zeta(s)=\sum_{n=0}^\infty A(n,s)$, where \[A(n,s)=\frac{2^{-n-1}}{1-2^{1-s}} \sum_{k=0}^n \left(\!\begin{array}{c}n\\k\end{array}\!\right)…
The Stieltjes constants $\gamma_n$ appear in the coefficients in the Laurent expansion of the Riemann zeta function $\zeta(s)$ about the simple pole $s=1$. We present an asymptotic expansion for $\gamma_n$ as $n\rightarrow \infty$ based on…
Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later Rademacher obtained a convergent series for $p(n)$ and an error bound was given by Lehmer. Despite having this, a full asymptotic expansion…
In this paper, we study $C(x, y)$, the second moment of Ramanujan sums. Assuming the Riemann Hypothesis(RH), we establish an asymptotic formula for $C(x, y)$ with improved error term. Our analysis applies uniformly to the case where $x$ and…
For the Chebyshev-Stirling numbers, a special case of the Jacobi-Stirling numbers, asymptotic formulae are derived in terms of a local central limit theorem. The underlying probabilistic approach also applies to the classical Stirling…