Related papers: Distinct parts partitions without sequences

Successive ranks of a partition, which were introduced by Atkin, are the difference of the $i$th row and the $i$th column in the Ferrers graph. Recently, in the study of singular overpartitions, Andrews revisited successive ranks and parity…

George Andrews [\emph{Bull. Amer. Math. Soc.}, 2007, 561--573] introduced the idea of a \emph{signed partiton} of an integer; similar to an ordinary integer partitions, but where some of the parts could be negative. Further, Andrews…

Let $B_{k,i}(n)$ be the number of partitions of $n$ with certain difference condition and let $A_{k,i}(n)$ be the number of partitions of $n$ with certain congruence condition. The Rogers-Ramanujan-Gordon theorem states that…

By work of Bringmann, Ono, and Rhoades it is known that the generating function of the $M_2$-rank of partitions without repeated odd parts is the so-called holomorphic part of a certain harmonic Maass form. Here we improve the standing of…

In a series of two papers, S. Capparelli, A. Meurman, A. Primc, M. Primc (CMPP) and then M. Primc put forth three remarkable sets of conjectures, stating that the generating functions of coloured integer partition in which the parts satisfy…

Many asymptotic formulas exist for unrestricted integer partitions as well as for distinct partitions of integers into a finite number of parts. Szekeres and Canfield have derived an asymptotic formula for the number of partitions that is…

Recently, Capparelli, Meurman, A. Primc and M. Primc introduced a class of colored partitions which has since been called CMPP partitions. This generalized earlier work by M. Primc and \v{S}iki\'{c}, and by Trup\v{c}evi\'{c}. One main…

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 give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…

Carlitz considered integer compositions in which adjacent parts must be unequal. Arndt recently initiated the study of restricted compositions based on conditions applied to certain pairs of parts rather than to individual parts. Here, we…

Holroyd, Liggett, and Romik introduced the following probability model. Let $C_1, C_2,...$ be independent events with probabilities $\P_s(C_n)= 1-e^{-ns}$ under a probability measure $\P_s$ with $0<s<1$. Let $A_k$ be the event that there is…

We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…

We derive continued fractions for partition generating functions, utilizing both Euler's techniques and Ramanujan's techniques. Although our results are for integer partitions there is scope to extend this work to vector partitions,…

In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…

We present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…

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

The Hardy-Ramanujan partition function asymptotics is a famous result in the asymptotics of combinatorial sequences. It was originally derived using complex analysis and number-theoretic ideas by Hardy and Ramanujan. It was later re-derived…

Arc spaces have been introduced in algebraic geometry as a tool to study singularities but they show strong connections with combinatorics as well. Exploiting these relations we obtain a new approach to the classical Rogers-Ramanujan…

In 2019, Andrews investigated integer partitions in which all parts of a given parity are smaller than those of the opposite parity and introduced eight partition functions based on the parity of the smaller parts and parts of a given…

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…