Permutations as Product of Parallel Transpositions
It was conjectured that a permutation matrix with bandwidth b can be written as a product of no more than 2b−1 permutation matrices of bandwidth 1. In this note, two proofs are given to affirm the conjecture.
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Society for Industrial and Applied Mathematics
2012
|
| Online Access: | http://hdl.handle.net/1721.1/68631 https://orcid.org/0000-0001-7473-9287 |