The linear independence of sets of two and three canonical algebraic curvature tensors.
The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case
The local relaxation flow approach to universality of the local statistics for random matrices
We present a generalization of the method of the local relaxation flow to establish the universality of local spectral statistics of a broad class of large random matrices. We show that the local distribution of the eigenvalues coincides with the local statistics of the corresponding Gaussian ensemble provided the distribution of the individual matrix element is smooth and the eigenvalues {xj}j=1N are close to their classical location {γj}j=1N determined by the limiting density of eigenvalues. Under...
The matrix equation and related problems.
The maximal and minimal ranks of with applications.
The maximum distance between two-dimensional Banach spaces.
The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, M1, was understood fully (froma combinatorial perspective) by C.R. Johnson, A. Leal-Duarte (Linear Algebra and Multilinear Algebra 46 (1999) 139-144). Among the possible multiplicity lists for the eigenvalues of Hermitian matrices whose graph is a tree, we focus upon M2, the maximum value of the sum of the two largest multiplicities when the largest multiplicity is M1. Upper and lower bounds are given for M2. Using a combinatorial...
The maximum number of odd submatrices in -matrices.
The Max-Plus Martin boundary.
The Merris index of a graph.
The method of moving frames applied to a space of bilinear forms
The Milnor ring of a local ring
The minimum, diagonal element of a positive matrix
Properties of the minimum diagonal element of a positive matrix are exploited to obtain new bounds on the eigenvalues thus exhibiting a spectral bias along the positive real axis familiar in Perron-Frobenius theory.
The minimum rank problem over finite fields.
The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω. In addition, we show that the spectral radius μ of PKm,ω (m ≥ 1) satisfies [...] More precisely, for m > 1, μ satisfies the equation [...] where [...] and [...] . At last the spectral radius μ(PK∞,ω) of the infinite graph PK∞,ω is also discussed.
The minimum-norm least-squares solution of a linear system and symmetric rank-one updates.
The Moore of the Moore-Penrose inverse.
The Moore-Penrose inverse of a free matrix.
The Moore-Penrose inverse of a partitioned matrix
The Moore-Penrose inverse of a partitioned morphism in an additive category