Related papers: The fastest series for $1/\pi$ due to Ramanujan. P…
We derive, using a heuristic method, a $p$-adic mate of bilateral Ramanujan series. It has (among other consequences) the Zudiln's supercongruences for rational Ramanujan series.
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
We present new results and an algorithm for standard basis computations of a 0-dimensional ideal I in a power series ring or in the localization of a polynomial ring in finitely many variables over a field K. The algorithm provides a…
In this article we continue a previous work in which we have generalized the Rogers Ramanujan continued fraction (RR) introducing what we call, the Ramanujan-Quantities (RQ). We use the Mathematica package to give several modular equations…
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,…
A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…
The purpose of these notes is to provide the details of the Jacobian ring computations carried out in [1], based on the computer algebra system Magma [2].
Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…
We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be reduced to two computer…
We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…
In this work, we consider the properties of the two-term Machin-like formula and develop an algorithm for computing digits of $\pi$ by using its rational approximation. In this approximation, both terms are constructed by using a…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
A doubly infinite set of series expansion for $1/\pi$ are reported. They follow trivially from a formal expansion for the quotient of the values taken by the gamma function for two (complex) arguments differing by an integer plus one half,…
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its…
Using multiple Bernoulli series, we give a formula in the spirit of Euler MacLaurin formula. We also give a wall crossing formula and a decomposition formula. The study of these series is motivated by formulae of E.Witten for volumes of…
We develop the affine sieve in the context of orbits of congruence subgroups of semi-simple groups acting linearly on affine space. In particular we give effective bounds for the saturation numbers for points on such orbits at which the…
We survey the techniques used in our recent resolution of the Kadison-Singer problem and proof of existence of Ramanujan Graphs of every degree: mixed characteristic polynomials and the method of interlacing families of polynomials. To…
Two level 17 modular functions $$ r=q^{2}\prod_{n=1}^{\infty}(1-q^{n})^{\left(\frac{n}{17}\right)},\quad s=q^{2}\prod_{n=1}^{\infty}\frac{(1-q^{17n})^{3}}{(1-q^{n})^{3}}, $$ are used to construct a new class of Ramanujan-Sato series for…
By means of a variational approach we find new series representations both for well known mathematical constants, such as $\pi$ and the Catalan constant, and for mathematical functions, such as the Riemann zeta function. The series that we…