线性方程组的正解

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.     

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.     

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.     

Induction of Geometric Actions

We prove that, in some situations, an induced action from a normal subgroup preserves a geometric structure. Combined with known geometric rigidity results, this result implies certain rigidity statements concerning the full diffeomorphism group of a manifold. It also provides many examples of actions on Lorentz manifolds. Combining these with a small number of well-known actions, we get the full list of connected, simply connected Lie groups admitting a locally faithful, orbit nonproper action by isometries of a connected Lorentz manifold. We give an example of a connected nilpotent Lie group with no complicated action on a Lorentz manifold. We show that, if a connected Lie group has a normal closed subgroup isomorphic to a (two-dimensional) cylinder, then it admits a locally faithful, orbit nonproper action by isometries of a connected Lorentz manifold.     

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.     

A Decomposition of Markov Processes via Group Actions

We study a decomposition of a general Markov process in a manifold invariant under a Lie group action into a radial part (transversal to orbits) and an angular part (along an orbit). We show that given a radial path, the conditioned angular part is a nonhomogeneous Lévy process in a homogeneous space, we obtain a representation of such processes and, as a consequence, we extend the well-known skew-product of Euclidean Brownian motion to a general setting.      

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.

     

The Exit Problem from a Neighborhood of the Global Attractor for Dynamical Systems Perturbed by Heavy-Tailed Lévy Processes

The concept of filtered counting process is used to model several stochastic problems in manufacturing systems. Through a judicious selection of an appropriate response function, several system characteristics are evaluated under distribution-free condition. Applications include a machine shop problem, a machine sequencing problem, a flexible manufacturing problem, a job sequencing problem, a maintenance problem and an inventory problem. The methodology provides a unique, original and simple way to solve a large array of problems     

Entropy solutions to a strongly degenerate anisotropic convection-diffusion equation with application to utility theory

We study the deterministic counterpart of a backward-forward stochastic differential utility, which has recently been characterized as the solution to the Cauchy problem related to a PDE of degenerate parabolic type with a conservative first order term. We first establish a local existence result for strong solutions and a continuation principle, and we produce a counterexample showing that, in general, strong solutions fail to be globally smooth. Afterward, we deal with discontinuous entropy solutions, and obtain the global well posedness of the Cauchy problem in this class. Eventually, we select a sufficient condition of geometric type which guarantees the continuity of entropy solutions for special initial data. As a byproduct, we establish the existence of an utility process which is a solution to a backward-forward stochastic differential equation, for a given class of final utilities, which is relevant for financial applications.