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

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

二阶非线性中立型时滞差分方程的正解

本文研究了一类二阶非线性中立型时滞差分方程的正解,得到了最终正解的存在性判据及存在正解的必要条件,建立了一些正解不存在性定理,所得结论推广并改进了已知的一些结果。     

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

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

一类具正负系数中立型方程的正解

研究一类具有正负系数的中立型微分方程,得到了这类方程存在正解的充分条件和存在有界正解的充要条件,并据此给出了其存在无界正解的充分条件。     

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

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

全空间上一类非齐次椭圆方程正解的衰减

本文研究了非齐次椭圆方程不同衰减正解的存在性和衰减问题.利用上下解方法,得到了两个有着不同衰减的正解的存在性,推广了文献[2]中非齐次方程正解的存在性.     

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

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

带有积分边界条件的非线性四阶奇异微分方程组的正解

通过构造一个特殊的锥,并在锥上应用不动点定理,得到了具有积分边界条件的四阶奇异微分方程组单个正解、多个正解的存在性和方程组正解的不存在性.     

一类四阶差分方程多点边值问题的正解

为解决多点支撑弹性梁的正解的存在性问题,运用锥上不动点指数理论,研究一类含参四阶差分方程多点边值问题.获得了当参数在一定范围内取值时正解的存在性结果,得到了正解存在的充分条件.     

边界条件带导数的积分边值问题的正解

研究如下二阶积分边值问题的正解:■其中f∈C([0,1]×R~+,R~+).在先验估计的基础上,利用不动点指数理论建立了正解的存在性和多重正解的存在性.     

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.     

Staircase Parameterization in Dynamical Selection

This paper deals with a variant of a dynamical selection scheme introduced by Attouch and Cominetti for ill-posed convex minimization which combines approximation with the steepest descent method by mean of a suitable parameterization of the approximation parameter as a function of the time. This variant applies to a general inclusion with a maximal monotone operator by mean of a staircase parameterization. A discrete analogue is also considered. Applications to selecting a particular zero of a maximal monotone operator or a particular fixed point of a nonexpansive mapping via regularization techniques are presented. Finally, the alternative use of well-posedness by perturbations is discussed.     

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.

     

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.     

A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints

In this paper a barrier function method is proposed for approximating a solution of the nonconvex quadratic programming problem with box constraints. The method attempts to produce a solution of good quality by following a path as the barrier parameter decreases from a sufficiently large positive number. For a given value of the barrier parameter, the method searches for a minimum point of the barrier function in a descent direction, which has a desired property that the box constraints are always satisfied automatically if the step length is a number between zero and one. When all the diagonal entries of the objective function are negative, the method converges to at least a local minimum point of the problem if it yields a local minimum point of the barrier function for a sequence of decreasing values of the barrier parameter with zero limit. Numerical results show that the method always generates a global or near global minimum point as the barrier parameter decreases at a sufficiently slow pace.     

Genus fields of Kummer extensions of rational function fields

In this paper we obtain the genus field of a general Kummer extension of a global rational function field. We study first the case of a general Kummer extension of degree a power of a prime. Then we prove that the genus field of a composite of two abelian extensions of a global rational function field with relatively prime degrees is equal to the composite of their respective genus fields. Our main result, the genus of a general Kummer extension of a global rational function field, is a direct consequence of this fact.     

Box-Rectangular Drawings of Plane Graphs

In this paper we introduce a new drawing style of a plane graph G called a box-rectangular drawing. It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, and the contour of each face is drawn as a rectangle. We establish a necessary and sufficient condition for the existence of a box-rectangular drawing of G. We also give a linear-time algorithm to find a box-rectangular drawing of G if it exists.     

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.     

On a Mathematical Comparison between Hierarchy and Network with a Classification of Coordination Structures

This paper proposes a mathematical model to compare a network organization with a hierarchical organization. In order to formulate the model, we define a three-dimensional framework of the coordination structure of a network and of other typical coordination structures. In the framework, we can define a network structure by contrasting it with a hierarchy, in terms of the distribution of decision making, which is one of the main features of information processing. Based on this definition, we have developed a mathematical model for evaluating coordination structures. Using this model, we can derive two boundary conditions among the coordination structures with respect to the optimal coordination structure. The boundary conditions help us to understand why an organization changes its coordination structure from a hierarchy to a network and what factors cause this change. They enable us, for example, to find points of structural change where the optimal coordination structure shifts from a hierarchy to a hierarchy with delegation or from a hierarchy with delegation to a network, when the nature of the task changes from routine to non-routine. In conclusion, our framework and model may provide a basis for discussing the processes that occur when coordination structures change between a hierarchy and a network.