Matrizen mit maximaler Diagonale bei unitärer Similarität.
Maximal column rank preservers of fuzzy matrices
This paper concerns two notions of rank of fuzzy matrices: maximal column rank and column rank. We investigate the difference of them. We also characterize the linear operators which preserve the maximal column rank of fuzzy matrices. That is, a linear operator T preserves maximal column rank if and only if it has the form T(X) = UXV with some invertible fuzzy matrices U and V.
Maximal invariant neutral subspaces and an application to the algebraic Riccati equation.
Maximising the permanent of -matrices and the number of extensions of Latin rectangles.
Maximum exponent of Boolean circulant matrices with constant number of nonzero entries in their generating vector.
Means of positive matrices: geometry and a conjecture.
Meixner-type results for Riordan arrays and associated integer sequences.
Merging of states of Markov chains with infinite probability rates
Minimal rank.
Minimal projections onto spaces of symmetric matrices.
Minimum rank of edge subdivisions of graphs.
Moderate deviations for the spectral measure of certain random matrices
Moderate deviations for traces of words in a mult-matrix model.
Moderate deviations in a random graph and for the spectrum of Bernoulli random matrices.
Moments of characteristic polynomials enumerate two-rowed lexicographic arrays.
Monotone convergence of the Lanczos approximations to matrix functions of Hermitian matrices.
Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix
By a hollow symmetric matrix we mean a symmetric matrix with zero diagonal elements. The notion contains those of predistance matrix and Euclidean distance matrix as its special cases. By a centered symmetric matrix we mean a symmetric matrix with zero row (and hence column) sums. There is a one-toone correspondence between the classes of hollow symmetric matrices and centered symmetric matrices, and thus with any hollow symmetric matrix D we may associate a centered symmetric matrix B, and vice...
More on evaluating determinants
Multiple gcd-closed sets and determinants of matrices associated with arithmetic functions
Let f be an arithmetic function and S = {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of multiple coprime...
Multiplication of free random variables and the -transform: the case of vanishing mean.