🔢 mathematics

Arithmetic Properties of Colored Partitions Restricted by Parity of the Parts

This paper investigates the arithmetic properties of the number of multicolored partitions of $n$ , where even and odd parts are assigned $r$ and $s$ colors respectively, by employing elementary generating function manipulations and classical $q$ -series techniques.

Original authors: M. P. Thejitha, James A. Sellers, S. N. Fathima

Published 2026-01-23

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: M. P. Thejitha, James A. Sellers, S. N. Fathima

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a giant pile of identical building blocks. Your job is to build towers using these blocks, but with a very specific set of rules. This is the world of partitions, a branch of mathematics where you figure out how many different ways you can add up numbers to reach a specific total.

This paper is like a master builder exploring a new, more colorful version of this game. Here is the story of what they discovered, explained simply.

The Game: Colored Blocks

In the standard version of the game, you just stack blocks to make a number (say, 5). You could do it as 5, or 4+1, or 3+2, or 2+2+1, and so on.

But in this paper, the authors introduce colors.

Imagine you have Even blocks (2, 4, 6...) and Odd blocks (1, 3, 5...).
They say: "What if every Even block comes in $r$ different colors (like red, blue, green...), and every Odd block comes in $s$ different colors?"

So, a "2" isn't just a "2" anymore; it could be a "Red 2" or a "Blue 2." The authors are trying to count exactly how many unique ways you can build a tower of a certain height when you have these colorful options. They call this number $a_{r,s}(n)$ .

The Mystery: Hidden Patterns (Congruences)

Mathematicians love finding patterns. Sometimes, when you count these colorful towers, you notice that for certain numbers, the answer is always divisible by a specific number (like 3, 5, or 7).

Think of it like this: If you try to build a tower of a specific height using these rules, you might find that the number of ways to do it is always a multiple of 3. It's like a magic trick where the universe forces the count to be divisible by 3, no matter how you try to arrange the blocks.

In math, this is called a congruence. The paper is a treasure hunt for these hidden "divisibility rules."

What They Did: The Detective Work

The authors, Thejitha, Sellers, and Fathima, used a set of mathematical tools (like special formulas and "generating functions," which are just fancy recipes for counting) to solve this puzzle.

They didn't just look at one specific case; they generalized the game. They asked: "If we change the number of colors for even and odd blocks, do these magic divisibility rules still happen?"

The Big Discoveries

The paper is packed with new "magic rules" they found. Here are the main takeaways, translated into plain English:

The "Mod 3" Magic: They found that if you set up the colors in certain specific combinations (like having 3 colors for evens and 6 for odds, or 27 for evens and 4 for odds), the number of ways to build a tower will always be divisible by 3 if the tower height follows a certain pattern (like being 1 more than a multiple of 3, or 2 more than a multiple of 3).
- Analogy: It's like saying, "If you try to build a tower that is 10 blocks high with these specific colored rules, you will never find a number of ways that isn't a multiple of 3. It's impossible to get a remainder."
The "Prime" Magic: They extended this to other numbers, specifically prime numbers (numbers like 5, 7, 11 that can't be divided by anything else). They discovered that if you pick a prime number and set the colors just right, the number of ways to build the tower will be divisible by that prime number, provided the tower height fits a specific "key" (a mathematical condition involving quadratic non-residues, which is just a fancy way of saying "a number that doesn't fit a square pattern").
Connecting the Dots: They also proved that some of these complex, high-color scenarios behave exactly like simpler, low-color scenarios.
- Analogy: It's like discovering that a complicated machine with 27 gears behaves exactly the same way as a simple machine with 3 gears, as long as you look at them at the right time intervals.

Why It Matters (According to the Paper)

The paper doesn't claim this will help build bridges or cure diseases. Instead, its goal is purely mathematical exploration.

Extending the Definition: They took a known concept (partitions with colors) and made it more flexible (different colors for even vs. odd numbers).
Proving the Rules: They used elementary math tricks (not just heavy computer power) to prove that these divisibility patterns exist for a huge family of these colorful partition problems.
Solving Old Puzzles: They provided new, simpler proofs for some patterns that other mathematicians had found before but were harder to understand.

The Bottom Line

Think of this paper as a catalog of mathematical coincidences. The authors found that when you mix and match colors for even and odd numbers in a partition game, the universe seems to have a strict rulebook: "If you choose these specific colors, the total count of ways to build your tower will always be a multiple of 3 (or 5, or 7)."

They didn't just find one rule; they found a whole library of rules that apply to infinite variations of the game, showing that deep, hidden order exists even in the chaotic-looking world of adding numbers together.

Technical Summary: Arithmetic Properties of Colored Partitions Restricted by Parity of the Parts

Problem Statement
This paper investigates the arithmetic properties, specifically congruences, of a generalized class of integer partitions known as multicolored partitions restricted by parity. Let $a_{r,s}(n)$ denote the number of partitions of an integer $n$ where even parts may appear in one of $r$ colors and odd parts may appear in one of $s$ colors, for fixed integers $r, s \ge 1$ . The generating function for this sequence is given by:
$\sum_{n=0}^{\infty} a_{r,s}(n)q^n = \frac{f_2^{s-r}}{f_1^s}$
where $f_m = (q^m; q^m)_\infty$ . This definition generalizes several previously studied partition functions, including $k$ -colored partitions ( $p_k(n)$ ), partitions with monochromatic even parts and $s$ -colored odd parts ( $a_s(n)$ ), and partitions with $r$ -colored even parts and monochromatic odd parts ( $a^*_r(n)$ ). The primary objective is to establish infinite families of congruences for $a_{r,s}(n)$ modulo primes, extending known results for specific cases of $r$ and $s$ .

Methodology
The authors employ elementary generating function manipulations and classical $q$ -series techniques, avoiding the use of modular forms which were utilized in previous related works. The core methodology involves:

Generating Function Analysis: Utilizing the definition of $a_{r,s}(n)$ to express the generating function in terms of Ramanujan's theta functions ( $\phi(q)$ , $\psi(q)$ ) and standard $q$ -products ( $f_m$ ).
Dissection Techniques: Applying known 3-dissections and 2-dissections of theta functions (e.g., identities for $f_1, f_2, f_3, f_6$ ) to isolate terms with specific exponents modulo a prime $p$ .
Congruence Reductions: Using the Binomial Theorem to establish congruences of the form $f_m^{p^k} \equiv f_{mp}^{p^{k-1}} \pmod{p^k}$ , which allows for the reduction of generating functions modulo primes.
Inductive Propagation: A key tool is Lemma 2.6, which allows the authors to extend congruences from a base case (e.g., $a_{r,s}(pn+r) \equiv 0 \pmod p$ ) to infinite families of the form $a_{p(k-j)+(r-1), p^k+(s-1)}(p^k n + r) \equiv 0 \pmod p$ . This lemma relies on the observation that if a generating function $A(n)$ satisfies a congruence for indices $pn+C$, then a related function $B(n)$ constructed by raising the $q$ -products to powers of $p$ also satisfies the congruence.

Key Contributions and Results
The paper provides elementary proofs for previously known congruences and establishes numerous new infinite families of congruences.

Re-proof of Existing Results: In Section 3, the authors provide alternate, elementary proofs for congruences modulo 3 and 5 previously established by Sellers and others (Theorems 1.2 and 1.3), specifically for the case $a_{1,5}(n)$ .
Modulo 3 Congruences: Sections 4 establishes several families of congruences modulo 3 for various combinations of $r$ $r$ and $s$ $s$ . Notable results include:
- $a_{3(k-j)+3, 3k+6}(3n+1) \equiv a_{3(k-j)+3, 3k+6}(3n+2) \equiv 0 \pmod 3$ .
- $a_{27(k-j)+2, 27k+4}(27n+9) \equiv a_{27(k-j)+2, 27k+4}(27n+18) \equiv 0 \pmod 3$ .
- A recurrence relation: $a_{2,4}(27n) \equiv a_{2,4}(3n) \pmod 3$ .
- Congruences for $a_{9(k-j)+4, 9k+2}$ and $a_{3(k-j)+5, 3k+1}$ at specific arithmetic progressions.
Modulo $p$ Congruences: Section 5 generalizes these findings to arbitrary primes $p \ge 5$ $p \geq 5$ (and $p \ge 3$ $p \geq 3$ in one case). Theorems 1.12 through 1.18 establish congruences of the form $a_{r', s'}(pn+r) \equiv 0 \pmod p$ $a_{r^{'}, s^{'}} (p n + r) \equiv 0 (mod p)$ based on quadratic residue conditions.
- The conditions for these congruences depend on whether specific linear expressions in $r$ (e.g., $8r+1$ , $4r+1$ , $3r+1$ , $12r+1$ ) are quadratic non-residues modulo $p$ or satisfy specific divisibility conditions (e.g., $p \mid 3r+1$ ).
- These results utilize the dissection properties of Ramanujan's theta functions to show that the generating functions for these specific parameters contain no terms with exponents congruent to $r \pmod p$ .

Significance
The paper claims to significantly extend the definition of colored partitions by introducing a unified framework ( $a_{r,s}(n)$ ) that encompasses various previously studied partition functions. Its primary significance lies in providing elementary proofs for congruences that were previously established using the more advanced theory of modular forms. By relying solely on generating function manipulations and $q$ -series identities, the authors make these arithmetic properties more accessible. Furthermore, the paper unifies and generalizes these results into infinite families parameterized by $k$ and $j$ , demonstrating a broad structural regularity in the arithmetic behavior of these parity-restricted colored partitions. The work contributes to the broader study of partition congruences by expanding the known landscape of such properties to a wider class of generating functions.