Related papers: A Refinement of Ramanujan's Factorial Approximatio…
In [14,26], new approximation classes of self-referential functions are introduced as fractal versions of the classes of polynomials and rational functions. As a sequel, in the present article, we define a new approximation class consisting…
Ramanujan's Master Theorem is a decades-old theorem in the theory of Mellin transforms which has wide applications in both mathematics and high energy physics. The unconventional method of Ramanujan in his proof of the theorem left…
In this paper, we provide explicit upper and lower bounds for the argument of the Riemann zeta-function and its antiderivatives in the critical strip under the assumption of the Riemann hypothesis. This extends the previously known bounds…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
Given two arithmetical functions $f,g$ we derive, under suitable conditions, asymptotic formulas with error term, for the convolution sums $\sum_{n \le N} f(n) g(n+h)$, building on an earlier work of Gadiyar, Murty and Padma. A key role in…
In this article we present ways to evaluate certain sums, products and continued fractions using tools from the theory of elliptic functions. The specific results appear to be new, although similar ones can be found in the leterature; in…
Two inequalities concerning the symmetry of the zeta-function and the Ramanujan $\tau$-function are improved through the use of some elementary considerations.
Refinements of the classical Rogers-Ramanujan identities are given in which some parts are weighted. Combinatorial interpretations refining MacMahon's results are corollaries.
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…
We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at…
We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…
This paper proposes a unique optimization approach for estimating the minimax rational approximation and its application for evaluating matrix functions. Our method enables the extension to generalized rational approximations and has the…
This is an elementary explanation of a cubic composition formula due to Ramanujan.
The development of randomized algorithms for numerical linear algebra, e.g. for computing approximate QR and SVD factorizations, has recently become an intense area of research. This paper studies one of the most frequently discussed…
A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…
The goal of this work is to formulate a systematical method for looking for the simple closed form or continued fraction representation of a class of rational series. As applications, we obtain the continued fraction representations for the…
We present a generalization of the construction of graphs by Lubotzky, Phillips and Sarnak in their celebrated article "Ramanujan graphs". The new approach consists in using octonion algebras rather than quaternions. A key tool is the…
The perimeter of an ellipse has no exact closed-form expression in terms of elementary functions, and numerous approximations have been proposed since the eighteenth century. Classical formulas by Fagnano, Euler, and Ramanujan, as well as…
An algebraic transformation of the DeTemple-Wang half-integer approximation to the harmonic series produces the general formula and error estimate for the Ramanujan expansion for the nth harmonic number into negative powers of the nth…
In this paper, we introduce some explicit approximations for the summation $\sum_{k\leq n}\Omega(k)$, where $\Omega(k)$ is the total number of prime factors of $k$.