Variational characterizations of the sign-real and the sign-complex spectral radius.
Voiculescu’s Entropy and Potential Theory
We give a new proof, relying on polynomial inequalities and some aspects of potential theory, of large deviation results for ensembles of random hermitian matrices.
Vorzeichenstabile Differenzenverfahren für parabolische Anfangsrandwertaufgaben.
V-кольца и их связь с группами автоморфизмов бинарных отношений
Weakly commutative Lie semigroups.
Weighted trace inequalities of monotonicity.
When does the inverse have the same sign pattern as the transpose?
By a sign pattern (matrix) we mean an array whose entries are from the set . The sign patterns for which every real matrix with sign pattern has the property that its inverse has sign pattern are characterized. Sign patterns for which some real matrix with sign pattern has that property are investigated. Some fundamental results as well as constructions concerning such sign pattern matrices are provided. The relation between these sign patterns and the sign patterns of orthogonal matrices...
When powers of a matrix coincide with its Hadamard powers
We characterize matrices whose powers coincide with their Hadamard powers.
Wiener-Hopf factorization for matrices
Wigner theorems for random matrices with dependent entries: ensembles associated to symmetric spaces and sample covariance matrices.
Wilks' factorization of the complex matrix variate Dirichlet distributions.
In this paper, it has been shown that the complex matrix variate Dirichlet type I density factors into the complex matrix variate beta type I densities. Similar result has also been derived for the complex matrix variate Dirichlet type II density. Also, by using certain matrix transformations, the complex matrix variate Dirichlet distributions have been generated from the complex matrix beta distributions. Further, several results on the product of complex Wishart and complex beta matrices with...
-pencils.
Zero minors of total positive matrices.
Zero-nonzero patterns for nilpotent matrices over finite fields.
Zero-one completely positive matrices and the A(R, S) classes
A matrix of the form A = BBT where B is nonnegative is called completely positive (CP). Berman and Xu (2005) investigated a subclass of CP-matrices, called f0, 1g-completely positive matrices. We introduce a related concept and show connections between the two notions. An important relation to the so-called cut cone is established. Some results are shown for f0, 1g-completely positive matrices with given graphs, and for {0,1}-completely positive matrices constructed from the classes of (0, 1)-matrices...
Zero-one matrices with an application to abelian groups
Zeros and local extreme points of Faber polynomials associated with hypocycloidal domains.
Zeros of unilateral quaternionic polynomials.
Zero-term rank preservers of integer matrices
The zero-term rank of a matrix is the minimum number of lines (row or columns) needed to cover all the zero entries of the given matrix. We characterize the linear operators that preserve the zero-term rank of the m × n integer matrices. That is, a linear operator T preserves the zero-term rank if and only if it has the form T(A)=P(A ∘ B)Q, where P, Q are permutation matrices and A ∘ B is the Schur product with B whose entries are all nonzero integers.
Асимптотические свойства оптимальных трaекторий дискретных моделей экономики и демографии