Related papers: Old and new algorithms for pi
Recently published formulas for the surface and regular solid spherical harmonics and for the expansion of the product of two normalized associated Legendre functions with different centers in ellipsoidal coordinates (Telhat Ozdogan, Metin…
The theory of modular forms and spherical harmonic analysis are applied to establish new best bounds towards the counting and equidistribution of rational points on spheres and other higher dimensional ellipsoids, in what may be viewed as a…
In this paper we want to prove some formulas listed by S. Ramanujan in his paper "Modular equations and approximations to $\pi$" \cite{24} with an elementary method.
This paper is a revised version of a previously posted paper in arxiv. The authors posted it as a new submission by mistake. The latest version of the paper can be found at arXiv:math-ph/0512003v2
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…
On the perimeter length determination of the eight-centered oval. Several studies have shown that an eight-centered oval coincides almost perfectly with the ellipse constructed on the same axes and can be considered as a representation of…
In 1987 Jonathan and Peter Borwein, inspired by the works of Ramanujan, derived many efficient algorithms for computing $\pi$. We will see that by using only a formula of Gauss's and elementary algebra we are able to prove the correctness…
The formula for the area of a rhumb polygon, a polygon whose edges are rhumb lines on an ellipsoid of revolution, is derived and a method is given for computing the area accurately. This paper also points out that standard methods for…
This paper generalizes the result of Elmachtoub et al to any weighted barycenter, where a transformation is considered which takes an arbitrary point of division $\xi \in (0,1)$ of the segments of a polygon with $n$ vertices. We then…
This update to my article on Congruent numbers, elliptic curves, and the passage from the local to the global, which appeared in Resonance, December 2009, pp. 1183--1205 (https://www.ias.ac.in/describe/article/reso/014/12/1183-1205) and was…
Given a complex polynomial $p(z)$ of degree $n$ and an ellipse, we find an algorithm of determining the number of zeros of $p$ in the interior and exterior of the ellipse. Our results generalize the previous results of Pt\'ak and Young…
The content of this paper is now available as part of arXiv:0802.2019
This paper has been divided into three papers. arXiv:0809.3232, arXiv:0808.4134, arXiv:cs/0607105
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.
In this paper, we make some remarks on Jos\'e Espinar's paper "Finite index operators on surfaces" [\texttt{arXiv:0911.3767}, to appear in Journal of Geometric Analysis (2011)].
The aim of this communication is to correct inaccurate statements presented in a Commentary on the paper titled: "Radiation forces and torque on a rigid elliptical cylinder in acoustical plane progressive and (quasi)standing waves with…
A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work.…
The Annals of Applied Probability 16 (2006) 984--1033 [URL: http://projecteuclid.org/euclid.aoap/1151592257]
The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartiitons is examined, bearing in…
Work in progress concerning alternative formalizations of arithmetic.