Janossy Densities. II. Pfaffian Ensembles

We extend the main result of the companion paper J. Stat. Phys. 113:595–610 to the case of the pfaffian ensembles.     

半正定矩阵Hadamard积的不等式

利用分块矩阵的方法得到了关于半正定矩阵M-P逆的H adam ard积的几个偏序不等式,推广了某些已知的不等式.     

Spectrum and analyticity of semigroups arising in elasticity theory and hydromechanics

Cauchy problems for a second order linear differential operator equation

On the solutions of the equation AXB = C under Toeplitz‐like and Hankel matrices constraint

In this paper, we are mainly concerned with 2 types of constrained matrix equation problems of the form AXB=C, the least squares problem and the optimal approximation problem, and we consider several constraint matrices, such as general Toeplitz matrices, upper triangular Toeplitz matrices, lower triangular Toeplitz matrices, symmetric Toeplitz matrices, and Hankel matrices. In the first problem, owing to the special structure of the constraint matrix , we construct special algorithms; necessary and sufficient conditions are obtained about the existence and uniqueness for the solutions. In the second problem, we use von Neumann alternating projection algorithm to obtain the solutions of problem. Then we give 2 numerical examples to demonstrate the effectiveness of the algorithms.     

The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic

Given a graph $G$ we are interested in studying the symmetric matrices associated to $G$ with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees.     

Split‐type octonion matrix

The split and hyperbolic (countercomplex) octonions are eight‐dimensional nonassociative algebras over the real numbers, which are in the form , where e_m's have different properties for them. The main purpose of this paper is to define the split‐type octonion and its matrix whose inputs are split‐type octonions and give some properties for them by using the real quaternions, split, and hyperbolic (countercomplex) octonions. On the other hand, to make some definitions, we present some operations on the split‐type octonions. Also, we show that every split‐type octonions can be represented by 2 × 2 real quaternion matrix and 4 × 4 complex number matrix. The information about the determinants of these matrix representations is also given. Besides, the main features of split‐type octonion matrix concept are given by using properties of  real quaternion matrices. Then, 8n × 8nreal matrix representations of split‐type octonion matrices are shown, and some algebraic structures are examined. Additionally, we introduce real quaternion adjoint matrices of split‐type octonion matrices. Moreover, necessary and sufficient conditions and definitions are given for split‐type octonion matrices to be special split‐type octonion matrices. We describe some special split‐type octonion matrices. Finally, oct‐determinant of split‐type octonion matrices is defined. Definitive and understandable examples of all definitions, theorems, and conclusions were given for a better understanding of all these concepts.     

On the Positivity of the Coefficients of a Certain Polynomial Defined by Two Positive Definite Matrices

It is shown that the polynomialp(t) = Tr[(A+tB)^m]has positive coefficients when m = 6 and A and B are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior, general results. This problem arises from a conjecture raised by Bessis, Moussa, and Villani in connection with a long-standing problem in theoretical physics. The full conjecture, as shown recently by Lieb and Seiringer, is equivalent to p(t) having positive coefficients for any m and any two n-by-n positive definite matrices. We show that, generally, the question in the real case reduces to that of singular A and B, and this is a key part of our proof.     

Lower bounds for the maximal Lyapunov exponent

Upper bounds for the maximal Lyapunov exponent,E, of a sequence of matrix-valued random variables are easy to come by asE is the infimum of a real-valued sequence. We shall show that under irreducibility conditions similar to those needed to prove the Perron-Frobenius theorem, one can find sequences which increase toE. As a byproduct of the proof we shall see that we may replace the matrix norm with the spectral radius when computingE in such cases. Finally, a sufficient condition for transience of random walk in a random environment is given.