Partial transpose of permutation matrices
From MaRDI portal
Publication:3629006
Abstract: The partial transpose of a block matrix M is the matrix obtained by transposing the blocks of M independently. We approach the notion of partial transpose from a combinatorial point of view. In this perspective, we solve some basic enumeration problems concerning the partial transpose of permutation matrices. More specifically, we count the number of permutations matrices which are equal to their partial transpose and the number of permutation matrices whose partial transpose is still a permutation. We solve these problems also when restricted to symmetric permutation matrices only.
Recommendations
Cited in
(8)- Concurrence and three-tangle of the graph
- Inertia of partial transpose of positive semidefinite matrices
- Entanglement and separability of graph Laplacian quantum states
- Florentine rows or left-right shifted permutation matrices with cross- correlation values \(\leq 1\)
- scientific article; zbMATH DE number 125616 (Why is no real title available?)
- Permutations matrix
- scientific article; zbMATH DE number 5639918 (Why is no real title available?)
- Characterizations and applications of the isolated sets of permutations
This page was built for publication: Partial transpose of permutation matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629006)