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.National Science Foundation (U.S.) (NSF grant DMS-0914670)National Science Foundation (U.S.) (NSF grant DMS-0852452
We describe the implications of permutation symmetry for the state space and dynamics of quantum mec...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractThe present article considers the problem for determining, for given two permutations over i...
Abstract. We consider the factorization of permutations into bandwidth 1 permutations, which are pro...
This paper presents asymptotically equal lower and upper bounds for the number of parallel I/O opera...
We want to draw the combintorialists attention to an important, but apparently little known paper by...
The problem of factoring a permutation as a product of special types of transpositions, namely, thos...
An efficient permutation algorithm is developed for a certain class of matrices; namely, those that ...
AbstractWe relate the number of cycles in a product of transpositions with a full cycle with the nul...
Let c(°) denote the number of cycles of a permutation ° of n letters, and let Tr(°)=n−c(°). A t-invo...
Abstract. The problem of factoring a permutation as a product of special types of transposi-tions, n...
We give asymptotically equal lower and upper bounds for the number of parallel I/O operations requir...
This thesis presents a novel algorithm for Transposing Rectangular matrices In-place and in Parallel...
AbstractKronecker products of unitary Fourier matrices play an important role in solving multilevel ...
A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an a...
We describe the implications of permutation symmetry for the state space and dynamics of quantum mec...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractThe present article considers the problem for determining, for given two permutations over i...
Abstract. We consider the factorization of permutations into bandwidth 1 permutations, which are pro...
This paper presents asymptotically equal lower and upper bounds for the number of parallel I/O opera...
We want to draw the combintorialists attention to an important, but apparently little known paper by...
The problem of factoring a permutation as a product of special types of transpositions, namely, thos...
An efficient permutation algorithm is developed for a certain class of matrices; namely, those that ...
AbstractWe relate the number of cycles in a product of transpositions with a full cycle with the nul...
Let c(°) denote the number of cycles of a permutation ° of n letters, and let Tr(°)=n−c(°). A t-invo...
Abstract. The problem of factoring a permutation as a product of special types of transposi-tions, n...
We give asymptotically equal lower and upper bounds for the number of parallel I/O operations requir...
This thesis presents a novel algorithm for Transposing Rectangular matrices In-place and in Parallel...
AbstractKronecker products of unitary Fourier matrices play an important role in solving multilevel ...
A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an a...
We describe the implications of permutation symmetry for the state space and dynamics of quantum mec...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractThe present article considers the problem for determining, for given two permutations over i...