Determinants of partition matrices
Given two partitions, \(\mu\) and \(\lambda\), of the integer \(n\), the number of refinements of \(\mu\) into \(\lambda\) is defined to be the number of ways of taking a set partition with cardinalities given by \(\mu\) and refining it into a set partition with cardinalities given by \(\lambda\). Given a partition \(\lambda\) of \(n\), we define \(\lambda+ 1^n\) to be the partition of \(2n\) obtained by adding parts of size 0 as necessary so that there are exactly \(n\) parts, and then adding 1 to each part. We define \(\lambda\cup 1^n\) to be the partition of \(2n\) which has all of the parts in \(\lambda\) plus additional \(n\) parts of size 1. Finally, given \(n\), we let \(\lambda_1,\dots, \lambda_{p(n)}\) be the partitions of \(n\) listed in reverse lexicographic order, and we define \(M_n\) to be the \(p(n)\times p(n)\) matrix for which the entry in row \(i\), column \(j\) is the number of refinements of \(\lambda_j+ 1^n\) into \(\lambda_i\cup 1^n\). The author proves that for all positive integers \(n\), the determinant of \(M_n\) is 1.
- Matrix relationships for partition functions
- Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
- scientific article; zbMATH DE number 6683578 (Why is no real title available?)
- Determinants of Matrices on Partially Ordered Sets
- Concerning partition regular matrices
- Positivity of the determinants of the partition function and the overpartition function
This page was built for publication: Determinants of partition matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1912271)
