*Groups of Permutation Matrices

2021 ◽  
pp. 193-202
Author(s):  
Paul R. Rosenbaum
Keyword(s):  
Permutation Matrices

Construction of LDPC Codes Based on Circulant Permutation Matrices

2011 ◽  
Vol 30 (10) ◽  
pp. 2384-2387 ◽  
Author(s):  
Hua Qiao ◽  
Wu Guan ◽  
Ming-ke Dong ◽  
Hai-ge Xiang
Keyword(s):  
Ldpc Codes ◽  
Permutation Matrices

scholarly journals Permutation Matrices, Their Discrete Derivatives and Extremal Properties

2020 ◽  
Vol 48 (4) ◽  
pp. 719-740
Author(s):  
Richard A. Brualdi ◽  
Geir Dahl
Keyword(s):  
Permutation Matrix ◽  
Permutation Matrices ◽  
Discrete Derivative ◽  
The Relationship ◽  
Derivatives Of ◽  
Extremal Properties

AbstractFor a permutation π, and the corresponding permutation matrix, we introduce the notion of discrete derivative, obtained by taking differences of successive entries in π. We characterize the possible derivatives of permutations, and consider questions for permutations with certain properties satisfied by the derivative. For instance, we consider permutations with distinct derivatives, and the relationship to so-called Costas arrays.

scholarly journals FINDING TRANSFORMATION MATRIXS FOR A GIVEN MATRIX BY THE METHOD OF LINEAR ALGEBRA AND SOLVING THE PROBLEM WITH THE HELP OF MATHCAD

2019 ◽  
Author(s):  
М-Р. Б. Хадисов ◽  
А-В. А. Саидов
Keyword(s):  
Linear Algebra ◽  
Permutation Matrices

В статье рассмотрены вопросы нахождения перестановочных матриц для заданной матрицы методом линейной алгебры и решение задачи с помощью программы МATHCAD. The article considers the issues of finding permutation matrices for a given matrix by the method of linear algebra and solving the problem using the МATHCADs program.

scholarly journals Eigenvectors of Permutation Matrices

2015 ◽  
Vol 05 (07) ◽  
pp. 390-394 ◽  
Author(s):  
M. Isabel Garca-Planas ◽  
M. Dolors Magret
Keyword(s):  
Permutation Matrices

An Analogue of Birkhoff's Problem III for Infinite Markov Matrices1

1969 ◽  
Vol 12 (5) ◽  
pp. 625-633
Author(s):  
Choo-Whan Kim
Keyword(s):  
Convex Hull ◽  
Stochastic Matrices ◽  
Doubly Stochastic ◽  
Permutation Matrices ◽  
Doubly Stochastic Matrices

A celebrated theorem of Birkhoff ([1], [6]) states that the set of n × n doubly stochastic matrices is identical with the convex hull of the set of n × n permutation matrices. Birkhoff [2, p. 266] proposed the problem of extending his theorem to the set of infinite doubly stochastic matrices. This problem, which is often known as Birkhoffs Problem III, was solved by Isbell ([3], [4]), Rattray and Peck [7], Kendall [5] and Révész [8].

Linear Transformations On Matrices: The Invariance of Generalized Permutation Matrices, I

1976 ◽  
Vol 28 (3) ◽  
pp. 455-472 ◽  
Author(s):  
Hock Ong ◽  
E. P. Botta
Keyword(s):  
Vector Space ◽  
Unitary Group ◽  
Linear Transformations ◽  
Permutation Matrices ◽  
Linear Maps

Let F be a field, Mn(F) be the vector space of all w-square matrices with entries in F and a subset of Mn(F). It is of interest to determine the structure of linear maps T : Mn(F) →Mn(F) such that . For example: Let be GL(n, C), the group of all nonsingular n X n matrices over C [5]; the subset of all rank 1 matrices in MmXn(F) [4] (MmXn(F) is the vector space of all m X n matrices over F) ; the unitary group [2] ; or the set of all matrices X in Mn(F) such that det(X) = 0 [1]. Other results in this direction can be found in [3].

Sign in / Sign up

Export Citation Format

Share Document