Related papers: Arithmetic properties of overpartitions

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

For any integer $\rho \geq 1$ and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d=3 and with covering radius $\rho$ is given. The intersection array…

We prove new double summation hypergeometric $q$-series representations for several families of partitions, including those that appear in the famous product identities of G\"ollnitz, Gordon, and Schur. We give several different proofs for…

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…

Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

We show that the Zagier-Eisenstein series shares its non-holomorphic part with certain weak Maass forms whose holomorphic parts are generating functions for overpartition rank differences. This has a number of consequences, including exact…

We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over…

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.

In 2017, Keith presented a comprehensive survey on integer partitions into parts that are simultaneously regular, distinct, and/or flat. Recently, the authors initiated a study of partitions into parts that are simultaneously regular and…

In the present work, we extend current research in a nearly-forgotten but newly revived topic, initiated by P. A. MacMahon, on a generalized notion which relates the divisor sums to the theory of integer partitions and two infinite families…

We show how to represent a class of expressions involving discrete sums over partitions as matrix models. We apply this technique to the partition functions of 2* theories, i.e. Seiberg-Witten theories with the massive hypermultiplet in the…

Recently, a beautiful paper of Andrews and Sellers has established linear congruences for the Fishburn numbers modulo an infinite set of primes. Since then, a number of authors have proven refined results, for example, extending all of…

We prove several Ramanujan-type congruences modulo powers of $5$ for partition $k$-tuples with $5$-cores, for $k=2, 3, 4$. We also prove some new infinite families of congruences modulo powers of primes for $k$-tuples with $p$-cores, where…

In 1918, Hardy and Ramanujan made a breakthrough by developing the circle method to deduce an asymptotic formula for the partition function $p(n)$, which was later refined by Rademacher in 1937 to produce an absolutely convergent series…

We study the combinatorics of two classes of basic hypergeometric series. We first show that these series are the generating functions for certain overpartition pairs defined by frequency conditions on the parts. We then show that when…

Let $\ell \geq 5$ be prime. For the partition function $p(n)$ and $5 \leq \ell \leq 31$, Atkin found a number of examples of primes $Q \geq 5$ such that there exist congruences of the form $p(\ell Q^{3} n+\beta) \equiv 0 \pmod{\ell}.$…

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…

George Andrews and Peter Paule have recently conjectured an infinite family of congruences modulo powers of 3 for the 2-elongated plane partition function $d_2(n)$. This congruence family appears difficult to prove by classical methods. We…