D_x-广义正定矩阵

讨论Dx广义正定阵的问题,给出了Dx广义正定阵的一些等价性的刻划,同时还讨论了Dx广义正定阵的若干性质.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

Necessary conditions for multistationarity in discrete dynamical systems

R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation.     

关于矩阵和算子迹的一组不等式

给出关于半正定矩阵迹和正算子迹的一组不等式,得到与邱贤忠关于实数的不等式的类似结果.     

On Hardy’s Theorem on SU(1, 1)

The classical Hardy theorem asserts that ■ and its Fourier transform ■ can not both be very rapidly decreasing.This theorem was generalized on Lie groups and also for the Fourier-Jacobi transform.However,on SU(1,1)there are infinitely many"good"functions in the sense that ■ and its spherical Fourier transform ■ both have good decay. In this paper,we shall characterize such functions on SU(1,1).     

A New Family of Cyclic Difference Sets with Singer Parameters in Characteristic Three

We construct a new family of cyclic difference sets with parameters ((3 ^d – 1)/2, (3 ^{d – 1} – 1)/2, (3 ^{d – 2} – 1)/2) for each odd d. The difference sets are constructed with certain maps that form Jacobi sums. These new difference sets are similar to Maschietti's hyperoval difference sets, of the Segre type, in characteristic two. We conclude by calculating the 3-ranks of the new difference sets.     

改善液晶光阀投影光学系统偏振特性的理论设计方法

定量分析了液晶光阀投影光学系统中影响系统对比度的主要因素，利用矢量方法建立三维空间数学模型对光线进行追迹，并利用琼斯矩阵和矢量光学的原理分析了偏振器件--主要是波片--和各种光学薄膜对光学系统性能的影响。给出了在一定假设条件下的对没有波片的光学系统和插入波征后的光学系统的仿真计算结果。两组数据比较表明在光路中插入合适相位差的波片可以显著提高系统对比度等性能。     

矩阵特征值的几个不等式

研究矩阵特征值的上、下界以及特征值的实部、虚部的不等式 ,给出了特征值一些新的上界和下界     

Toda Chains in the Jacobi Method

We use the Jacobi method to construct various integrable systems, such as the Stäckel systems and Toda chains, related to various root systems. We find canonical transformations that relate integrals of motion for the generalized open Toda chains of types B _n, C _n, and D _n.     

Concerning seven and eight mutually orthogonal Latin squares

In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc.