Related papers: Three types of the minimal excludant size of an ov…
A partition of a positive integer $n$ is a non-increasing sequence of positive integers which sum to $n$. A recently studied aspect of partitions is the minimal excludant of a partition, which is defined to be the smallest positive integer…
An overpartition is a partition such that the first occurrence (equivalently, the last occurrence) of a number may be overlined. In this article, we investigate three contents of overpartitions. We first consider the $r$-chain minimal and…
In the preceding decade, Andrews and Newman resurrected the concept of a `minimal excludant' of a partition ($mex$, for short), namely, the least positive missing integer in a partition. Subsequently, several authors have not only studied…
Define the minimal excludant of an overpartition $\pi$, denoted $ \overline{\text{mex}}(\pi)$, to be the smallest positive integer that is not a part of the non-overlined parts of $\pi$. For a positive integer $n$, the function…
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.
The average size of the "smallest gap" of a partition was studied by Grabner and Knopfmacher in 2006. Recently, Andrews and Newman, motivated by the work of Fraenkel and Peled, studied the concept of the "smallest gap" under the name…
Recently, Andrews considered the partitions with parts separated by parity, in which parts of a given parity are all smaller than those of the other parity. Inspired from the partitions with parts separated by parity, we investigate the…
Recently, Chen, He, Hu and Xie considered the parity of the number of non-overlined (resp. overlined) parts of size greater than or equal to the size of the smallest overlined (resp. non-overlined) part in an overpartition. In this article,…
The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…
For each nonempty integer partition $\pi$, we define the maximal excludant of $\pi$ to be the largest nonnegative integer smaller than the largest part of $\pi$ that is not a part of $\pi$. Let $\sigma\!\operatorname{maex}(n)$ be the sum of…
Inspired by Andrews' and Bachraoui's work on partitions with repeated smallest part, we extend the concept to overpartitions. We study overpartitions with the restriction that the smallest non-overlined part appears exactly $k$ times and…
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…
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…
The minimal excludant statistic, which denotes the smallest positive integer that is not a part of an integer partition, has received great interest in recent years. In this paper, we move on to the smallest positive integer whose frequency…
This article explores a new type of optimal covering of a complete graph by small cliques of different sizes, namely the minimum covering with minimum excess. In particular, the minimum size of a covering by triples and quadruples with…
For $n$ and $k$ integers we introduce the notion of some partition of $n$ being able to generate another partition of $n$. We solve the problem of finding the minimum size partition for which the set of partitions this partition can…
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…
For a given partition of (1, 2, ..., 2n) into two disjoint subsets A and B with n elements in each, consider the maximum number of times any integer occurs as the difference between an element of A and an element of B. The minimum value of…
In this paper, we focus on families of bipartitions, i.e. set partitions consisting of at most two components. We say that a family of bipartitions is a separating family for a set $S$ if every two elements in $S$ can be separated by some…
We extend recent results by G. E. Andrews and G. Simay on the $m$th largest and $m$th smallest parts of a partition to the more general context of skew plane partitions. In order to do this, we introduce new objects called skew plane…