Matrix relationships for partition functions

DOI10.1007/BF02366528MaRDI QIDQ1364072zbMATH OpenOpenAlexFDO

Authors V. V. Garbovskij

Publication date 5 January 1998

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02366528

zbMATH Keywords

computational complexitygenerating functionpartition functiontriangular Toeplitz matrices

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Hermitian, skew-Hermitian, and related matrices (15B57)

Review text

We propose a multiplicative decomposition of a vector whose elements are partition function values into upper triangular Toeplitz matrices. The resulting expression is a natural consequence of ideas that are traceable to H. Gupta. It is of interest for processing on parallel computing systems with complex data structures. We show the relationship of the decomposition with the generating function of \(p(n)\). The computational complexity of the expression is analyzed. We also consider the possibility of reducing computational complexity.

Recommendations

• Determinants of partition matrices
• Partition and composition matrices
• Matricial formulae for partitions
• Partition function for multi-cut matrix models
• Partitions in matrices and graphs
• scientific article; zbMATH DE number 854875
• The part-frequency matrices of a partition
• Matrix models for random partitions
• Vector partition functions and Kronecker coefficients
• Partition regularity of matrices

Cites work

• Partitions - a survey

Cited in

(3)

• A finite spectral representation of the partition function
• Factorization of partitions in two-dimensional lattices and complexity estimates
• A matrix partition problem

This page was built for publication: Matrix relationships for partition functions

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