Factorization of banded permutations
Combinatorics
2012-01-17 v2 Group Theory
Numerical Analysis
Abstract
We consider the factorization of permutations into bandwidth 1 permutations, which are products of mutually nonadjacent simple transpositions. We exhibit an upper bound on the minimal number of such factors and thus prove a conjecture of Gilbert Strang: a banded permutation of bandwidth can be represented as the product of at most permutations of bandwidth 1. An analogous result holds also for infinite and cyclically banded permutations.
Cite
@article{arxiv.1007.1760,
title = {Factorization of banded permutations},
author = {Greta Panova},
journal= {arXiv preprint arXiv:1007.1760},
year = {2012}
}
Comments
To appear in Proceedings of the AMS