SearcharxivSearch

arXiv · 2103.09654

Ramanujan in Computing Technology

Abstract

This paper is a tribute to the genius of the legendary Indian mathematician Srinivasa Ramanujan (22 December 1887 - 26 April 1920) in the centenary year of his death. The life story of Ramanujan is so well known that it needs no elaboration not even a summarisation. In his short life period he made substantial contributions to mathematical analysis, number theory, infinite series, and continued fractions, including solutions to mathematical problems then considered unsolvable. Ramanujan independently compiled nearly 3,900 results in the form of identities and equations. Many were completely novel; his original and highly unconventional results, such as the Ramanujan prime, the Ramanujan theta function, partition formulae and mock theta functions, have opened entire new areas of work and inspired a vast amount of further research. Nearly all his claims have now been proven correct. The focus of the paper is the increasing influence of the ideas propounded by Ramanujan in the development of computing technology. We shall discuss the application of certain infinite series discovered by Ramanujan in computing the value of the mathematical constant $\pi$. We shall also consider certain special graphs known as Ramanujan graphs and the reason for designating them as such. We shall examine how certain researchers are attempting to create an abstract machine which they call Ramanujan machine which is thought of as simulating the hypothesised thought process of Ramnujan. We shall also have a brief look at the applications of Ramanujan's discoveries in signal processing.

Explore related subjects

Keep this discovery

BibTeXRIS

V. N. Krishnachandran. 2021-03-13. Ramanujan in Computing Technology. https://arxiv.org/abs/2103.09654

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO