A min-max theorem for complex symmetric matrices

We optimize the form Re x^tTx to obtain the singular values of a complex symmetric matrix T. We prove that for ,

     

Interior estimates for solutions of a fourth order nonlinear partial differential equation

Let be a locally strongly convex hypersurface, given by the graph of a convex function xn+1=f(x₁,…,xn) defined in a convex domain Ω⊂Rn. M is called a α-extremal hypersurface, if f is a solution of

     

Preservers of spectral radius, numerical radius, or spectral norm of the sum on nonnegative matrices

Let be the set of entrywise nonnegative n×n matrices. Denote by r(A) the spectral radius (Perron root) of . Characterization is obtained for maps such that r(f(A)+f(B))=r(A+B) for all . In particular, it is shown that such a map has the form

     

Classification of sesquilinear forms with the first argument on a subspace or a factor space

Let V be a vector space over a field or skew field F, and let U be its subspace. We study the canonical form problem for bilinear or sesquilinear forms

     

Large matchings from eigenvalues

We find lower bounds on the difference between the spectral radius λ₁ and the average degree of an irregular graph G of order n and size e. In particular, we show that, if n ? 4, then

     

On eigenvalues of meet and join matrices associated with incidence functions

Let (P,?,∧) be a locally finite meet semilattice. Let

     

Walks and the spectral radius of graphs

Given a graph G, write μ(G) for the largest eigenvalue of its adjacency matrix, ω(G) for its clique number, and w_k(G) for the number of its k-walks. We prove that the inequalities

     

Identities for sums of characteristic values of entire matrix pencils

The paper deals with an entire matrix-valued function of a complex argument (an entire matrix pencil) f of order ρ(f)<∞. Identities for the following sums of the characteristic values of f are established:

     

Characterization of graphs having extremal Randi? indices

The higher Randi? index R_t(G) of a simple graph G is defined as

     

On the max version of the generalized spectral radius theorem

Let Ψ be a bounded set of n×n non-negative matrices. Recently, the max algebra version μ(Ψ) of the generalized spectral radius of Ψ was introduced. We show that

     

Numerical ranges of weighted shift matrices with periodic weights

Let A be an n-by-n (n?2) matrix of the form

     

A norm compression inequality for block partitioned positive semidefinite matrices

Let A be a positive semidefinite matrix, block partitioned as

     

Stable solutions of linear systems involving long chain of matrix multiplications

This paper is concerned with solving linear system (I_n+B_L?B₂B₁)x=b arising from the Green’s function calculation in the quantum Monte Carlo simulation of interacting electrons. The order of the system and integer L are adjustable. Also adjustable is the conditioning of the coefficient matrix to give rise an extreme ill-conditioned system. Two numerical methods based on the QR decomposition with column pivoting and the singular value decomposition, respectively, are studied in this paper. It is proved that the computed solution by each of the methods is weakly backward stable in the sense that the computed is close to the exact solution of a nearby linear system

     

Reduction of the c-numerical range to the classical numerical range

Let A be an n×n complex matrix and c=(c₁,c₂,…,c_n) a real n-tuple. The c-numerical range of A is defined as the set

     

Accretive operators and Cassels inequality

Let a,b>0 and let Z∈M_n(R) such that Z lies into the operator ball of diameter [aI,bI]. Then for all positive definite A∈M_n(R),

     

On the continuity of the generalized spectral radius in max algebra

Given a bounded set Ψ of n×n non-negative matrices, let ρ(Ψ) and μ(Ψ) denote the generalized spectral radius of Ψ and its max version, respectively. We show that

     

Commutators with maximal Frobenius norm

It is known that for any nonzero complex n×n matrices X and Y the quotient of Frobenius norms

     

Numerical ranges of weighted shift matrices

We show that if A is an n-by-n (n?3) matrix of the form

     

On the number of representations of certain integers as sums of 11 or 13 squares

Let r_k(n) denote the number of representations of an integer n as a sum of k squares. We prove that for odd primes p,

     

Orthogonality of matrices

Let X be a real finite-dimensional normed space with unit sphere S_X and let L(X) be the space of linear operators from X into itself. It is proved that X is an inner product space if and only if for A,C∈L(X)