'A dynamical systems approach to weighted graph matching'. Most authors choose one representation to be consistent with other notation they have introduced, so there is generally no need to supply a name. n-queens puzzle, a permutation matrix in which there is at most one entry in each diagonal and antidiagonal permutations and combinations, the various ways in which objects from a set may be selected, generally without replacement, to form subsets.

Costas array, a permutation matrix in which the displacement vectors between the entries are all distinct.

So, permutation matrices do indeed permute the order of elements in vectors multiplied with them. Each such matrix, say P, represents a permutation of m elements and, when used to multiply another matrix, say A, results in permuting the rows (when pre-multiplying, to form PA) or columns (when post-multiplying, to form AP) of the matrix A. In mathematics, particularly in matrix theory, a permutation matrix is a square binary matrix that has exactly one entry of 1 in each row and each column and 0s elsewhere. Permutation means the number of possibilities for choosing a given number of objects from the larger set. ( August 2022) ( Learn how and when to remove this template message) Please help to improve this article by introducing more precise citations. This article includes a list of general references, but it lacks sufficient corresponding inline citations.

Define permutation