Related papers: The Ramanujan Machine: Automatically Generated Con…

We prove that there is a correspondence between Ramanujan-type formulas for 1/\pi, and formulas for Dirichlet L-values. The same method also allows us to resolve certain values of the Epstein zeta function in terms of rapidly converging…

Theories of fundamental physics as well as cosmology must ultimately not only account for the structure and evolution of the universe and the physics of fundamental interactions, but also lead to an understanding of why this particular…

In our recent publication we have proposed a new methodology for determination of the two-term Machin-like formula for pi with small arguments of the arctangent function of kind $$ \frac{\pi }{4} = {2^{k - 1}}\arctan \left(…

This paper uses the machinery of almost periodic functions to prove that even without uniform convergence the connection between a pair of almost periodic functions and the constants of the associated Fourier series exists for both the…

This article describes the various experimental bounds on the variation of the fundamental constants of nature. After a discussion on the role of fundamental constants, of their definition and link with metrology, the various constraints on…

In his book \emph{Topics in Analytic Number Theory}, Hans Rademacher conjectured that the limits of certain sequences of coefficients that arise in the ordinary partial fraction decomposition of the generating function for partitions of…

In this work, we develop a new iterative method for computing the digits of $\pi$ by argument reduction of the tangent function. This method combines a modified version of the iterative formula for $\pi$ with squared convergence that we…

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

In our recent work on iterative computation in hardware, we showed that arbitrary-precision solvers can perform more favorably than their traditional arithmetic equivalents when the latter's precisions are either under- or over-budgeted for…

Re presenting the traditional proof of Srinivasa Ramanujan's own favorite series for the reciprocal of $\pi$ :\begin{equation}\frac{1}{\pi} = \frac{\sqrt{8}}{9801} \sum_{n=0}^{+\infty} \frac{(4n)!}{(n!)^4} \frac{1103 + 26390n}{396^{4n}} \;…

Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…

The study of mixture models constitutes a large domain of research in statistics. In the first part of this work, we present phi-divergences and the existing methods which produce robust estimators. We are more particularly interested in…

Iterative methods play an important role in science and engineering applications, with uses ranging from linear system solvers in finite element methods to optimization solvers in model predictive control. Recently, a new computational…

We outline an elementary method for proving numerical hypergeometric identities, in particular, Ramanujan-type identities for $1/\pi$. The principal idea is using algebraic transformations of arithmetic hypergeometric series to translate…

We present a general procedure to generate infinitely many BBP and BBP-like formulas for the simplest transcendental numbers. This provides some insight and a better understanding into their nature. In particular, we can derive the main…

For each $t \in {\bf R}$, define the entire function $$ H_t(x) := \int_0^\infty e^{tu^2} \Phi(u) \cos(xu)\ du$$ where $\Phi$ is the super-exponentially decaying function $$ \Phi(u) := \sum_{n=1}^\infty (2\pi^2 n^4 e^{9u} - 3\pi n^2 e^{5u} )…

The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…

We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…

We investigate some aspects of the geometry of two classical generalisations of the Hilbert schemes of points. Precisely, we show that parity conjecture for $\text{Quot}_r^d\mathbb{A}^3$ already fails for $d=8$ and $r=2$ and that lots of…

Our aim is to find a complex continued fraction algorithm finding all the best Diophantine approximations to a complex number. Using the sequence of minimal vectors in a two dimensional lattice over Gaussian integers, we obtain an algorithm…