Related papers: Efficient computation of the overpartition functio…
We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with…
In this paper we present an effective method for computing certain real coefficients $\lambda_{n}$ which appear in a criterion for the Riemann hypothesis proved by Xian-Jin Li. With the use of this method a sequence of over three-thousand…
In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…
We prove a remarkable formula of Ramanujan for the logarithmic derivative of the gamma function, which converges more rapidly than classical expansions, and which is stated without proof in Ramanujan's notebooks. The formula has a number of…
The recent work by Marcus, Spielman and Srivastava proves the existence of bipartite Ramanujan (multi)graphs of all degrees and all sizes. However, that paper did not provide a polynomial time algorithm to actually compute such graphs.…
Recently, $4$-regular partitions into distinct parts are connected with a family of overpartitions. In this paper, we provide a uniform extension of two relations due to Andrews for the two types of partitions. Such an extension is made…
In this paper we present a probabilistic algorithm to compute the coefficients of modular forms of level one. Focus on the Ramanujan's tau function, we give out the explicit complexity of the algorithm. From a practical viewpoint, the…
In the present paper, we introduce a multiple Ramanujan sum for arithmetic functions, which gives a multivariable extension of the generalized Ramanujan sum studied by D. R. Anderson and T. M. Apostol. We then find fundamental arithmetic…
Ramanujan's celebrated congruences of the partition function $p(n)$ have inspired a vast amount of results on various partition functions. Kwong's work on periodicity of rational polynomial functions yields a general theorem used to…
In this paper, we establish a connection between Rogers-Ramanujan-Gordon type overpartitions to lattice paths with four kinds of unitary steps. By establishing the bijective relationship between overpartitions and lattice paths, we…
A cubic partition is an integer partition wherein the even parts can appear in two colors. In this paper, we introduce the notion of generalized cubic partitions and prove a number of new congruences akin to the classical Ramanujan-type. We…
We obtain an exact formula for the cubic partition function and prove a conjecture by Banerjee, Paule, Radu and Zeng.
Sang, Shi and Yee, in 2020, found overpartition analogs of Andrews' results involving parity in Rogers-Ramanujan-Gordon identities. Their result partially answered an open question of Andrews'. The open question was to involve parity in…
A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…
An extension of the method and results of A. Schwarz for evaluating the partition function of a quadratic functional is presented. This enables the partition functions to be evaluated for a wide class of quadratic functionals of interest in…
We set up a combinatorial framework for inclusion-exclusion on the partitions into distinct parts to obtain an alternative generating function of partitions into distinct and non-consecutive parts. In connection with Rogers-Ramanujan…
In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…
Ramanujan proved three famous congruences for the partition function modulo 5, 7, and 11. The first author and Boylan proved that these congruences are the only ones of this type. In 1984 Andrews introduced the $m$-colored Frobenius…
Recently, Andrews introduced separable integer partition classes and analyzed some well-known theorems. In this paper, we investigate partitions with parts separated by parity introduced by Andrews with the aid of separable integer…
Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.