Partial transpose of permutation matrices

Simple item page
dc.creatorHou, Qing-Hu
dc.creatorMansour, Toufik
dc.creatorSeverini, Simone
dc.date2007-09-21
dc.date2008-03-22
dc.date.accessioned2026-07-07T09:27:44Z
dc.date.available2026-07-07T09:27:44Z
dc.descriptionThe 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.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/0709.3547
dc.identifierhttp://arxiv.org/abs/0709.3547
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157209
dc.subjectCombinatorics
dc.subjectQuantum Physics
dc.titlePartial transpose of permutation matrices
dc.typetext

Files

Collections

arXiv