There exist no 2-type surfaces in E 3 which are images under stereographic projection of minimal surfaces in S 3

In this paper we deal with the following particular case of a weaker conjecture by B. Y. Chen: Are there 2-type Willmore surfaces in E ³? In particular we prove that the above question has a negative answer when the surface is the image under stereographic projection of a minimal surface in S ³.     

带有边集限制的最均匀支撑树问题

本在无向网络中，建立了带有边集限制的最均匀支撑树问题的网络模型．中首先解决最均匀支撑树问题，并给出求无向网络中最均匀支撑树的多项式时间算法；然后，给出了求无向网络中带有边集限制的最小树多项式时间算法；最后，在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题．     

A Theta Lift for Spin7

We establish an example of a functorial lift from generic cuspidal representations of a similitude group of the type A ₁×C ₂ to generic representations of Spin₇. Our construction uses the theta correspondence associated to the dual pair of the type (A ₁×C ₂ B ₃) inside E ₇. We also consider another theta correspondence associated to the dual pair of type (A ₁×C ₂ A ₁×A ₁) in D ₆ and show that these two pairs fit into a tower and the standard properties of a tower of theta correspondences hold.     

辽河冷家油田特稠油降粘剂LJVR-1及其性能评价

采用荧光法测定了辽河冷家油田冷47-556井特稠油乳化HLB值,然后以混合型表面活性剂、非离子型表面活性剂为主剂,快速渗透剂为辅剂按一定比例制备了水基降粘剂LJVR-1.实验结果表明,该降粘剂具有良好的乳化降粘性能,开采后易于破乳脱水,是一种较为理想的特稠油降粘剂.     

Banach空间中二阶积分-微分方程的初值问题

使用锥理论及单调迭代技术，首先讨论了Banach空间中一阶积分-微分方程初值问题的最小最大解的存在性，并在此基础上讨论了带有一阶微分项的二阶积分-微分方程初值问题的最小最大解的存在性。     

The Ring of Invariants of Three (3 × 3)-Matrices over a Field of Prime Characteristic

We find a minimal system of generators and a homogeneous system of parameters for the algebra of invariants of three matrices of third order over a field of an arbitrary characteristic.     

A new method for the reduction of nitronyl nitroxides

Reduction of nitronyl nitroxides using hexamethylenetetramine is a very convenient method for preparing the corresponding imino nitroxides and 2-imidazoline N-oxides.     

A minimal pair joining to a plus cupping Turing degree

A computably enumerable (c.e.) degree a is called nonbounding, if it bounds no minimal pair, and plus cupping, if every nonzero c.e. degree x below a is cuppable. Let NB and PC be the sets of all nonbounding and plus cupping c.e. degrees, respectively. Both NB and PC are well understood, but it has not been possible so far to distinguish between the two classes. In the present paper, we investigate the relationship between the classes NB and PC , and show that there exists a minimal pair which join to a plus cupping degree, so that PC ? NB . This gives a first known difference between NB and PC . (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

一类非线性积分,微分方程的逼近解

在不主紧型条件和耗散型条件的情形下，得到了Ｂａｎａｃｈ空间中一类非线性积分，微分方程的逼近解。     

Locally minimal uniformly oriented shortest networks

The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222].