Partial transpose of permutation matrices
From MaRDI portal
Publication:3629006
zbMATH Open1202.05005arXiv0709.3547MaRDI QIDQ3629006FDOQ3629006
Authors: Qing-Hu Hou, Toufik Mansour, Simone Severini
Publication date: 26 May 2009
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.
Full work available at URL: https://arxiv.org/abs/0709.3547
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (8)
- Inertia of partial transpose of positive semidefinite matrices
- Concurrence and three-tangle of the graph
- Entanglement and separability of graph Laplacian quantum states
- Florentine rows or left-right shifted permutation matrices with cross- correlation values \(\leq 1\)
- Title not available (Why is that?)
- Permutations matrix
- Title not available (Why is that?)
- 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)