Related papers: The fastest series for $1/\pi$ due to Ramanujan. P…
We prove three supercongruences for sums of Almkvist-Zudilin numbers, which confirm some conjectures of Zudilin and Z.-H. Sun. A typical example is the Ramanujan-type supercongruence: \begin{align*} \sum_{k=0}^{p-1}…
We determine conditions for the existence and non-existence of Ramanujan-type congruences for Jacobi forms. We extend these results to Siegel modular forms of degree 2 and as an application, we establish Ramanujan-type congruences for…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
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…
We study in detail the Ramanujan smooth expansions, for arithmetic functions; we start with the most general ones, for which we supply the "$P-$local expansions", for arguments with all prime-factors $p\le P$ (namely, $P-$smooth arguments),…
In this paper we first prove an isomorphism between certain spaces of Jacobi forms. Using this isomorphism, we study the mod $p$ theory of Hermitian Jacobi forms over $\mathbb{Q}(i)$. We then apply the mod $p$ theory of Hermitian Jacobi…
In this paper we briefly discuss \Rings --- an efficient lightweight library for commutative algebra. Polynomial arithmetic, GCDs, polynomial factorization and Gr\"obner bases are implemented with the use of modern asymptotically fast…
Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs…
This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…
Assuming the Generalized Riemann Hypothesis, we prove the following: If b is an integer greater than one, then the multiplicative order of b modulo N is larger than N^(1-\epsilon) for all N in a density one subset of the integers. If A is a…
In order to find the outcome probabilities of quantum mechanical systems like the optical networks underlying Boson sampling, it is necessary to be able to compute the permanents of unitary matrices, a computationally hard task. Here we…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
Computations over the rational numbers often encounter the problem of intermediate coefficient growth. A solution to this is provided by modular methods, which apply the algorithm under consideration modulo a number of primes and then lift…
In this we paper we prove several new identities of the Rogers-Ramanujan-Slater type. These identities were found as the result of computer searches. The proofs involve a variety of techniques, including series-series identities, Bailey…
In this paper we establish an explicit upper bound for the first $k$-Ramanujan prime $R_1^{(k)}$ by using a recent result concerning the existence of prime numbers in small intervals.
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…
We study the quotient of hypergeometric functions \begin{equation*} \mu_{a}^*(r)=\frac{\pi}{2\sin{(\pi a)}}\frac{F(a,1-a;1;1-r^3)}{F(a,1-a;1;r^3)} \quad (r\in(0,1)) \end{equation*} in the theory of Ramanujan's generalized modular equation…
The main goal of the paper is to introduce methods which compute B\'ezier curves faster than Casteljau's method does. These methods are based on the spectral factorization of a $n\times n$ Bernstein matrix, $B^e_n(s)= P_nG_n(s)P_n^{-1}$,…
Let p be prime and Zpn the degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast algorithms for common operations in Zpn modulo p^N. Combining existing methods with recent work…
We show how to improve the efficiency of the computation of fast Fourier transforms over F_p where p is a word-sized prime. Our main technique is optimisation of the basic arithmetic, in effect decreasing the total number of reductions…