r-循环矩阵与矩阵的对角化

讨论了 r-循环矩阵的一些运算性质 ,并用它给出了 n阶方阵可对角化的一个充要条件     

关于双特征Beltrami方程

该文研究空间Ｂｅｌｔｒａｍｉ方程的推广形式，即双特征Ｂｅｌｔｒａｍｉ方程．利用外微分形式与矩阵的外代数等工具，将双特征Ｂｅｌｔｒａｍｉ方程转化为一个非齐次的狆 调和方程，转化过程中只用到加于特征矩阵的一致椭圆型条件．然后验证了算子犃满足的条件：Ｌｉｐｓｃｈｉｔｚ型条件、单调不等式、齐次性条件以及算子犅满足的控制增长条件．并利用得到的狆 调和方程，给出了双特征Ｂｅｌｔｒａｍｉ方程广义解分量函数的弱单调性结果．     

关于矩阵Kronecker积的谱半径的不等式

本文证明了矩阵的 Kronecker积的谱半径的两个不等式     

Norms and lower bounds of some matrix operators on Fibonacci weighted difference sequence space

Norm of an operator T:X→Y is the best possible value of U satisfying the inequality and lower bound for T is the value of L satisfying the inequality where ‖.‖_X and ‖.‖_Y are the norms on the spaces X and Y, respectively. The main goal of this paper is to compute norms and lower bounds for some matrix operators from the weighted sequence space ?_p(w) into a new space called as Fibonacci weighted difference sequence space. For this purpose, we firstly introduce the Fibonacci difference matrix and the space consisting of sequences whose ‐transforms are in .     

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.     

An optimal perturbation bound

Cai and Zhang establish separate perturbation bounds for distances with spectral and Frobenius norms (Cai T, Zhang A. Rate‐optimal perturbation bounds for singular subspaces with applications to high‐dimensional statistics. The Annals of Statistics. 2018; Vol. 46, No. 1: 60?89). We extend their theorem to each unitarily invariant norm. It turns out that our estimation is optimal as well.     

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.     

Linear codes associated to skew-symmetric determinantal varieties

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given.