线性方程组的正解

讨论了线性方程组正解的若干性质,给出了线性方程组有正解的一个充要条件,以及由此得到的求正解的一般方法,还介绍了正解问题的若干应用.     

一类奇异次线性边值问题正解存在的充分必要条件

本文研究一类奇异次线性边值问题正解的存在性，得到Ｃ［０，１］正解和Ｃ１［０，１］正解存在的充分必要条件，也得到正解的唯一性．     

非齐次线性方程组的半正解

线性方程组的不带负分量的非零解向量称为半正解.本文给出非齐次线性方程组AX= b (b≠0)的半正解结构,进而得到该类线性方程组有半正解的充分条件和必要条件以及唯一半正解的充要条件.     

算子方程AX-XA*=B的正解与实正解

利用算子矩阵分块技巧和算子的广义逆,在A是幂等算子的情况下,给出了算子方程AX-XA＊=B有正解和有实正解的充要条件,并给出了正解和实正解的通式。     

一类边界条件中带有扰动参数的积分边值问题正解的存在性

本文研究边界条件中带有扰动参数的积分边值问题正解的存在性与不存在性及扰动参数对正解存在性的影响.利用不动点指数理论,得出边值问题至少有一个正解、两个正解以及无解的充分条件.     

一类中立型时滞差分方程的正解

研究一类中立型时滞差分方程面　　　　的正解,获得了方程存在最终正解以及非增正解的充要条件,建立了比较定理．     

二阶常微分方程组积分边值问题的正解

在借助于非负矩阵获得正解的先验估计的基础上,用不动点指数理论研究二阶非线性常微分方程组积分边值问题正解和多重正解的存在性.     

一类四阶两点边值问题正解的存在性

本文应用锥上的不动点指数理论,研究四阶两点边值问题—个正解及多个正解的存在性,给出了此类问题有一个正解及多个正解存在的与其相应线性问题的第一个特征值有关的充分条件,该条件中所涉及的值是最优的.     

半线性椭圆方程正解的存在性和唯一性

本文致力于研究半线性椭圆方程正解的存在性,唯一性和非退化性;给出了保证我们所考虑的问题存在正解的一个充要条件;证明了如果某类半线性椭圆问题的正解是唯一的和非退化的,则对问题中的微分算子做小扰动后其正解也是唯一的和非退化的．作为推论,证明了正解的唯一性在区域的小扰动下是不变的．     

非齐次线性方程组的半正解

线性方程组的不带负分量的非零解向量称为半正解本给出非齐次线性方程组Ax=B (B≠0)的半正解结构,进而得到该类线性方程组有半正解的充分条件和必要条件以及唯一半正解的充要条件。     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

An algorithm for constructing star-shaped drawings of plane graphs

A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304–320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43–69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing.In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing.     

On arithmetic Macaulayfication of Noetherian rings

The Rees algebra is the homogeneous coordinate ring of a blowing-up. The present paper gives a necessary and sufficient condition for a Noetherian local ring to have a Cohen-Macaulay Rees algebra: A Noetherian local ring has a Cohen-Macaulay Rees algebra if and only if it is unmixed and all the formal fibers of it are Cohen-Macaulay. As a consequence of it, we characterize a homomorphic image of a Cohen-Macaulay local ring. For non-local rings, this paper gives only a sufficient condition. By using it, however, we obtain the affirmative answer to Sharp's conjecture. That is, a Noetherian ring having a dualizing complex is a homomorphic image of a finite-dimensional Gorenstein ring.

     

Slice theorem and orbit type stratification in infinite dimensions

We establish a general slice theorem for the action of a locally convex Lie group on a locally convex manifold, which generalizes the classical slice theorem of Palais to infinite dimensions. We discuss two important settings under which the assumptions of this theorem are fulfilled. First, using Glöckner's inverse function theorem, we show that the linear action of a compact Lie group on a Fréchet space admits a slice. Second, using the Nash–Moser theorem, we establish a slice theorem for the tame action of a tame Fréchet Lie group on a tame Fréchet manifold. For this purpose, we develop the concept of a graded Riemannian metric, which allows the construction of a path-length metric compatible with the manifold topology and of a local addition. Finally, generalizing a classical result in finite dimensions, we prove that the existence of a slice implies that the decomposition of the manifold into orbit types of the group action is a stratification.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

λ-重K_(1,4)-设计到λ-重K_(1,3)-最大填充的变形

令(X,B)为一个u阶的λ-重K_(1,4)-设计.对于每一个区组B=(a:b,c,d,e)∈B,若删去边{a,e},则得到一个K_(1,3)[a:b,c,d].令C为删去B中每一个区组的边{a,e}而得到的K_(1,4)的集合,F为被删去的边构成的集合.若F可以被重组成[λv(v-1)/24]个K_(1,3)的集合D,则(X,CUD)为一个v阶λ-重K_(1,3)-最大填充.称(X,C∪D)为λ-重K_(1,4-)设计(X,B)的变形.本文证明了v阶λ-重K_(1,4)-设计到u阶λ-重K_(1,3)-最大填充的变形存在的充要条件是λv(v-1)≡0(mod 8)且v≥5.     

Global efficiency in multiobjective programming *

In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed     

Two-Dimensional Regular Shock Reflection for the Pressure Gradient System of Conservation Laws

We establish the existence of a global solution to a regular reflection of a shock hitting a ramp for the pressure gradient system of equations. The set-up of the reflection is the same as that of Mach＇s experiment for the compressible Euler system, i.e., a straight shock hitting a ramp. We assume that the angle of the ramp is close to 90 degrees. The solution has a reflected bow shock wave, called the diffraction of the planar shock at the compressive corner, which is mathematically regarded as a free boundary in the self-similar variable plane. The pressure gradient system of three equations is a subsystem, and an approximation, of the full Euler system, and we offer a couple of derivations.     

覆盖数不超过3的图上渡河问题

1000多年前,英国著名学者Alcuin曾提出一个古老的渡河问题,即狼、羊和卷心菜的渡河问题。2006年,Prisner把该问题推广到任意的冲突图上,考虑了一类情况更一般的渡河运输问题。所谓冲突图是指一个图G=(V,E),这里V代表某些物品的集合,V中的两个点有边连结当且仅当这两个点是冲突的,即在无人监管的情况下不允许留在一起的点。图G=(V,E)的一个可行运输方案是指在保证不发生任何冲突的前提下,把V的点所代表的物品全部摆渡到河对岸的一个运输方案。图G的Alcuin数定义为它存在可行运输方案时所需船的最小容量。本文讨论了覆盖数不超过3的连通图的Alcuin数,给出了该类图Alcuin数的完全刻画。