The partition-frequency enumeration matrix

DOI10.1007/S11139-022-00573-5MaRDI QIDQ2168693zbMATH OpenOpenAlexFDO

Authors Hartosh Singh Bal, Gaurav Bhatnagar

Publication date 26 August 2022

Published in The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2102.04191

divisor functions integer partitions recurrence relations sums of squares sums of triangular numbers zeta function at even integers

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Arithmetic functions; related numbers; inversion formulas (11A25) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

Abstract: We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix unifies a large number of results connecting number-theoretic functions to partition-type functions. The calculus is extended to arbitrary generating functions, and functions with Weierstrass products. As a by-product, we recover (and extend) some well-known recurrence relations for many number-theoretic functions, including the sum of divisors function, Ramanujan's

a u

function, sums of squares and triangular numbers, and for

z e t a (2 n)

, where

n

is a positive integer. These include classical results due to Euler, Ewell, Ramanujan, Lehmer and others. As one application, we embed Ramanujan's famous congruences

p (5 n + 4) e q u i v 0

(mod

5)

and

a u (5 n + 5) e q u i v 0

(mod

5)

into an infinite family of such congruences.

Review text

Let \(A\) be an infinite matrix and \(A_{n}\) be the \(n\times n\) sub-matrix consisting of the entries from the first \(n\) rows and columns of \(A\). Using only elementary arguments the authors prove that if \(m_{n}\) is the number of non-zero rows of \(A_{n}\), \((U_{k})_{k\in\mathbb{N}}\) and \((V_{k})_{k\in\mathbb{N}}\) are some sequences of complex numbers with \(V_{k}\neq 0\) for all \(k\), then provided that \(P(0)\) is fixed, one can uniquely determine the sequences \((P(n))_{n\in\mathbb{N}}\) and \((F_{i}(n))_{i\in\{1,\ldots, m_{n}\}}\) satisfying the equations \[ A_{n}[P(n-1),\ldots, P(0)]^{T}=[F_{1}(n),\ldots, F_{m_{n}}(n)]^{T},\quad \sum_{k=1}^{m_{n}}U_{k}F_{k}(n)=V_{n}P(n). \] This simple result allows to find connections between sequences counting various type of integer partitions and arithmetical functions (using an appropriate matrix \(A\) and sequences \((U_{n})_{n\in\mathbb{N}}, (V_{n})_{n\in\mathbb{N}}\)).

Recommendations

Cites work

Cited in

(8)

This page was built for publication: The partition-frequency enumeration matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168693)