Related papers: Revisiting an infinitely nested radical
A simple integration by parts and telescopic cancellation leads to a rigorous derivation of the first 2 terms for the error in Ramanujan's asymptotic series for the nth partial sum of the harmonic series. Then Kummer's transformation gives…
Ramanujan made many beautiful and elegant discoveries in his short life of 32 years, and one of them that has attracted the attention of several mathematicians over the years is his intriguing formula for $\zeta(2n+1)$. To be sure,…
In 2015 Choi, Kim, and Lovejoy studied a weighted partition function, $A_1(m)$, which counted subpartitions with a structure related to the Rogers--Ramanujan identities. They conjectured the existence of an infinite class of congruences for…
We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.
In this paper we present a new termination proof and complexity analysis of unfolding graph rewriting which is a specific kind of infinite graph rewriting expressing the general form of safe recursion. We introduce a termination order over…
The work starts a series of papers on topological radicals and their applications. Among other results we present a theory of radicals related to the joint tensor radius.
We consider two {seemingly} different definitions of infinite words which contain {the} utmost number of palindromes. We show that these two definitions coincide. {The keynote of the proof is a meticulous inspection of properties of…
If a continued fraction $K_{n=1}^{\infty} a_{n}/b_{n}$ is known to converge but its limit is not easy to determine, it may be easier to use an extension of $K_{n=1}^{\infty}a_{n}/b_{n}$ to find the limit. By an extension of…
The Ramanujan Machine project detects new expressions related to constants of interest, such as $\zeta$ function values, $\gamma$ and algebraic numbers (to name a few). In particular the project lists a number of conjectures involving even…
This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…
By using Euler's approach of using Euclid's algorithm to expand a power series into a continued fraction, we show how to derive Ramanujan's $q$-continued fractions in a systematic manner.
In this paper, we investigate several infinite products with vanishing Taylor coefficients in arihmetic progressions. These infinite products are closely related to the Rogers--Ramanujan continued fraction. Moreover, a handful of new…
We provide an historical account of equivalent conditions for the Riemann Hypothesis arising from the work of Ramanujan and, later, Guy Robin on generalized highly composite numbers. The first part of the paper is on the mathematical…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
We consider signed graphs, i.e, graphs with positive or negative signs on their edges. We construct some families of bipartite signed graphs with only two distinct eigenvalues. This leads to constructing infinite families of regular…
In this paper, we utilize operational methods to obtain closed-form solutions for certain classes of integrals in the spirit of Ramanujan's Master Theorem and provide several analogs to it. Although the use of operational calculus makes the…
Let $b$ be a numeration base. A $b$-additive Ramanujan-Hardy number $N$ is an integer for which there exists at least an integer $M$, called additive multiplier, such that the product of $M$ and the sum of base $b$ digits of $N$, added to…
Ramanujan's approximation to the exponential function is reexamined with the help of Perron's saddle-point method. This allows for a wide generalization that includes the results of Buckholtz, and where all the asymptotic expansion…
We generalize Ramanujan method of approximating the smallest root of an equation which is found in Ramanujan Note books, Part-I. We provide simple analytical proof to study convergence of this method. Moreover, we study iterative approach…
Expander graphs in general, and Ramanujan graphs in particular, have been of great interest in the last three decades with many applications in computer science, combinatorics and even pure mathematics. In these notes we describe various…