AbstractA characterization is given of those n×n real matrices A which satisfy En−1(PA) = En−1(A) for all n×n permutation matrices P
AbstractThis paper contains extreme value results for concave and convex symmetric functions of the ...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractWe present a simple way to derive the results of Diaconis and Fulman [P. Diaconis, J. Fulman...
Let Sn denote the set of n x n permutation matrices; let T denote the set of transpositions in Sn; ...
AbstractIt is shown that if a linear transformation T on the space of n-square symmetric matrices ov...
AbstractA characterization is given of those n×n real matrices A which satisfy En−1(PA) = En−1(A) fo...
AbstractIt is shown that if a nonsingular linear transformation T on the space of n-square real symm...
AbstractThe paper describes extrema of elementary symmetric polynomials of mth order of the eigenval...
AbstractA characterization of a class of symmetric (0, 1) matrices A such that AP is a symmetric mat...
We study the formula complexity of the word problem $\mathsf{Word}_{S_n,k} : \{0,1\}^{kn^2} \to \{0,...
AbstractA (0, 1) matrix (aij) is said to be a ∗ matrix iff aij = 1 implies ai′j′ = 1 for all (i′, j′...
AbstractWe have long suspected the existence of two theorems about the decomposition matrices of the...
AbstractLet F be an arbitrary subfield of the complex numbers, and let Hn(F) be the space of the n ×...
AbstractAfter showing (see Theorem 2.8) how commuting squares lead, in the presence of a certain add...
Abstract3or any N × N symmetric real matrix W, the subspaces of RN which are invariant under πTWπ fo...
AbstractThis paper contains extreme value results for concave and convex symmetric functions of the ...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractWe present a simple way to derive the results of Diaconis and Fulman [P. Diaconis, J. Fulman...
Let Sn denote the set of n x n permutation matrices; let T denote the set of transpositions in Sn; ...
AbstractIt is shown that if a linear transformation T on the space of n-square symmetric matrices ov...
AbstractA characterization is given of those n×n real matrices A which satisfy En−1(PA) = En−1(A) fo...
AbstractIt is shown that if a nonsingular linear transformation T on the space of n-square real symm...
AbstractThe paper describes extrema of elementary symmetric polynomials of mth order of the eigenval...
AbstractA characterization of a class of symmetric (0, 1) matrices A such that AP is a symmetric mat...
We study the formula complexity of the word problem $\mathsf{Word}_{S_n,k} : \{0,1\}^{kn^2} \to \{0,...
AbstractA (0, 1) matrix (aij) is said to be a ∗ matrix iff aij = 1 implies ai′j′ = 1 for all (i′, j′...
AbstractWe have long suspected the existence of two theorems about the decomposition matrices of the...
AbstractLet F be an arbitrary subfield of the complex numbers, and let Hn(F) be the space of the n ×...
AbstractAfter showing (see Theorem 2.8) how commuting squares lead, in the presence of a certain add...
Abstract3or any N × N symmetric real matrix W, the subspaces of RN which are invariant under πTWπ fo...
AbstractThis paper contains extreme value results for concave and convex symmetric functions of the ...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractWe present a simple way to derive the results of Diaconis and Fulman [P. Diaconis, J. Fulman...
DOI
Add to ORKG