For a given prime p, we study the properties of the p-dissection identities of Ramanujan's theta functions ψ(q) and f (−q), respectively. Then as applications, we find many infinite family of congruences modulo 2 for some ℓ-regular partition functions, especially, for ℓ = 2, 4,5,8,13,16. Moreover, based on the classical congruences for p(n) given by Ramanujan, we obtain many more congruences for some ℓ-regular partition functions.

No abstract

In view of the modular equation of fifth order, we give a simple proof of Keith's conjecture which is some infinite families of congruences modulo 3 for the 9-regular partition function. Meanwhile, we derive some new congruences modulo 3 for the 9-regular partition function.

No abstract

An overpartition of [Formula: see text] is a partition of [Formula: see text] in which the first occurrence of a number may be overlined. Then, the rank of an overpartition is defined as its largest part minus its number of parts. Let [Formula: see text] be the number of overpartitions of [Formula: see text] with rank congruent to [Formula: see text] modulo [Formula: see text]. In this paper, we study the rank differences of overpartitions [Formula: see text] for [Formula: see text] or [Formula: see text] and [Formula: see text]. Especially, we obtain some relations between the generating functions of the rank differences modulo 4 and 8 and some mock theta functions. Furthermore, we derive some equalities and inequalities on ranks of overpartitions modulo 4 and 8.

Partitions related to mock theta functions were widely studied in the literature. Recently, Andrews et al. introduced two new kinds of partitions counted by [Formula: see text] and [Formula: see text], whose generating functions are [Formula: see text] and [Formula: see text], where [Formula: see text] and [Formula: see text] are two third mock theta functions. Meanwhile, they obtained some congruences for [Formula: see text], [Formula: see text], and the associated smallest parts function [Formula: see text]. Furthermore, Andrews et al. discussed the overpartition analogues of [Formula: see text] and [Formula: see text] which are denoted by [Formula: see text] and [Formula: see text]. In this paper, we derive more congruences for [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text]. Moreover, we establish some congruences for [Formula: see text] and its associated smallest parts function [Formula: see text], where [Formula: see text] denotes the number of overpartitions of [Formula: see text] such that all even parts are at most twice the smallest part, and in which the smallest part is always overlined.

No abstract

A generalized Frobenius partition of [Formula: see text] with [Formula: see text] colors is a two-rowed array [Formula: see text] where [Formula: see text], and the integer entries are taken from [Formula: see text] distinct copies of the non-negative integers distinguished by color, and the rows are ordered first by size and then by color with no two consecutive like entries in any row. Let [Formula: see text] denote the number of this kind of partitions of [Formula: see text] with [Formula: see text] colors. In this paper, we establish some congruences modulo powers of 2 for [Formula: see text].