Related papers: Efficient computation of the overpartition functio…

For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…

We establish an analog of the Hardy-Ramanujan inequality for counting members of sifted sets with a given number of distinct prime factors. In particular, we establish a bound for the number of shifted primes p+a below x with k distinct…

By applying the MC algorithm and the Bauer-Muir transformation for continued fractions, in this paper we shall give six examples to show how to establish an infinite set of continued fraction formulas for certain Ramanujan-type series, such…

In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pmod{n}$, with…

In [J. Phys. A: Math. Theor. 45 (2012)], while looking for spin chains that admit perfect state transfer, Vinet and Zhedanov found an apparently new sequence of orthogonal polynomials, that they called para-Krawtchouk polynomials, defined…

The celebrated Rogers-Ramanujan identities equate the number of integer partitions of $n$ ($n\in\mathbb N_0$) with parts congruent to $\pm 1 \pmod{5}$ (respectively $\pm 2 \pmod{5}$) and the number of partitions of $n$ with super-distinct…

Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up,…

The values of the partition function, and more generally the Fourier coefficients of many modular forms, are known to satisfy certain congruences. Results given by Ahlgren and Ono for the partition function and by Treneer for more general…

In this paper, we propose a numerical method of computing an integral whose integrand is a slowly decaying oscillatory function. In the proposed method, we consider a complex analytic function in the upper-half complex plane, which is…

This paper describes a practical methodology for computing the Hardy function Z(t), using just O(((t/epsilon)^(1/3))*(log(t))^(2+o(1)))) standard computational operations, to a tolerance of epsilon in the relative error. The methodology is…

Srinivasa Ramanujan provided series expansions of certain arithmetical functions in terms of the exponential sums defined by $c_r(n) = \sum\limits_{\substack{{m=1}\\ (m,r)=1}}^{r} e^{\frac{2 \pi imn}{r}}$ in [Trans. Cambridge Phillos. Soc,…

Consider the set $\{1,2,\ldots,3n\}$. We are interested in the number of partitions of this set into subsets of three elements each, where the sum of two of them equals the third. We give some criteria such a partition has to fulfill, which…

Let $B_{l,m}(n)$ denote the number of $(l,m)$-regular bipartitions of $n$. Recently, many authors proved several infinite families of congruences modulo $3$, $5$ and $11$ for $B_{l,m}(n)$. In this paper, using theta function identities to…

Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are…

Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…

Let $P$ be a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions $n\leq N$ to $n! = P(x)$ which yields a power saving over the trivial bound. In particular, this applies…

In 1954, Atkin and Swinnerton-Dyer proved Dyson's conjectures on the rank of a partition by establishing formulas for the generating functions for rank differences in arithmetic progressions. In this paper, we prove formulas for the…

The Riemann theta function is a complex-valued function of g complex variables. It appears in the construction of many (quasi-) periodic solutions of various equations of mathematical physics. In this paper, algorithms for its computation…

In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…

Ramanujan graphs have extremal spectral properties, which imply a remarkable combinatorial behavior. In this paper we compute the high dimensional Hodge-Laplace spectrum of Ramanujan triangle complexes, and show that it implies a…