Related papers: Mex-related partitions and relations to ordinary p…
In a recent paper, Andrews and Newman extended the mex-function to integer partitions and proved many partition identities connected with these functions. In this paper, we present parity considerations of one of the families of functions…
The minimal excludant, or "mex" function, on a set $S$ of positive integers is the least positive integer not in $S$. In a recent paper, Andrews and Newman extended the mex-function to integer partitions and found numerous surprising…
In a recent pioneering work, Andrews and Newman defined an extended function $p_{A,a}(n)$ of their minimal excludant or "mex" of a partition function. By considering the special cases $p_{k,k}(n)$ and $p_{2k,k}(n)$, they unearthed…
Andrews and Newman introduced the mex-function $\text{mex}_{A,a}(\lambda)$ for an integer partition $\lambda$ of a positive integer $n$ as the smallest positive integer congruent to $a$ modulo $A$ that is not a part of $\lambda$. They then…
Inspired by Andrews' and Newman's work on the minimal excludant or "mex" of partitions, we define four new classes of minimal excludants for overpartitions and establish relations to certain functions due to Ramanujan.
Andrews and Newman introduced the minimal excludant or ``$mex$'' function for an integer partition $\pi$ of a positive integer $n$, $mex(\pi)$, as the smallest positive integer that is not a part of $\pi$. They defined $\sigma mex(n)$ to be…
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…
In this article, we refine a result of Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of partitions of $n$ into distinct parts with two colors. As a consequence, we find…
Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…
In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…
Let $p_{-t}(n)$ denote the number of partitions of $n$ into $t$ colors. In analogy with Ramanujan's work on the partition function, Lin recently proved in \cite{Lin} that $p_{-3}(11n+7)\equiv0\pmod{11}$ for every integer $n$. Such…
Amdeberhan et al. (2024) introduced the notion of a generalized overcubic partition function $\overline a_c (n)$ and proved an infinite family of congruences modulo a prime $p\ge 3$ and some Ramanujan type congruences. In this paper, we…
Euler's classical identity states that the number of partitions of an integer into odd parts and distinct parts are equinumerous. Franklin gave a generalization by considering partitions with exactly $j$ different multiples of $r$, for a…
We prove analytic and combinatorial identities reminiscent of Schur's classical partition theorem. Specifically, we show that certain families of overpartitions whose parts satisfy gap conditions are equinumerous with partitions whose parts…
The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…
The minimal excludant of an integer partition is the least positive integer missing from the partition. Let $\sigma_o\text{mex}(n)$ (resp., $\sigma_e\text{mex}(n)$) denote the sum of odd (resp., even) minimal excludants over all the…
For a given prime $p$, we study the properties of the $p$-dissection identities of Ramanujan's theta functions $\psi(q)$ and $f(-q)$, respectively. Then as applications, we find many infinite family of congruences modulo 2 for some…
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…
The crank-mex theorem states that the number of integer partitions of $n$ with nonnegative crank equals the number with odd minimal excludant (mex). Andrews and M. Newman recently refined that result in terms of the number of parts greater…
This paper is concerned with a class of partition functions $a(n)$ introduced by Radu and defined in terms of eta-quotients. By utilizing the transformation laws of Newman, Schoeneberg and Robins, and Radu's algorithms, we present an…