矩阵的秩的一个定理和线性方程组的同解定理

本文给出了矩阵乘积的秩定理的一个逆形式,并应用它证明了线性方程组的同解定理. 本文中的符号同[1].在[1]中有以下定理: 定理:两个矩阵的乘积的秩不大于每一因子的秩.特别,当有一个因子是可逆矩阵时,乘积的秩等于另一因子的秩.     

矩阵秩分解定理的一个证明及其应用

矩阵的秩分解定理是矩阵论中的一个基础性定理.本文给出了秩分解定理的一个证明,描述了其中可逆矩阵P,Q的构造,讨论了秩分解定理及其P,Q的构造在解线性方程组中的应用,以及在判别Sylvester不等式等号成立中的应用.     

单Artin环上长方矩阵的算术距离与好的距离图

设R是一个单Artin环,本文应用Wedderburn-Artin定理,讨论了R上矩阵的内秩与等价化简,用内秩定义了R上矩阵的算术距离,并且证明了图G=(Rm×n,～)一般不是好的距离图,其中A～BA-B的内秩为1,A,B∈Rm×n。     

定向图的斜秩

定向图Gσ是一个不含有环(loop)和重边的有向图,其中G称作它的基图.S(Gσ)是Gσ的斜邻接矩阵.S(Gσ)的秩称为Gσ的斜秩,记为sr(Gσ).定向图的斜邻接矩阵是斜对称的,因而,它的斜秩是偶数.本文主要考虑简单定向图的斜秩,首先给出斜秩的一些简单基本知识,紧接着分别刻画斜秩是2的定向图和斜秩是4的带有悬挂点的定向图;其次利用匹配数给出具有n个顶点、围长是k的单圈图的斜秩表达式;作为推论,列出斜秩是4的所有单圈图和带有悬挂点的双圈图;另外研究具有n个顶点、围长是k的单圈图的图类中斜秩的最小值,并刻画了极图;最后研究斜邻接矩阵是非奇异的定向单圈图.     

给定阶数的简约单圈图的秩集(英文)

图的秩定义为其邻接阵的秩.如果一个连通图中不同顶点的邻域是不同的,我们称该图是简约图.本文证明有n个顶点简约单圈图的秩r满足:若r是偶数,则2n/3≤r≤n;若r是奇数,则(2n+5)/3≤r≤n.同时我们给出有偶数秩r和阶数3r/2或奇数秩r和阶数(3r-5)/2极大简约单圈图的刻画.     

列满矩阵元素扰动秩的稳定性(英文)

秩是矩阵的重要数值特征之一 .本文运用矩阵的范数 ,分析、研究列满矩阵 ,提出并证明了列满矩阵元素扰动秩的稳定性定理及两个推论 .     

适合无限维实零点定理的序域之结构Ⅰ

本文的目的是建立适合无限维实零点定理的序域的结构定理．作为预备工作,文章的第一部分研究一类无秩为d的裂缝的序群,这里d是无限基数．藉助于Hahn嵌入定理,本文给出了无秩为d的裂缝的序群的结构．     

一些定向图的斜秩

设G~σ为一个定向图,S(G~σ)为它的斜邻接矩阵.定向图G~σ的斜秩定义为S(G~σ)的秩,记为sr(G~σ).本文刻画了一些定向图以及一类k-圈定向图的斜秩.     

适合无限维实零点定理的序域之结构Ⅰ

本文的目的是建立适合无限维实零点定理的序域的结构定理．作为预备工作,文章的第一部分研究一类无秩为d的裂缝的序群,这里d是无限基数．藉助于Hahn嵌入定理,本文给出了无秩为d的裂缝的序群的结构．     

积秩定理的别证

<正> 积秩定理有多种证法。本文再给出二种比较简便的证法。积秩定理设A是数域P上的n×m矩阵,B是数城P上的m×s矩阵,则R(AB)≤min{R(A),R(B)}即乘积的秩不超过各因子的秩。     

On region crossing change and incidence matrix

In a recent work of Ayaka Shimizu, she studied an operation named region crossing change on link diagrams, which was proposed by Kishimoto, and showed that a region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that the region crossing change on a 2-component link diagram is an unknotting operation if and only if the linking number of the diagram is even. Besides, we define an incidence matrix of a link diagram via its signed planar graph and its dual graph. By studying the relation between region crossing change and incidence matrix, we prove that a signed planar graph represents an n-component link diagram if and only if the rank of the associated incidence matrix equals c n + 1, where c denotes the size of the graph.     

偶特征有限域上对称矩阵结合方案

设S(n,q)是偶特征有限域F_q上n×n对称矩阵所成的集合.令R_i={(X,Y)|X,Y∈S(n,q),rank(Y-X)=2i-1,2i},0≤i≤[(n+1)/2]采用矩阵方法,证明了Sym(n,q)={s(n,q),{R_i}_(0≤i≤)[(n+1)/2]}是[(n+1)/2]个结合类的P—多项式对称结合方案,而Sym(n,q)的结合关系的图Γ~((1))是正则的,并且它同构于交错矩阵结合方案.此外,又给出Sym(n,q)的自同构形式.     

一类矩阵多项式的秩特征

给出了一类矩阵多项式的秩特征定理及它的多种证法.     

四元数阵重行列式与复阵行列式的关系

指出四元数阵重行列式可用复阵行列式来表示，于是，复阵的伴随矩阵、求逆阵公式、秩的下界等，都可相应地推广到四元数阵．     

欧氏环上某些矩阵特征性质的刻化

设Ｒ是一个欧氏环。本文首先给出Ｒ上矩阵多项式的秩的一个定理，然后用此定理刻化了Ｒ上某些矩阵的特征性质。     

Maximum Order of Triangle‐Free Graphs with a Given Rank

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle‐free graphs with a given rank and characterize all such graphs achieving the maximum order.     

Asymptotic spectral analysis of growing regular graphs

We propose the quantum probabilistic techniques to obtain the asymptotic spectral distribution of the adjacency matrix of a growing regular graph. We prove the quantum central limit theorem for the adjacency matrix of a growing regular graph in the vacuum and deformed vacuum states. The condition for the growth is described in terms of simple statistics arising from the stratification of the graph. The asymptotic spectral distribution of the adjacency matrix is obtained from the classical reduction.

     

一个矩阵函数及其应用

给出了矩阵函数f（X）=A-BX-（BX）＊的秩和最小惯性指数定理,其中＊表示矩阵的共轭转置.作为应用,给出了Lyapunov矩阵方程以及矩阵不等式BX＋（BX）＊≥A和BX＋（BX）＊≤A可解的若干充要条件.     

A note on universally optimal matrices and field independence of the minimum rank of a graph

For a simple graph G on n vertices, the minimum rank of G over a field F, written as mr^F(G), is defined to be the smallest possible rank among all n×n symmetric matrices over F whose (i,j)th entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. A symmetric integer matrix A such that every off-diagonal entry is 0, 1, or -1 is called a universally optimal matrix if, for all fields F, the rank of A over F is the minimum rank of the graph of A over F. Recently, Dealba et al. [L.M. Dealba, J. Grout, L. Hogben, R. Mikkelson, K. Rasmussen, Universally optimal matrices and field independence of the minimum rank of a graph, Electron. J. Linear Algebra 18 (2009) 403-419] initiated the study of universally optimal matrices and established field independence or dependence of minimum rank for some families of graphs. In the present paper, more results on universally optimal matrices and field independence or dependence of the minimum rank of a graph are presented, and some results of Dealba et al. [5] are improved.     

图同构的必要条件

结合图对应的邻接矩阵,利用矩阵的秩和矩阵的合同关系,得到了图同构的一个必要条件;然后给出了图同构的一个理论判断的算法．