相对论性无自旋粒子在Hartmann势场中运动的精确解

在标量势等于矢量势的条件下,本文获得了具有Hartmann型势的Klein-Gordon方程的精确解.给出了束缚态的精确的能谱方程和归一化的径向波函数,对于散射态,获得了按“k/2π标度”归一化的径向波函数和相移的解析计算公式.讨论了散射振幅的解析性质和波函数、能谱方程以及相移的非相对论近似.     

LONG-TIME BEHAVIOR OF A CLASS OF REACTION DIFFUSION EQUATIONS WITH TIME DELAYS

The present paper devotes to the long-time behavior of a class of reaction diffusion equations with delays under Dirichlet boundary conditions. The stability and global attractability for the zero solution are provided, and the existence, stability and attractability for the positive stationary solution are also obtained.     

A FUNDAMENTAL SOLUTION FOR THE LAPLACE OPERATOR ON THE QUATERNIONIC HEISENBERG GROUP

In this paper, the author studies the Laplace operator on the quaternionic Heisenberg group, construct a fundamental solution for it and use this solution to prove the Lp-boundedness and the weak (1-1) boundedness of certain singular convolution operators on the quaternionic Heisenberg group.     

Solitary waves and their bifurcations of KdV like equation with higher order nonlinearity

We investigate the KdV like equation with higher order nonlinearity ut + a(1 +bun)unux + uxxx = 0with n ≥ 1, a, b ∈ R and α≠ 0. The bifurcations and explicit expressions of solitary wave solutions for theequation are discussed by using the bifurcation method and qualitative theory of dynamical systems. Thebifurcation diagrams, existence and number of the solitary waves are given.     

非光滑非凸多目标规划解的充分条件

Kuhn-Tucker型条件的充分性一直是最优化理论中引人注意的一个问题.本文对非光滑函数提出了几个非凸概念,然后,讨论了非光滑非凸多目标规划中Kuhn-Tucker型条件和Fritz John型条件的充分性,在很弱的条件下,建立了一系列充分条件.     

Towards a general solution of the Hamiltonian constraints of General Relativity

The present work has a double aim. On the one hand, we call attention on the relationship existing between the Ashtekar formalism and other gauge-theoretical approaches to gravity, in particular the Poincaré Gauge Theory. On the other hand, we study two kinds of solutions for the constraints of General Relativity, consisting of two mutually independent parts, namely a general three-metric-dependent contribution to the extrinsic curvature K _ab in terms of the Cotton–York tensor, and besides it further metric independent contributions, which we analyze in particular in the presence of isotropic three-metrics.     

两类方程亚纯解(n,1)级的上界估计

本文给出Riccati方程及另外一类具有代表性微分方程的亚纯解（n,1)级的上界估计，在一定条件下确立了文[2]中的猜测的正确性。     

Generalized quasilinearization method for reaction-diffusion equations under nonlinear and nonlocal flux conditions

In this paper we consider an initial boundary value problem for a reaction-diffusion equation under nonlinear and nonlocal Robin type boundary condition. Assuming the existence of an ordered pair of upper and lower solutions we establish a generalized quasilinearization method for the problem under consideration whose characteristic feature consists in the construction of monotone sequences converging to the unique solution within the interval of upper and lower solutions, and whose convergence rate is quadratic. Thus this method provides an efficient iteration technique that produces not only improved approximations due to the monotonicity of its iterates, but yields also a measure of the convergence rate.     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.