Table of Contents
Fetching ...

Congruences Relating Regular Partition Functions, a Genearalised Tau Function and Partition Function Weighted Composition Sums

S. Sriram, A. David Christopher

TL;DR

The paper studies the generalized tau-function $\tau_k(n)$ defined by $q\prod_{m=1}^{\infty}(1-q^m)^k=\sum_{n\ge1}\tau_k(n)q^n$ and connects it to $t$-regular partitions $R_t(n)$. It derives a binomial-coefficient partition sum representation for $\tau_k(n)$, enabling congruence relations with $R_t(n)$ and partition-weighted composition sums, and then develops parity and modular results across multiple primes and moduli via logarithmic differentiation, binomial identities, and Euler-type product expansions. The work provides explicit modulo results for $\tau_k(n)$ (and special cases like Ramanujan's $\tau(n)$) and recursive/structural relations for $R_9(n)$ and $R_p(n)$, culminating in a general theorem on weighted composition-sum divisibility that yields Ramanujan-type congruences as corollaries. Overall, it offers a cohesive framework linking regular partitions, generalized tau functions, and weighted partition sums with broad implications for arithmetic of partitions and modular forms. Key mechanisms include $q$-series manipulations, Euler's pentagonal theorem, Jacobi's triple product, and binomial-modulus techniques.

Abstract

Let $n$ and $t$ be positive integers with $t\geq 2$. Let $R_t(n)$ be the number of $t$-regular partitions of $n$. A class of functions, denoted $τ_k(n)$, is defined as follows: \[q\prod_{m=1}^{\infty}(1-q^m)^k=\sum_{n=1}^{\infty}τ_k(n)q^n, \] where $k$ is an integer. We express $τ_k(n)$ as a binomial coefficient weighted partition sum. Consequently, we obtain congruence identities that relate $τ_k(n)$, $R_t(n)$ and partition function weighted composition sums.

Congruences Relating Regular Partition Functions, a Genearalised Tau Function and Partition Function Weighted Composition Sums

TL;DR

The paper studies the generalized tau-function defined by and connects it to -regular partitions . It derives a binomial-coefficient partition sum representation for , enabling congruence relations with and partition-weighted composition sums, and then develops parity and modular results across multiple primes and moduli via logarithmic differentiation, binomial identities, and Euler-type product expansions. The work provides explicit modulo results for (and special cases like Ramanujan's ) and recursive/structural relations for and , culminating in a general theorem on weighted composition-sum divisibility that yields Ramanujan-type congruences as corollaries. Overall, it offers a cohesive framework linking regular partitions, generalized tau functions, and weighted partition sums with broad implications for arithmetic of partitions and modular forms. Key mechanisms include -series manipulations, Euler's pentagonal theorem, Jacobi's triple product, and binomial-modulus techniques.

Abstract

Let and be positive integers with . Let be the number of -regular partitions of . A class of functions, denoted , is defined as follows: where is an integer. We express as a binomial coefficient weighted partition sum. Consequently, we obtain congruence identities that relate , and partition function weighted composition sums.

Paper Structure

This paper contains 10 sections, 34 theorems, 164 equations.

Key Result

Proposition 2.1

Let $n$ be a positive integer, and let $k-1$ be a prime number. If $0\leq n-1-\frac{3r^2\pm r}{2}\not\equiv 0\pmod{(k-1)}$ for every non-negative integer $r$, then

Theorems & Definitions (74)

  • Definition 1.1
  • Proposition 2.1
  • proof
  • Remark 2.2
  • Proposition 2.3
  • Proposition 2.4
  • proof
  • Proposition 2.5
  • Definition 3.1
  • Definition 3.2
  • ...and 64 more