Results 1  10
of
1,284
of a random permutation matrix
, 2000
"... random matrix theory, characteristic polynomial permutations, central limit theorem We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function for the eigenva ..."
Abstract
 Add to MetaCart
random matrix theory, characteristic polynomial permutations, central limit theorem We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function
The Characteristic Polynomial of a Random Permutation Matrix
, 2000
"... We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function for the eigenvalues lying in some interval on the unit circle. ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function for the eigenvalues lying in some interval on the unit circle.
The vecpermutation matrix, the vec operator and Kronecker products: a review
 Linear and Multilinear Algebra
, 1981
"... The veepermutation matrix I is defined by the equation _m,n vecAmX =I vecA', where vee is the vee operator such that vecA,.. n _m, n,.. is the vector of columns of A stacked one under the other. The variety of definitions, names and notations for I are discussed,,..m, n and its properties are ..."
Abstract

Cited by 55 (0 self)
 Add to MetaCart
The veepermutation matrix I is defined by the equation _m,n vecAmX =I vecA', where vee is the vee operator such that vecA,.. n _m, n,.. is the vector of columns of A stacked one under the other. The variety of definitions, names and notations for I are discussed,,..m, n and its properties
Secure Hill Cipher Modification Based on Generalized Permutation Matrix SHCGPM
, 2012
"... Abstract: Secure Hill cipher (SHC) modification based on dynamically changing generalized permutation matrix, SHCGPM is proposed. It provides better security than that of SHC due to the significantly larger number of nonrepeatedly generated keys ( 48 2 times greater for the parameters used in the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: Secure Hill cipher (SHC) modification based on dynamically changing generalized permutation matrix, SHCGPM is proposed. It provides better security than that of SHC due to the significantly larger number of nonrepeatedly generated keys ( 48 2 times greater for the parameters used
EXPRESSING A TENSOR PERMUTATION MATRIX p ⊗n IN TERMS OF THE GENER ALIZED GELLMANN MATRICES
, 2006
"... We have shown how to express a tensor permutation matrix p ⊗n as a linear combination of the tensor products of p × pGellMann matrices. We have given the expression of a tensor permutation matrix 2 ⊗ 2 ⊗ 2 as a linear combination of the tensor products of the Pauli matrices. ..."
Abstract
 Add to MetaCart
We have shown how to express a tensor permutation matrix p ⊗n as a linear combination of the tensor products of p × pGellMann matrices. We have given the expression of a tensor permutation matrix 2 ⊗ 2 ⊗ 2 as a linear combination of the tensor products of the Pauli matrices.
A new method for nonparametric multivariate analysis of variance in ecology.
 Austral Ecology,
, 2001
"... Abstract Hypothesistesting methods for multivariate data are needed to make rigorous probability statements about the effects of factors and their interactions in experiments. Analysis of variance is particularly powerful for the analysis of univariate data. The traditional multivariate analogues, ..."
Abstract

Cited by 368 (4 self)
 Add to MetaCart
symmetric distance or dissimilarity matrix. Pvalues are then obtained using permutations. Some examples of the method are given for tests involving several factors, including factorial and hierarchical (nested) designs and tests of interactions.
Excluded permutation matrices and the StanleyWilf conjecture
 J. Combin. Theory Ser. A
, 2004
"... This paper examines the extremal problem of how many 1entries an n × n 0–1 matrix can have that avoids a certain fixed submatrix P. For any permutation matrix P we prove a linear bound, settling a conjecture of Zoltán Füredi and Péter Hajnal [8]. Due to the work of Martin Klazar [12], this also set ..."
Abstract

Cited by 118 (4 self)
 Add to MetaCart
This paper examines the extremal problem of how many 1entries an n × n 0–1 matrix can have that avoids a certain fixed submatrix P. For any permutation matrix P we prove a linear bound, settling a conjecture of Zoltán Füredi and Péter Hajnal [8]. Due to the work of Martin Klazar [12], this also
Sparse Permutation Invariant Covariance Estimation
 Electronic Journal of Statistics
, 2008
"... The paper proposes a method for constructing a sparse estimator for the inverse covariance (concentration) matrix in highdimensional settings. The estimator uses a penalized normal likelihood approach and forces sparsity by using a lassotype penalty. We establish a rate of convergence in the Fro ..."
Abstract

Cited by 164 (8 self)
 Add to MetaCart
The paper proposes a method for constructing a sparse estimator for the inverse covariance (concentration) matrix in highdimensional settings. The estimator uses a penalized normal likelihood approach and forces sparsity by using a lassotype penalty. We establish a rate of con
Permutations as products of parallel transpositions
 SIAM J. DISCRETE MATH
, 2011
"... 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. ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
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.
Results 1  10
of
1,284