Related papers: Fast Ramanujan--type Series for Logarithms. Part I…

We consider the computation of the matrix logarithm by using numerical quadrature. The efficiency of numerical quadrature depends on the integrand and the choice of quadrature formula. The Gauss--Legendre quadrature has been conventionally…

Using the theory of Calabi-Yau differential equations we obtain all the parameters of Ramanujan-Sato-like series for $1/\pi^2$ as $q$-functions valid in the complex plane. Then we use these q-functions together with a conjecture to find new…

Polynomial reduction, designed first for hypergeometric terms, can be used to automatically prove and generate new hypergeometric identities from old ones. In this paper, we extend the reduction method to holonomic sequences. As…

In recent work, Darmon, Pozzi and Vonk explicitly construct a modular form whose spectral coefficients are $p$-adic logarithms of Gross-Stark units and Stark-Heegner points. Here we describe how this construction gives rise to a practical…

We establish $L^p$ error estimates for monotone numerical schemes approximating Hamilton-Jacobi equations on the $d$-dimensional torus. Using the adjoint method, we first prove a $L^1$ error bound of order one for finite-difference and…

When Mike Hirschhorn showed us his lovely gem, that gives the simplest-to-date proof of Ramanujan's famous result that p(11n+6) is divisible by 11, we realized that his amazing method can be extended, and taught to a computer, and can prove…

We show with some examples how to prove some Ramanujan-type series for $1/\pi$ in an elementary way by using terminating identities.

We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…

Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23…

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

In this work we describe a fast and stable algorithm for the computation of the orthogonal moments of an image. Indeed, orthogonal moments are characterized by a high discriminative power, but some of their possible formulations are…

In a famous paper of $1914$ Ramanujan gave a list of $17$ extraordinary formulas for the number $\pi$. In this paper we explain a general method to prove them, based on an original idea of James Wan and in some own ideas.

The study of Ramanujan-type congruences for functions specific to additive number theory has a long and rich history. Motivated by recent connections between divisor sums and overpartitions via congruences in arithmetic progressions, we…

A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide a unified geometric argument,…

Arc spaces have been introduced in algebraic geometry as a tool to study singularities but they show strong connections with combinatorics as well. Exploiting these relations we obtain a new approach to the classical Rogers-Ramanujan…

The standard approximation of a natural logarithm in statistical analysis interprets a linear change of \(p\) in \(\ln(X)\) as a \((1+p)\) proportional change in \(X\), which is only accurate for small values of \(p\). I suggest…

Recent breakthrough methods \cite{gggz,joux,bgjt} on computing discrete logarithms in small characteristic finite fields share an interesting feature in common with the earlier medium prime function field sieve method \cite{jl}. To solve…

Ramanujan's trigonometric sum $c_q(n)$ can be interpreted as a set of trigonometric moments of a finite measure concentrated at primitive $q$-th roots of unity with equal masses. This gives rise to sets of corresponding polynomials…

We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…

One of the celebrated formulas of Ramanujan is about odd zeta values, which has been studied by many mathematicians over the years. A notable extension was given by Grosswald in 1972. Following Ramanujan's idea, we rediscovered a…