Pointwise estimates for relative fundamental solutions of heat equations in $${\mathbb{R} \times \mathbb{C}}$$

Let be a subharmonic, nonharmonic polynomial and a parameter. Define , a closed, densely defined operator on . If and , we solve the heat equations , u(0,z) = f(z) and , . We write the solutions via heat semigroups and show that the solutions can be written as integrals against distributional kernels. We prove that the kernels are C ^∞ off of the diagonal {(s, z, w) : s = 0 and z = w} and find pointwise bounds for the kernels and their derivatives.      

供应链系统转变为供需网系统研究

为帮助传统企业顺利转变为供需网企业,提出了供应链系统向供需网系统的转变研究.该研究利用企业节点数据化,通过企业节点的改造及供应链节点与供需网的连接操作达到系统转变的目的.在sc节点数据结构及自身系统功能模块改造的基础上,着重思考了供应链节点连入SDN中的算法思想.通过非线性择优连接方法避免了造成系统易攻击性的枢纽节点的出现.给出了连接算法流程,并以一个示例演示了此连接算法,从中也验证了非线性择优连接的有效性.     

Carleson测度与Bloch的刻画

在文中，对于C^n中有界强拟凸域。我们得到Carleson测度，消没Carleson测度的刻画。利用Carleson测度，我们还得到Bloch，小Bloch的刻画。     

Explicit construction of graph invariant for strongly pseudoconvex compact 3-dimensional rational CR manifolds

Let X be a strongly pseudoconvex compact 3-dimensional CR manifolds which bounds a complex variety with isolated singularities in some C^N. The weighted dual graph of the exceptional set of the minimal good resolution of V is a CR invariant of X; in case X has a tranversal holomorphic S¹ action, we show that it is a complete topological invariant of except for two special cases. When X is a rational CR manifolds, we give explicit algebraic algorithms to compute the graph invariant in terms of the ring structure of _k=0 m^k/m^k+1, where m is the maximal ideal of each singularity. An example is computed explicitly to demonstrate how the algorithms work.     

Bergman type operators on a class of weakly pseudoconvex domains

A necessary and sufficient condition for the boundedness of the operator: $(T_{s,u,u} f)(\xi ) = h^{u + \tfrac{v}{a}} (\xi )\smallint _{\Omega _a } h^s (\xi ')K_{s,u,v} (\xi ,\xi ')f(\xi ')dv(\xi ') on L^p (\Omega _a ,dv_\lambda ),1< p< \infty $ , is obtained, where $\Omega _a = \left\{ {\xi = (z,w) \in \mathbb{C}^{n + m} :z \in \mathbb{C}^n ,w \in \mathbb{C}^m ,|z|^2 + |w|^{2/a}< 1} \right\},h(\xi ) = (1 - |z|^2 )^a - |w|^2 $ andK _x,u,v (ξ,ξ′).This generalizes the works in literature from the unit ball or unit disc to the weakly pseudoconvex domain ω _a . As an appli cation, it is proved thatf?L _H ^p (ω _a ,dv _λ) implies $h\tfrac{{|a|}}{a} + |\beta |(\xi )D_2^a D_z^\beta f \in L^p (\Omega _a ,dv_\lambda ),1 \leqslant p< \infty $ , for any multi-indexa=(α₁,?,α _n and ß = (ß₁, —ß). An interesting question is whether the converse holds.     

On strong pseudomonotonicity and (semi)strict quasimonotonicity

An example in Ref. 1 is corrected to show that indeed a strongly pseudoconvex function, which is only once but not twice differentiable, does not necessarily have a strongly pseudoconvex gradient.     

Stability of multistage stochastic programming

In this paper, we study the stability of multistage stochastic programming with recourse in a way that is different from that used in studying stability of two-stage stochastic programs. Here, we transform the multistage programs into mathematical programs in the space ⁿ ×L _p with a simple objective function and multistage stochastic constraints. By investigating the continuity of the multistage multifunction defined by the multistage stochastic constraints and applying epi-convergence theory we obtain stability results for linear and linear-quadratic multistage stochastic programs.Project supported by the National Natural Science Foundation of China.     

Continuity properties of the normal cone to the level sets of a quasiconvex function

Two main properties of the subgradient mapping of convex functions are transposed for quasiconvex ones. The continuity of the functionxf(x)^–1f(x) on the domain where it is defined is deduced from some continuity properties of the normal coneN to the level sets of the quasiconvex functionf. We also prove that, under a pseudoconvexity-type condition, the normal coneN(x) to the set {x:f(x)f(x)} can be expressed as the convex hull of the limits of type {N(x _n)}, where {x _n} is a sequence converging tox and contained in a dense subsetD. In particular, whenf is pseudoconvex,D can be taken equal to the set of points wheref is differentiable.This research was completed while the second author was on a sabbatical leave at the University of Montreal and was supported by a NSERC grant. It has its origin in the doctoral thesis of the first author (Ref. 1), prepared under the direction of the second author.The authors are grateful to an anonymous referee and C. Zalinescu for their helpful remarks on a previous version of this paper.     

Strictly pseudoconvex domains and algebraic varieties

In the paper, we consider applications of strictly pseudoconvex domains to the problems of algebraicity and rationality. We give a new proof of the Kodaira theorem on the algebraicity of a surface and we also prove a multidimensional version of this theorem. Theorems analogous to the Hodge index theorem and the Lefschetz theorem about (1, 1)-classes are obtained for strictly pseudoconvex domains. Conjectures on the geometry of strictly pseudoconvex domains on algebraic surfaces are formulated. Translated fromMatematicheskie Zametki, Vol. 60, No. 3, pp. 414–422, September, 1996. This research was supported by the Russian Foundation for Basic Research under grant No. 93-01-00225 and by the International Science Foundation under grant No. 508.     

On the Lipschitzian properties of polyhedral multifunctions

In this paper, we show that for a polyhedral multifunctionF:R ⁿ →R ^m with convex range, the inverse functionF ⁻¹ is locally lower Lipschitzian at every point of the range ofF (equivalently Lipschitzian on the range ofF) if and only if the functionF is open. As a consequence, we show that for a piecewise affine functionf:R ⁿ →R ⁿ ,f is surjective andf ⁻¹ is Lipschitzian if and only iff is coherently oriented. An application, via Robinson's normal map formulation, leads to the following result in the context of affine variational inequalities: the solution mapping (as a function of the data vector) is nonempty-valued and Lipschitzian on the entire space if and only if the solution mapping is single-valued. This extends a recent result of Murthy, Parthasarathy and Sabatini, proved in the setting of linear complementarity problems. Research supported by the National Science Foundation Grant CCR-9307685.