Signed counting of partition matrices
By: Shane Chern, Shishuo Fu
Potential Business Impact:
Counts special patterns in math problems.
We prove that the signed counting (with respect to the parity of the ``$\operatorname{inv}$'' statistic) of partition matrices equals the cardinality of a subclass of inversion sequences. In the course of establishing this result, we introduce an interesting class of partition matrices called improper partition matrices. We further show that a subset of improper partition matrices is equinumerous with the set of Motzkin paths. Such an equidistribution is established both analytically and bijectively.
Similar Papers
Matroids are Equitable
Combinatorics
Divides resources fairly among groups.
Bijections Between Smirnov Words and Hamiltonian Cycles in Complete Multipartite Graphs
Combinatorics
Counts ways to connect points in special graphs.
Convolutive sequences, I: Through the lens of integer partition functions
Combinatorics
Finds math patterns for counting things.