Large families of laplacian isospectral graphs

Two graphs are isomorphic only if they are Laplacian isospectral, that is, their Laplacian matrices share the same multiset of eigenvalues. Large families of nonisomorphic Laplacian isospectral graphs are exhibited for which the common multiset of eigenvalues consists entirely of integers.     

单A直和子空间

引入单直和子空间的概念,证明了线性空间可唯一分解为单直和子空间的直和,并且给出了计算方法.     

单模光纤二阶偏振模色散的Jones矩阵

利用单模光纤PMD矢量与Jones矩阵之间的关系,推导了由该矢量表示的光纤二阶PMD的Jones矩阵解析表达式,利用该矩阵可以确定输出端时域脉冲在二阶PMD近似下的表达式,并由此仿真二阶PMD对信号传输质量的影响.通过比较输入与输出信号脉冲波形和眼图发现,随着传输速率和传输距离的增加输出信号劣化.最后结果表明,当主偏振态的旋转速率为零时,二阶PMD的影响可以忽略;但当其值增大时,输出信号劣化严重.在光纤通信系统设计时,需要考虑偏振模色散影响分析结果,可提供参考依据.     

Stabilization of stochastic singular nonlinear hybrid systems

This paper deals with the control of the class of singular nonlinear stochastic hybrid systems. Under some appropriate assumptions, results on stochastic stability and stochastic stabilization are developed. Two state feedback controllers (linear and nonlinear) that stochastically stabilize the class of systems we are considering are designed. LMI sufficient conditions are developed to compute the gains of these controllers.     

The numerical range of a nonnegative matrix

We offer an almost self-contained development of Perron–Frobenius type results for the numerical range of an (irreducible) nonnegative matrix, rederiving and completing the previous work of Issos, Nylen and Tam, and Tam and Yang on this topic. We solve the open problem of characterizing nonnegative matrices whose numerical ranges are regular convex polygons with center at the origin. Some related results are obtained and some open problems are also posed.     

CRITERION FOR SL（2,Z）－MATRIX TO BE CONJUGATE TO ITS INVERSE

This paper gives a necessary and sufficient condition for a matrix in SL(2, Z) to be conjugate to its inverse. This condition reduces the determination of the conjugation to solving some indeterminate equation of second degree. It yields an algorithm to determine this conjugation in finite steps based on the elementary number theory.     

矩阵系统扰动后的稳定性问题

本文证明：若矩阵系统是广义各态历经的，则系统是稳定的；若矩阵系统是善真的，则系统是条件稳定的。     

On formulas of Ramanujan and Evans

We give short elementary proofs of a formula of Ramanujan as interpreted by Bradley, and a companion formula originally proved by W. Chu. We also give an elementary proof of a generalization of an identity originally proved using modular functions and used to study a generating function for the number of partitions with specified crank. Research partially supported by NSF grant DMS 99-70865. 2000 Mathematics Subject Classification Primary—39A70, 11P83; Secondary—33C20     

A Sharp Upper Bound for the Number of Spanning Trees of a Graph

Let G = (V,E) be a simple graph with n vertices, e edges and d₁ be the highest degree. Further let λ_i, i = 1,2,...,n be the non-increasing eigenvalues of the Laplacian matrix of the graph G. In this paper, we obtain the following result: For connected graph G, λ₂ = λ₃ = ... =  λ_n-1 if and only if G is a complete graph or a star graph or a (d₁,d₁) complete bipartite graph. Also we establish the following upper bound for the number of spanning trees of G on n, e and d₁ only:

左C-半群的左交错积结构

给出了左C-半群的另一种结构,所谓左交错积结构,并刻画了它的特殊情形.这种结构为左C-半群在广义正则半群类中的再推广奠定了基础.