Interference of probabilities and number field structure of quantum models

We study the probabilistic consequences of the choice of the basic number field in the quantum formalism. We demonstrate that by choosing a number field for a linear space representation of quantum model it is possible to describe various interference phenomena. We analyse interference of probabilistic alternatives induced by real, complex, hyperbolic (Clifford) and p‐adic representations.     

推广的奇轮的圆色数

图G的圆色数(又称"星色数")xc(G)是Vince在1988年提出的,它是图的色数 的自然推广.本文由奇轮出发构造了一族平面图,并证明了此类图的圆色数恰恰介于2和 3之间,填补了该领域的空白.     

Equilibrium Problems with Applications to Eigenvalue Problems

In this paper, we consider equilibrium problems and introduce the concept of (S)₊ condition for bifunctions. Existence results for equilibrium problems with the (S)₊ condition are derived. As special cases, we obtain several existence results for the generalized nonlinear variational inequality studied by Ding and Tarafdar (Ref. 1) and the generalized variational inequality studied by Cubiotti and Yao (Ref. 2). Finally, applications to a class of eigenvalue problems are given.     

Regularization of Discrete Ill-Posed Problems

The paper concerns conditioning aspects of finite-dimensional problems arising when the Tikhonov regularization is applied to discrete ill-posed problems. A relation between the regularization parameter and the sensitivity of the regularized solution is investigated. The main conclusion is that the condition number can be decreased only to the square root of that for the nonregularized problem. The convergence of solutions of regularized discrete problems to the exact generalized solution is analyzed just in the case when the regularization corresponds to the minimal condition number. The convergence theorem is proved under the assumption of the suitable relation between the discretization level and the data error. As an example the method of truncated singular value decomposition with regularization is considered. This revised version was published online in July 2006 with corrections to the Cover Date.     

Fiberings with Fiber RP（κ）

Let κ be non-negative integer. The unoriented bordism classes, which can be represented as [RP（ξ^κ）] where ξ^κ is a k-plane bundle, form an ideal of the unoriented bordism ring MO.. A group of generators of this ideal expressed by a base of MO. and a necessary and sufficient condition for a bordism class to belong to this ideal are given.     

马歇尔-勒纳条件的实证研究

本文从人民币实际汇率变动是否会对我国贸易收支产生影响出发，基于马歇尔．勒纳条件，对计算贸易弹性常用的OLS回归模型进行了改进，建立了向量自回归误差修正模型来估算我国的国际贸易弹性。实证研究表明：我国进出口需求的价格弹性之和大于1。因此人民币贬值可改善贸易收支；反之升值将使贸易收支恶化。     

具有急慢性阶段的MSIS流行病模型阈值和稳定性结果

系统研究了具有急性和慢性两个阶段的MSIS流行病模型.由两节构成,第1节建立和研究了具有急慢性阶段的MSIS流行病模型;第2节在第1节的基础上建立和研究了具有慢性病病程的MSIS流行病模型.第1节的模型是四个常微分方程构成的方程组.第2节的模型既含有常微分方程,又含有偏微分方程.运用微分方程和积分方程中的理论和方法,得到了这两个模型再生数R0的表达式.证明了当R0<1时,无病平衡态是全局渐近稳定性,给出了各模型地方病平衡态的存在性和稳定性条件.     

Substructuring preconditioners for saddle-point problems arising from Maxwell's equations in three dimensions

This paper is concerned with the saddle-point problems arising from edge element discretizations of Maxwell's equations in a general three dimensional nonconvex polyhedral domain. A new augmented technique is first introduced to transform the problems into equivalent augmented saddle-point systems so that they can be solved by some existing preconditioned iterative methods. Then some substructuring preconditioners are proposed, with very simple coarse solvers, for the augmented saddle-point systems. With the preconditioners, the condition numbers of the preconditioned systems are nearly optimal; namely, they grow only as the logarithm of the ratio between the subdomain diameter and the finite element mesh size.

     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005     

On a free boundary problem for the Reynolds equation derived from the Stokes system with Tresca boundary conditions

The asymptotic behaviour of a Stokes flow with Tresca free boundary friction conditions when one dimension of the fluid domain tends to zero is studied. A specific Reynolds equation associated with variational inequalities is obtained and uniqueness is proved.