Related papers: On certain weighted 7-colored partitions
Motivated by a partition inequality of Bessenrodt and Ono, we obtain analogous inequalities for $k$-colored partition functions $p_{-k}(n)$ for all $k\geq2$. This enables us to extend the $k$-colored partition function multiplicatively to a…
We consider certain quotient algebras of tensor algebras of bimodules $M$ over a finite-dimensional algebra $R$, and we investigate Frobenius type properties of such algebras. Our main interest is in the case where $M=R^*$, the linear dual…
We prove seven of the Rogers-Ramanujan type identities modulo $12$ that were conjectured by Kanade and Russell. Included among these seven are the two original modulo $12$ identities, in which the products have asymmetric congruence…
Basis partitions are minimal partitions corresponding to successive rank vectors. We show combinatorially how basis partitions can be generated from primary partitions which are equivalent to the Rogers-Ramanujan partitions. This leads to…
Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…
Motivated by Alladi's recent multi-dimensional generalization of Sylvester's classical identity, we provide a simple combinatorial proof of an overpartition analogue, which contains extra parameters tracking the numbers of overlined parts…
Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…
We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…
Recently, Andrews, Hirschhorn and Sellers have proven congruences modulo 3 for four types of partitions using elementary series manipulations. In this paper, we generalize their congruences using arithmetic properties of certain quadratic…
We consider properties of overpartitions that are simultaneously {\ell}-regular and {\mu}-regular, where {\ell} and {\mu} are positive relatively prime integers. We prove a seven-way combinatorial identity related to these overpartitions.…
B. Szegedy [Edge coloring models and reflection positivity, {\sl Journal of the American Mathematical Society} {\bf 20} (2007) 969--988] showed that the number of homomorphisms into a weighted graph is equal to the partition function of a…
Numerical semigroups are cofinite additive submonoids of the natural numbers. In 2011, Keith and Nath illustrated an injection from numerical semigroups to integer partitions. We explore this connection between partitions and numerical…
In this short note, we prove several new congruences for the overcubic partition triples function, using both elementary techniques and the theory of modular forms. These extend the recent list of such congruences given by Nayaka,…
Dyson's rank function and the Andrews--Garvan crank function famously give combinatorial witnesses for Ramanujan's partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of…
Hirschhorn and Sellers studied arithmetic properties of the number of partitions with odd parts distinct. In another direction, Hammond and Lewis investigated arithmetic properties of the number of bipartitions. In this paper, we consider…
A generalization of a beautiful $q$-series identity found in the unorganized portion of Ramanujan's second and third notebooks is obtained. As a consequence, we derive a new three-parameter identity which is a rich source of…
We extend recent results of Ono and Raji, relating the number of self-conjugate $7$-core partitions to Hurwitz class numbers. Furthermore, we give a combinatorial explanation for the curious equality $2\operatorname{sc}_7(8n+1) =…
We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…
We study the divisibility properties of the partition function associated with the eighth order mock theta function $V_0(q)$, introduced by Gordon and McIntosh. We obtain congruences modulo powers of 2 for certain coefficients of the…
Extensions of a set partition obtained by imposing bounds on the size of the parts and the coloring of some of the elements are examined. Combinatorial properties and the generating functions of some counting sequences associated with these…