Moving zeros among matrices

We investigate the zero-patterns that can be created by unitary similarity in a given matrix, and the zero-patterns that can be created by simultaneous unitary similarity in a given sequence of matrices. The latter framework allows a “simultaneous Hessenberg” formulation of Pati’s tridiagonal result for 4 × 4 matrices. This formulation appears to be a strengthening of Pati’s theorem. Our work depends at several points on the simplified proof of Pati’s result by Davidson and Djokovi?. The Hessenberg approach allows us to work with ordinary similarity and suggests an extension from the complex to arbitrary algebraically closed fields. This extension is achieved and related results for 5 × 5 and larger matrices are formulated and proved.     

The work of Gian-Carlo rota on invariant theory

The purpose of this paper is twofold: first, to explain Gian-Carlo Rotas work on invariant theory; second, to place this work in a broad historical and mathematical context. Rotas work falls under three specific cases: vector invariants, the invariants of binary forms, and the invariants of skew-symmetric tensors. We discuss each of these cases and show how determinants and straightening play central roles. In fact, determinants constitute all invariants in the vector case; for binary forms and skew-symmetric tensors, they constitute all invariants when invariants are represented symbolically. Consequently, we explain the symbolic method both for binary forms and for skew-symmetric tensors, where Rota developed generalizations of the usual notion of a determinant. We also discuss the Grassmann algebra, with its two operations of meet and join, which was a theme which ran through Rotas work on invariant theory almost from the very beginning.To the memory of Gian-Carlo Rota     

Hyman’s method revisited

The QR algorithm is considered one of the most reliable methods for computing matrix eigenpairs. However, it is unable to detect multiple eigenvalues and Jordan blocks. Matlab’s eigensolver returns heavily perturbed eigenvalues and eigenvectors in such cases and there is no hint for possible principal vectors. This paper calls attention to Hyman’s method as it is applicable for computing principal vectors and higher derivatives of the characteristic polynomial that may help to estimate multiplicity, an important information for more reliable computation. We suggest a test matrix collection for Jordan blocks. The first numerical tests with these matrices reveal that the computational problems are deeper than expected at the beginning of this work.     

Analysis for an N-stepped Rayleigh bar with sections of complex geometry

In this paper we analyse the vibrations of an N-stepped Rayleigh bar with sections of complex geometry, supported by end lumped masses and springs. Equations of motion and boundary conditions are derived from the Hamilton’s variational principal. The solutions for tapered and exponential sections are given. Two types of orthogonality for the eigenfunctions are obtained. The analytic solution to the N-stepped Rayleigh model is constructed in terms of Green function.     

Unitarily achievable zero patterns and traces of words in A and A

Our primary objective is to identify a natural and substantial problem about unitary similarity on arbitrary complex matrices: which 0-patterns may be achieved for any given n-by-n complex matrix via some unitary similarity of it. To this end, certain restrictions on “achievable” 0-patterns are mentioned, both positional and, more important, on the maximum number of achievable 0’s. Prior results fitting this general question are mentioned, as well as the “first” unresolved pattern (for 3-by-3 matrices!). In the process a recent question is answered.A closely related additional objective is to mention the best known bound for the maximum length of words necessary for the application of Specht’s theorem about which pairs of complex matrices are unitarily similar, which seems not widely known to matrix theorists. In the process, we mention the number of words necessary for small size matrices.     

Enhancements to the von Neumann trace inequality

Upper trace bounds for the product of two n × n complex matrices are presented. The real component of the trace inequality is tighter than von Neumann’s inequality, and the imaginary component is new.     

Arveson’s criterion for unitary similarity

This paper is an exposition of W.B. Arveson’s complete invariant for the unitary similarity of complex, irreducible matrices.     

Arithmetic-Geometric Mean determinantal identity

In this paper, we give a generalization of a determinantal identity posed by Charles R. Johnson about minors of a Toeplitz matrix satisfying a specific matrix identity. These minors are those appear in the Dodgson’s condensation formula.     

An asymmetric Kadison’s inequality

Some inequalities for positive linear maps on matrix algebras are given, especially asymmetric extensions of Kadison’s inequality and several operator versions of Chebyshev’s inequality. We also discuss well-known results around the matrix geometric mean and connect it with complex interpolation.     

The α-scalar diagonal stability of block matrices

We generalize two results: Kraaijevanger’s 1991 characterization of diagonal stability via Hadamard products and the block matrix version of the closure of the positive definite matrices under Hadamard multiplication. We restate our generalizations in terms of P^α-matrices and α-scalar diagonally stable matrices.     

Another theorem of Cauchy which ‘admits exceptions’

Several exceptions are provided for a theorem in Cauchy’s Cours d’Analyse in the proof of which the need for uniform convergence has been ignored. A reconstruction of this theorem is offered.     

An alternative approach to unitoidness

In a recent paper [C.R. Johnson, S. Furtado, A generalization of Sylvester’s law of inertia, Linear Algebra Appl. 338 (2001) 287-290], Sylvester’s law of inertia is generalized to any matrix that is ∗-congruent to a diagonal matrix. Such a matrix is called unitoid. In the present paper, an alternative approach to the subject of unitoidness is offered. Specifically, Sylvester’s law of inertia states that a Hermitian n × n matrix of rank r with inertia (p, q, n − r) is ∗-congruent to the direct sum

eⁱ⁰I_p⊕e^iπI_q⊕0I_n-r.     

A Cauchy-Khinchin integral inequality

This paper discusses some Cauchy-Khinchin integral inequalities. Khinchin [2] obtained an inequality relating the row and column sums of 0-1 matrices in the course of his work on number theory. As pointed out by van Dam [6], Khinchin’s inequality can be viewed as a generalization of the classical Cauchy inequality. Van Dam went on to derive analogs of Khinchin’s inequality for arbitrary matrices. We carry this work forward, first by proving even more than general matrix results, and then by formulating them in a way that allows us to apply limiting arguments to create new integral inequalities for functions of two variables. These integral inequalities can be interpreted as giving information about conditional expectations.     

On extremum properties of orthogonal quotients matrices

In this paper we explore the extremum properties of orthogonal quotients matrices. The orthogonal quotients equality that we prove expresses the Frobenius norm of a difference between two matrices as a difference between the norms of two matrices. This turns the Eckart-Young minimum norm problem into an equivalent maximum norm problem. The symmetric version of this equality involves traces of matrices, and adds new insight into Ky Fan’s extremum problems. A comparison of the two cases reveals a remarkable similarity between the Eckart-Young theorem and Ky Fan’s maximum principle. Returning to orthogonal quotients matrices we derive “rectangular” extensions of Ky Fan’s extremum principles, which consider maximizing (or minimizing) sums of powers of singular values.     

Eigenvalues and colorings of digraphs

Wilf’s eigenvalue upper bound on the chromatic number is extended to the setting of digraphs. The proof uses a generalization of Brooks’ Theorem to digraph colorings.     

Singularity, Wielandt’s lemma and singular values

In this study, some upper and lower bounds for singular values of a general complex matrix are investigated, according to singularity and Wielandt’s lemma of matrices. Especially, some relationships between the singular values of the matrix A and its block norm matrix are established. Based on these relationships, one may obtain the effective estimates for the singular values of large matrices by using the lower dimension norm matrices. In addition, a small error in Piazza (2002) [G. Piazza, T. Politi, An upper bound for the condition number of a matrix in spectral norm, J. Comput. Appl. Math. 143 (1) (2002) 141-144] is also corrected. Some numerical experiments on saddle point problems show that these results are simple and sharp under suitable conditions.     

A few pedagogical designs in linear algebra with Cabri and Maple

Since the 90’s, with the creation of new electronic environments for learning and teaching, several research groups in Mathematics Education have been emerging and developing. This article elaborates few pedagogical designs in Linear Algebra supported by both the geometrical micro-world Cabri and the computer algebra system Maple. Stumbling blocks in the learning of Linear Algebra are examined, more exactly linear transformations, eigenvectors, quadratic forms, conics with changes of bases and finally singular values. Encountering a special group of students very eager to explore the world of linear algebra, we initiated a classification of linear transformations of the Euclidean plane R² via ellipses.     

Topological uniform descent and Weyl type theorem

The generalized Weyl’s theorem holds for a Banach space operator T if and only if T or T^∗ has the single valued extension property in the complement of the Weyl spectrum (or B-Weyl spectrum) and T has topological uniform descent at all λ which are isolated eigenvalues of T. Also, we show that the generalized Weyl’s theorem holds for analytically paranormal operators.     

On block partial linearizations of the pfaffian

Amitsur’s formula, which expresses det(A + B) as a polynomial in coefficients of the characteristic polynomial of a matrix, is generalized for partial linearizations of the pfaffian of block matrices. As applications, in upcoming papers we determine generators for the SO(n)-invariants of several matrices and relations for the O(n)-invariants of several matrices over a field of arbitrary characteristic.     

Operator extensions of Hua’s inequality

We give an extension of Hua’s inequality in pre-Hilbert C^∗-modules without using convexity or the classical Hua’s inequality. As a consequence, some known and new generalizations of this inequality are deduced. Providing a Jensen inequality in the content of Hilbert C^∗-modules, another extension of Hua’s inequality is obtained. We also present an operator Hua’s inequality, which is equivalent to operator convexity of given continuous real function.