Related papers: Easy Proofs of Some Borwein Algorithms for $\pi$
The parametric bootstrap can be used for the efficient computation of Bayes posterior distributions. Importance sampling formulas take on an easy form relating to the deviance in exponential families and are particularly simple starting…
Carl Friedrich Gauss is often given credit for providing the first correct proof of the fundamental theorem of algebra in his 1799 doctoral dissertation. However, Gauss's proof contained a significant gap. In this paper, we give an…
The von Neumann and quantum R\'enyi entropies characterize fundamental properties of quantum systems and lead to theoretical and practical applications in many fields. Quantum algorithms for estimating quantum entropies, using a quantum…
In this article we use theoretical and numerical methods to evaluate in a closed-exact form the parameters of Ramanujan type $1/\pi$ formulas.
In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…
We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…
The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen.…
``Real Normed Algebras Revisited,'' the last paper of the late Gadi Moran, attempts to reconstruct the discovery of the complex numbers, the quaternions and the octonions, as well as proofs of their properties, using only what was known to…
We give an endorsement for Cornacchia's famous algorithm. Thus we do not claim anything new but an approach which is supposed to be simpler than those of previous works written with the same aim.
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…
An alternative and combinatorial proof is given for a connection between a system of Hahn polynomials and identities for symmetric elements in the Heisenberg algebra, which was first observed by Bender, Mead, and Pinsky [Phys. Rev. Lett. 56…
Continuing pioneering work of Christophe Doche and Laurent Habsieger from 2004, we develop computer algebra algorithms, implemented in Maple, for finding the (necessarily rational) generating function for any integral of products, and in…
New geometric methods for fast evaluation of derivatives of polynomial and rational B\'{e}zier curves are proposed. They apply an algorithm for evaluating polynomial or rational B\'{e}zier curves, which was recently given by the authors.…
We prove rational alternating Ramanujan-type series of level $1$ discovered by the brothers David and Gregory Chudnovky, by using a method of the author. We have carried out the computations with Maple (a symbolic software for mathematics).
Plouffe conjectured rapidly converging series formulas for $\pi^{2n+1}$ and $\zeta (2n+1)$ for small values of $n$. We find the general pattern for all nonnegative integer values of $n$ and offer a proof.
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…
Analysis of the Berlekamp-Massey-Sakata algorithm for decoding one-point codes leads to two methods for improving code rate. One method, due to Feng and Rao, removes parity checks that may be recovered by their majority voting algorithm.…
The Ramanujan Machine project predicts new continued fraction representations of numbers expressed by important mathematical constants. Generally, the value of a continued fraction is found by reducing it to a second order linear difference…
The celebrated result of Kabanets and Impagliazzo (Computational Complexity, 2004) showed that PIT algorithms imply circuit lower bounds, and vice versa. Since then it has been a major challenge to understand the precise connections between…