Related papers: Separable overpartition classes and excludant size…
Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…
The primary focus of this paper is overpartitions, a type of partition that plays a significant role in $q$-series theory. In 2006, Treneer discovered an explicit infinite family of congruences of overpartitions modulo $5$. In our research,…
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…
We define $\overline{R_l^*}(n)$ as the number of overpartitions of $n$ in which non-overlined parts are not divisible by $l$. In a recent work, Nath, Saikia, and the second author established several families of congruences for…
Very recently, Thejitha, Sellers, and Fathima defined the function $a_{r,s}(n)$, which enumerates the number of multicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors,…
We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we…
Separable codes were introduced to provide protection against illegal redistribution of copyrighted multimedia material. Let $\mathcal{C}$ be a code of length $n$ over an alphabet of $q$ letters. The descendant code ${\sf…
We study the generating function for overpartitions with bounded differences between largest and smallest parts, which is analogous to a result of Breuer and Kronholm on integer partitions. We also connect this problem with over…
A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements…
In this paper, we address several intersection problems for $r$-cross $t$-intersecting families of partitions. A $k$-partition of an $n$-set $X$ is a set of $k$ pairwise disjoint non-empty subsets whose union is $X$. For $1\leq i\leq r$,…
We introduce and study the notion of overcomplete set in a Banach space, that subsumes and extends the classical concept of overcomplete sequence in a (separable) Banach space. We give existence and non-existence results of overcomplete…
Recently, Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this paper, we provide a combinatorial proof of the generating function identity of…
This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
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…
If $a_1, a_2, ..., a_k$ and $n$ are positive integers such that $n = a_1 + a_2 + ... + a_k$, then the sum $a_1 + a_2 + ... + a_k$ is said to be a \emph{partition of $n$} of \emph{length $k$}, and $a_1, a_2, ..., a_k$ are said to be the…
In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved
A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each…
In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…