Matricial formulae for partitions

DOI10.1007/S11853-011-0045-ZMaRDI QIDQ644499zbMATH OpenOpenAlexFDO

Authors Francesca Aicardi

Publication date 4 November 2011

Published in Functional Analysis and Other Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

arithmetic functionspartitionsrecurrences

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Recurrences (11B37) Elementary theory of partitions (11P81)

Abstract: The exponential of the triangular matrix whose entries in the diagonal at distance $n$ from the principal diagonal are all equal to the sum of the inverse of the divisors of $n$ is the triangular matrix whose entries in the diagonal at distance $n$ from the principal diagonal are all equal to the number of partitions of $n$. A similar result is true for any pair of sequences satisfying a special recurrence.

Recommendations

• The partition-frequency enumeration matrix
• Parafunctions of triangular matrices and m-ary partitions of numbers
• Generalization of universal partition and bipartition theorems
• A Generating Function for Triangular Partitions
• A matrix partition problem

Cited in

(5)

• A peculiar partition formula
• Matrix relationships for partition functions
• The partition-frequency enumeration matrix
• Parafunctions of triangular matrices and m-ary partitions of numbers
• A matrix partition problem

This page was built for publication: Matricial formulae for partitions

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