Related papers: Fast Ramanujan--type Series for Logarithms. Part I…
The period estimation and periodic decomposition of a signal are the long-standing problems in the field of signal processing and biomolecular sequence analysis. To address such problems, we introduce the Ramanujan subspace pursuit (RSP)…
The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $\mathbb{F}\_{p^n}$, with $p$ medium to large and $n \geq 1$ small. This algorithm comprises four steps: polynomial…
Modern trends in data collection are bringing current mainstream techniques for database query processing to their limits. Consequently, various novel approaches for efficient query processing are being actively studied. One such approach…
For a fixed positive integer $e$, we describe an algorithm for computing, for all primes $p \leq X$, the mod-$p^e$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive over $\mathbb{Q}$ in time quasilinear in $X$.…
This paper is concerned with a class of partition functions $a(n)$ introduced by Radu and defined in terms of eta-quotients. By utilizing the transformation laws of Newman, Schoeneberg and Robins, and Radu's algorithms, we present an…
This work derives 5 methods to evaluate families of odd zeta values by combining a power of $\pi$ with Lambert series whose ratios of successive terms tend to $e^{-\pi\sqrt{a}}$ with integers $a\ge7$, outperforming Ramanujan's results with…
We study the high-order local discontinuous Galerkin (LDG) method for the $p$-Laplace equation. We reformulate our spatial discretization as an equivalent convex minimization problem and use a preconditioned gradient descent method as the…
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…
We prove that the logarithm of the permanent of an nxn real matrix A and the logarithm of the hafnian of a 2nx2n real symmetric matrix A can be approximated within an additive error 1 > epsilon > 0 by a polynomial p in the entries of A of…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…
In this paper we construct explicit LPS-type Ramanujan graphs from each definite quaternion algebra over $\mathbb Q$ of class number 1, extending the constructions of Lubotzky, Phillips, Sarnak, and later Chiu, and answering in the…
Inspired by a Zudilin-Zhao's supercongruences pattern related to Ramanujan-like series for $1/\pi^k$, we conjecture a kind of $p$-adic expansions.
In 1914 S. Ramanujan recorded a list of 17 series for $1/\pi$. We survey the methods of proofs of Ramanujan's formulae and indicate recently discovered generalizations, some of which are not yet proven.
Many of the fastest known algorithms to compute $\pi$ involve generalized hypergeometric series, such as the Ramanujan-Sato series. In this paper, we investigate the rates of convergence for several such series and we give asymptotic…
In this paper, two new series for the logarithm of the $\Gamma$-function are presented and studied. Their polygamma analogs are also obtained and discussed. These series involve the Stirling numbers of the first kind and have the property…
This work proposes a computational multiscale method for the mixed formulation of a second-order linear elliptic equation subject to a homogeneous Neumann boundary condition, based on a stable localized orthogonal decomposition (LOD) in…
Gaussian process (GP) surrogate modeling for large computer experiments is limited by cubic runtimes, especially with data from stochastic simulations with input-dependent noise. A popular workaround to reduce computational complexity…
Rational approximations of generalized hypergeometric functions ${}_pF_q$ of type $(n+k,k)$ are constructed by the Drummond and factorial Levin-type sequence transformations. We derive recurrence relations for these rational approximations…
Let $\overline{p}(n)$ denote the number of overpartitions of $n$. Recently, Fortin-Jacob-Mathieu and Hirschhorn-Sellers independently obtained 2-, 3- and 4-dissections of the generating function for $\overline{p}(n)$ and derived a number of…
Ramanujan listed several q-series identities in his lost notebook. The most well known q-series identities are the Rogers-Ramanujan type identities which are first discovered by Rogers and then rediscovered by Ramanujan. In this paper, we…