Searcharxiv⌕ Search

arXiv subjects

R. Padma

Publications and source records attributed to R. Padma.

At least 19 recordsLinked to original sources
arXiv2021

A heuristic derivation of linear recurrence relations for $\zeta '(-2k)$ and $\zeta(2k+1)$

We have gone back to old methods found in the historical part of Hardy's Divergent Series well before the invention of the modern analytic continuation to use formal manipulation of harmonic sums which produce some interesting formulae. These are linear recurrence relations for $\displaystyle{ \sum_{n=1}^\infty H_n n^k}$ which in turn yield linear recurrence relations for $\zeta '(-k)$ and hence using the functional equation to a linear recurrence relation for $\zeta '(2k)$ and $\zeta (2k+1)$. Questions of rigor have been postponed to a subsequent preprint.

math.NT↗
arXiv2009

Ramanujan Summation and the Exponential Generating Function $ \sum_{k=0}^{\infty}\frac{z^{k}}{k!}ζ^{\prime}(-k)$

In the sixth chapter of his notebooks Ramanujan introduced a method of summing divergent series which assigns to the series the value of the associated Euler-MacLaurin constant that arises by applying the Euler-MacLaurin summation formula to the partial sums of the series. This method is now called the Ramanujan summation process. In this paper we calculate the Ramanujan sum of the exponential generating functions $\sum_{n\geq 1}\log n e^{nz}$ and $\sum_{n\geq 1}H_n^{(j)} e^{-nz}$ where $H_n^{(j)}=\sum_{m=1}^n \frac{1}{m^j}$. We find a surprising relation between the two sums when $j=1$ from which follows a formula that connects the derivatives of the Riemann zeta - function at the negative integers to the Ramanujan summation of the divergent Euler sums $\sum_{n\ge 1} n^kH_n, k \ge 0$, where $H_n= H_n^{(1)}$. Further, we express our results on the Ramanujan summation in terms of the classical summation process called the Borel sum.

math.NT↗
arXiv2008

Alternating Euler sums at the negative integers

We study three special Dirichlet series, two of them alternating, related to the Riemann zeta function. These series are shown to have extensions to the entire complex plane and we find their values at the negative integers (or residues at poles). These values are given in terms of Bernoulli and Euler numbers.

math.NT↗
arXiv2007

What is the Inverse of Repeated Square and Multiply Algorithm?

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not equal to 2. In this paper a couple of probabilistic algorithms to compute the discrete logarithm over finite fields are given by bypassing this difficulty. One of the algorithms was inspired by the famous 3x+1 problem.

math.NT↗
arXiv2006

A Comment on Matiyasevich's Identity #0102 with Bernoulli Numbers

We connect and generalize Matiyasevich's identity #0102 with Bernoulli numbers and an identity of Candelpergher, Coppo and Delabaere on Ramanujan summation of the divergent series of the infinite sum of the harmonic numbers. The formulae are analytic continuation of Euler sums and lead to new recursion relations for derivatives of Bernoulli numbers. The techniques used are contour integration, generating functions and divergent series.

math.NT↗
arXiv2005

Ramanujan - Fourier Series and the Density of Sophie Germain Primes

A prime p is called Sophie Germain prime if 2p+1 is also prime. A formula for the density of such primes is given in a more general setting using a new approach. This method uses the Ramanujan-Fourier series for a modified von Mangoldt function. The proof remains heuristic as interchange of certain limits has not been justified. Experimental evidence using computer calculations is provided for the plausibility of the result.

math.NT↗
arXiv2003

The Signals and Systems Approach to Quantum Computation

In this note we point out the fact that the proper conceptual setting of quantum computation is the theory of Linear Time Invariant systems. To convince readers of the utility of the approach, we introduce a new model of computation based on the orthogonal group. This makes the link to traditional electronics engineering clear. We conjecture that the speed up achieved in quantum computation is at the cost of increased circuit complexity.

quant-ph↗
arXiv2003

The Japanese approach to the Shimura - Taniyama conjecture

In this note we point out links between the Shimura - Taniyama conjecture and certain ideas in physics. Since all the seminal references are by strange coincidence Japanese we wish to call this the Japanese approach. The note elaborates on some inspired comments made by Barry Mazur in his popular article "Number theory as gadfly."

math-ph↗