The partition-frequency enumeration matrix (Q2168693): Difference between revisions

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}}\)).