Generalized Cubic Partitions

• Generalized cubic partitions are integer partitions in which even parts may appear in c colors while odd parts remain unrestricted.
• The generating series 1/(f₁ f₂^(c−1)) underpins their study and connects the framework to Ramanujan-type congruences and modular forms.
• Advanced congruence analyses reveal prime-modulus families and higher-power congruences, highlighting deep arithmetic parallels with classical partitions.

Generalized cubic partitions are partitions of an integer $n$ in which the even parts may appear in $c\ge 1$ different colors, while odd parts are unrestricted. Their counting function $a_c(n)$ is encoded by the generating series

$$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$

The family was introduced by Amdeberhan, Sellers, and Singh and places the ordinary partition function and the classical cubic partition function inside a single colored-even-parts framework; it has since become a setting for Ramanujan-type congruences, eta-quotient constructions, Hecke-operator arguments, and elementary $q$-series proofs (Amdeberhan et al., 2024, Amdeberhan et al., 2024).

1. Definition and basic formalism

A generalized cubic partition of weight $n$ is a partition of $n$ in which each even part may appear in $c\ge 1$ different colors. The corresponding counting function is $a_c(n)$, with $a_c(0):=1$, and its generating function is $c\ge 1$0 (Amdeberhan et al., 2024).

Two specializations are structurally decisive. First, $c\ge 1$1, so the ordinary partition function is the $c\ge 1$2 member of the family. Second, $c\ge 1$3 is the classical cubic partition function, so generalized cubic partitions recover Chan’s cubic partitions when the even parts have exactly two colors (Amdeberhan et al., 2024).

This parametrization packages a colored refinement of the even-part sector while leaving the odd-part sector unchanged. A plausible implication is that many congruence phenomena for $c\ge 1$4 are controlled not by arbitrary colorings, but by the interaction between the Euler factors at $c\ge 1$5 and $c\ge 1$6, which is exactly what the generating product records.

2. Relation to cubic partitions and classical partition theory

The classical cubic partition function has generating function

$c\ge 1$7

and admits a combinatorial interpretation as counting partition pairs $c\ge 1$8 such that $c\ge 1$9 and $a_c(n)$0 consists only of even parts (Mauth, 2023). In older notation this function also appears as $a_c(n)$1, with the same generating function $a_c(n)$2 (Chern et al., 2016).

Because $a_c(n)$3 and $a_c(n)$4 is cubic partitions, generalized cubic partitions form a direct extension of the standard partition-theoretic hierarchy. The classical background is Ramanujan’s congruences

$a_c(n)$5

together with Chan’s cubic congruence

$a_c(n)$6

and power-of-$a_c(n)$7 congruences for $a_c(n)$8 due to Chan–Toh (Amdeberhan et al., 2024).

This placement matters because the generalized family inherits both analytic and arithmetic features from its endpoints. The exact formula for cubic partitions, derived from the weakly holomorphic modular form $a_c(n)$9, shows that even the $$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$0 case already lives naturally inside modular-form theory (Mauth, 2023). Generalized cubic partitions retain the same eta-product flavor, but with a color parameter that changes the exponent of $$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$1.

3. Foundational congruence theory

The first broad congruence theorem for generalized cubic partitions is a prime-modulus family. For an odd prime $$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$2, one has

$$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$3

for all $$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$4, whenever $$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$5 and $$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$6 is a quadratic nonresidue modulo $$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$7 (Amdeberhan et al., 2024). This is the principal Ramanujan-type family in the early theory.

A stability result sharpens the same phenomenon: if

$$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$8

holds for all $$F_c(q):=\sum_{n\ge 0} a_c(n)q^n=\prod_{j\ge 1}\frac{1}{(1-q^j)(1-q^{2j})^{c-1}}=\frac{1}{f_1f_2^{\,c-1}}, \qquad f_k:=(q^k;q^k)_\infty.$$9, then for any $q$0,

$q$1

also holds for all $q$2 (Amdeberhan et al., 2024). Thus the existence of a congruence for the $q$3-colored case propagates to all $q$4-colored cases.

The same work establishes two isolated congruences proved by modular forms,

$q$5

and records an inheritance principle for the classical Ramanujan congruences: if $q$6 and $q$7 for $q$8, then

$q$9

for all $n$0 and $n$1 (Amdeberhan et al., 2024).

These results already exhibit the two recurrent themes of the subject: residue-class obstructions expressed through quadratic nonresidues, and robustness under arithmetic variation of the color parameter.

4. Proof architectures: functional equations, modular forms, and $n$2-series

The elementary proof of the prime-modulus family in the foundational work is built around a functional equation generalizing one due to Sellers: $n$3 After iteration and reduction modulo $n$4, the key remaining factor depends only on $n$5, so the coefficients of $n$6 are governed by $n$7. The condition that $n$8 be a quadratic nonresidue modulo $n$9 prevents the exponent $n$0 from occurring as a square in the required way, forcing the coefficient to vanish modulo $n$1 (Amdeberhan et al., 2024).

The modular-form proof of the isolated congruences uses eta-quotients, Hecke operators, and Sturm’s theorem. For $n$2, the form

$n$3

is shown to be a modular form of weight $n$4, level $n$5, with character $n$6; the Sturm bound is $n$7. For $n$8, the corresponding form is

$n$9

a modular form of weight $c\ge 1$0, level $c\ge 1$1, with character $c\ge 1$2, and the Sturm bound is $c\ge 1$3 (Amdeberhan et al., 2024).

A later note gave another proof of the same isolated congruences by classical $c\ge 1$4-series manipulations, replacing modular forms with Euler’s identity

$c\ge 1$5

and Ramanujan’s identity

$c\ge 1$6

The residue-class analysis reduces to quadratic nonresidue arguments modulo $c\ge 1$7 and $c\ge 1$8, again using that $c\ge 1$9 is a quadratic nonresidue for primes congruent to $a_c(n)$0 (Guadalupe, 2024).

Together these methods show that generalized cubic partition congruences are accessible from multiple directions: elementary functional equations, explicit theta identities, and modular-form technology all yield structurally comparable vanishing results.

5. Subsequent arithmetic developments

Later work enlarged the prime-modulus theory into further infinite families. For primes $a_c(n)$1, if $a_c(n)$2 and $a_c(n)$3, then

$a_c(n)$4

For primes $a_c(n)$5 with $a_c(n)$6, one also has

$a_c(n)$7

These families subsume the earlier congruences $a_c(n)$8 and $a_c(n)$9 as special cases (Guadalupe, 2024).

A distinct line of work established isolated higher-prime congruences via modular forms: $a_c(0):=1$0

$a_c(0):=1$1

$a_c(0):=1$2

$a_c(0):=1$3

together with the higher-power congruence

$a_c(0):=1$4

The proofs use eta-quotients, Hecke transforms, Sturm bounds, and, for the $a_c(0):=1$5-congruence, Radu’s algorithm (Das et al., 25 Mar 2025).

Another extension concerns the congruences modulo $a_c(0):=1$6 and $a_c(0):=1$7 obtained by Dockery. The short note on congruences modulo $a_c(0):=1$8 and $a_c(0):=1$9 generalized

$c\ge 1$00

to the infinite families

$c\ge 1$01

for all $c\ge 1$02 and $c\ge 1$03. The argument passes through the auxiliary series

$c\ge 1$04

Ahlgren’s theorem on coefficients of Euler products, Jacobi’s identity, and Chu’s theta identity (Guadalupe, 19 Aug 2025).

The strongest higher-power family currently listed in the provided material concerns $c\ge 1$05 modulo powers of $c\ge 1$06: $c\ge 1$07 Its proof uses modular functions on $c\ge 1$08, the Atkin $c\ge 1$09-operator, and the localization method of Banerjee and Smoot rather than the classical Watson–Atkin Hauptmodul approach (Dockery, 7 Aug 2025).

These developments indicate that the arithmetic of generalized cubic partitions is not confined to isolated congruences: it includes prime-modulus families, higher-prime isolated results, and prime-power towers.

6. Related generalizations and current outlook

Generalized cubic partitions were developed in parallel with generalized overcubic partitions. In one formulation, the generalized overcubic generating function is

$c\ge 1$10

and the associated theory includes congruence classifications modulo $c\ge 1$11 and $c\ge 1$12, infinite families modulo powers of $c\ge 1$13 and modulo $c\ge 1$14, and density-$c\ge 1$15 divisibility results modulo prime powers (Das et al., 25 Mar 2025). The foundational paper on generalized cubic partitions also closes by proving analogous results for generalized overcubic partitions (Amdeberhan et al., 2024).

This adjacency is mathematically significant because many proof mechanisms persist across the cubic and overcubic settings: theta-function functional equations, eta-quotients, Hecke operators, Radu-type algorithms, and coefficient-distribution results all reappear with modified products. A plausible implication is that generalized cubic partitions belong to a broader ecosystem of colored partition functions whose arithmetic is constrained by the modular structure of relatively simple Euler products.

At the same time, the subject is not presented as an unrestricted source of congruences. The introductory arXiv record states that the original paper concludes with a conjecture on the rarity of the relevant Ramanujan-type congruences (Amdeberhan et al., 2024). This suggests a guiding tension in the area: many explicit congruence families are now known, but the space of possible Ramanujan-type congruences may still be highly sparse and rigid.