Differential Operator Solutions of the Bauer-Peschl Equation

In this paper new solutions of the Bauer-Peschl equation represented by differential operators are derived. A relation to the solutions of Bauer is given. Furthermore, it will be said in which new way Bauer's solutions can be obtained. Also three other ways for obtaining the solutions of the Bauer-Peschl equation are sketched.     

对称本原矩阵广义上指数的极矩阵

本文以伴随图的形早了对称本原矩阵和迹零对称本原矩阵的广义上指数的极矩阵。     

第三类模糊事件的模糊概率

研究第三类模糊概率--模糊事件模糊概率的数学描述.在区间概率和第二类模糊概率的基础上,进一步给出了第三类离散型模糊概率的随机变量及其模糊分布函数和模糊分布列的定义和性质以及数字特征,并研究了连续型模糊概率随机变量的模糊数学期望和模糊方差的定义,进一步完善了模糊概率理论.     

Random attractor for the 3D viscous primitive equations driven by fractional noises

We develop a new and general method to prove the existence of the random attractor (strong attractor) for the primitive equations (PEs) of large-scale ocean and atmosphere dynamics under non-periodic boundary conditions and driven by infinite-dimensional additive fractional Wiener processes. In contrast to our new method, the common method, compact Sobolev embedding theorem, is to obtain the time-uniform a priori estimates in some Sobolev space whose regularity is higher than the solution space. But this method can not be applied to the 3D stochastic PEs with the non-periodic boundary conditions. Therefore, the existence of universal attractor (weak attractor) was established in previous works (see [15], [16]). The main idea of our method is that we first derive that $\mathbb{P}$-almost surely the solution operator of stochastic PEs is compact. Then we construct a compact absorbing set by virtue of the compact property of the solution operator and the existence of a absorbing set. We should point out that our method has some advantages over the common method of using compact Sobolev embedding theorem, i.e., using our method we only need to obtain time-uniform a priori estimates in the solution space to prove the existence of random attractor for the corresponding stochastic system, while the common method need to establish time-uniform a priori estimates in a more regular functional space than the solution space. Take the stochastic PEs for example, as the unique strong solution to the stochastic PEs belongs to $C([0,T];{(H^1(?))}^3)$, in view of our method, we only need to obtain the time-uniform a priori estimates in the solution space ${(H^1(?))}^3$ to prove the existence of random attractor for this stochastic system, while the common method need to establish time-uniform a priori estimates for the solution in the functional space ${(H^2(?))}^3$. However, time-uniform a priori estimates in ${(H^2(?))}^3$ for the solution to stochastic PEs are too difficult to be established. The present work provides a general way for proving the existence of random attractor for common classes of dissipative stochastic partial differential equations driven by Wiener noises, fractional noises and even jump noises. In a forth coming paper, using this new method we [46] prove the existence of random attractor for the stochastic nematic liquid crystals equations. This is the first result about the long-time behavior of stochastic nematic liquid crystals equations.     

On the primitive idempotents of distance-regular graphs

Let Γ denote a distance-regular graph with diameter d3. Let E, F denote nontrivial primitive idempotents of Γ such that F corresponds to the second largest or the least eigenvalue. We investigate the situation that there exists a primitive idempotent H of Γ such that EF is a linear combination of F and H. Our main purpose is to obtain the inequalities involving the cosines of E, and to show that equality is closely related to Γ being Q-polynomial with respect to E. This generalizes a result of Lang on bipartite graphs and a result of Pascasio on tight graphs.     

A class of minimal cyclic codes over finite fields

Let ${\mathbb{F}}_q$ be a finite field of odd order $q$ and $n=2^a{p}_1^{a_1}{p}_2^{a_2}$, where $a,a_1,a_2$ are positive integers, $p_1,p_2$ are distinct odd primes and $4p_1{p}_2|q?1$. In this paper, we study the irreducible factorization of $x^n?1$ over ${\mathbb{F}}_q$ and all primitive idempotents in the ring ${\mathbb{F}}_q\left[x\right]∕〈x^n?1〉$.Moreover, we obtain the dimensions and the minimum Hamming distances of all irreducible cyclic codes of length $n$ over ${\mathbb{F}}_q$.     

一种基于梯形模糊语言变量的多属性决策方法

针对属性权重未知、属性值以梯形模糊语言变量形式给出的多属性决策问题,提出了一种扩展的VIKOR决策方法。首先介绍了梯形模糊语言变量的概念、运算法则,提出了梯形模糊语言变量值之间的距离公式,并进行了证明。在此基础上利用离差最大化方法确定了属性指标权重,并建立了基于梯形模糊语言变量的扩展VIKOR方法,给出了决策步骤。最后,通过一个算例说明该方法的有效性。     

The primitive ideals of the Cuntz–Krieger algebra of a row-finite higher-rank graph with no sources

We catalogue the primitive ideals of the Cuntz–Krieger algebra of a row-finite higher-rank graph with no sources. Each maximal tail in the vertex set has an abelian periodicity group of finite rank at most that of the graph; the primitive ideals in the Cuntz–Krieger algebra are indexed by pairs consisting of a maximal tail and a character of its periodicity group. The Cuntz–Krieger algebra is primitive if and only if the whole vertex set is a maximal tail and the graph is aperiodic.     

On weights in duadic abelian codes

In this note, we prove that if C is a duadic binary abelian code with splitting μ=μ₋₁ and the minimum odd weight of C satisfies d²−d+1≠n, then d(d−1)n+11. We show by an example that this bound is sharp. A series of open problems on this subject are proposed.     

Cycles with Prescribed and Forbidden Sets of Elements in Cubic Graphs

 A necessary and sufficient condition for the existence of a cycle containing a set of three vertices and an edge excluding another edge is obtained for 3-connected cubic graphs by means of canonical contractions. A necessary and sufficient condition is also obtained for a cyclically 4-connected cubic graph to have a cycle that contains a set of four vertices and that avoids another vertex. Received: October 4, 1999 Final version received: June 14, 2000