矩不等式在证明不等式中的应用

本文给出了有关矩的一些不等式在证明不等式中的应用。方法独特，简捷。     

一些Pachpatte不等式的加强与反向形式

本文建立了一些新的加强和反向Pachpatte不等式.作为应用,推广和加强了一些新型Hilbert不等式.     

两个优美不等式的推广

本刊文[1]介绍了一组俄罗斯杂志《中学数学》刊登的不等式题，其中有下面的瓦西列夫不等式和彼得罗夫不等式：     

评匡继昌著《常用不等式》第三版

这篇评论指出了匡著第三版的五点特色,并在附记中概述了评价不等式的三个标准.     

某些新解析不等式和不等式常数改进的实际用处

本文建立一般不等式,推广了Hardy-Littlewood、Polya和Mitrinovic-Adamovic不等式,文中给出在抛射体(导弹)和火箭上的二个实际用处.Bellman说:“存在研究不等式的三个理由;实际的理论的和美学的.”我们构造抛射体(导弹)在真空中的弹着点(或水平射程)不等式.改进这不等式常数对战争的胜利有所帮助.在书[2][3]中证明了:     

一个代数不等式与一类几何不等式的指数推广

本文介绍一个代数不等式,应用它直接将一类常见的几何不等式进行指数推广．定理若ａ,ｂ,ｃ∈Ｒ＋,ｎ∈Ｎ且ｎ≥２,则ａｎ＋ｂｎ＋ｃｎ３≥（ａ＋ｂ＋ｃ３）ｎ（＊）当且仅当ａ＝ｂ＝ｃ时等号成立．证当ｎ＝２时,∵ａ２＋ｂ２＋ｃ２３－（ａ＋ｂ＋ｃ３）２＝（ａ－ｂ...     

关于两个新Hilbert积分不等式

利用分析的方法及不等式理论，推广了Pachpatte最新给出的两个新型Hilbert积分不等式，获得了几个新结果，改进了某些相关的结果。     

一个含参数根式不等式链

文[1]给出了如下含参数根式不等式： 定理1设ai∈R＋，i=1，2，…，n，且n∑i=1；=k，λ〉0，μ≥0。     

单形内任一点的一个含参不等式

本文证明了与ｎ维单形内部任意一点有关的一个含参数不等式,并应用它得到了几个与ｎ维单形体积有关的不等式。     

新优化的Hilbert积分不等式

推广、改进并给出了某些新的重要Hilbert积发不等式。     

二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

Characterizations of g-frames and g-Riesz bases in Hilbert spaces

In this paper, we introduce the pre-frame operator Q for the g-frame in a complex Hilbert space, which will play a key role in studying g-frames and g-Riesz bases etc. Using the pre-frame operator Q, we give some necessary and sufficient conditions for a g-Bessel sequence, a g-frame, and a g-Riesz basis in a complex Hilbert space, which have properties similar to those of the Bessel sequence, frame, and Riesz basis respectively. We also obtain the relation between a g-frame and a g-Riesz basis, and the relation of bounds between a g-frame and a g-Riesz basis. Lastly, we consider the stability of a g-frame or a g-Riesz basis for a Hilbert space under perturbation.     

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.     

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.

     

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.     

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.     

管状曲面在曲线论中的应用

研究了围绕曲线的管状曲面上的曲率线,渐近线与测地线,给出它们的方程,揭示了这些曲线与Bertrand曲线或Mannheim曲线之间的关系,采用新的方法给出一条曲线是Bertrand曲线或Mannheim曲线的充要条件的另一种证明以及Mannheim侣线的曲率与挠率之间的关系．     

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     

Toader型平均与几种经典平均的确界

给出了最佳参数α_1,α_2,α_3,β_1,β_2,β_3∈R,使得双向不等式α_1Q(a,b)+(1-α_1)G(a,b)0且a≠b成立.其中A(a,b)=(a+b)/2,H(a,b)=2ab/(a+b),G(a,b)=(ab)~(1/2),Q(a,b)=((a~2+b~2)/2)~(1/2),C(a,b)=(a~2+b~2)/(a+b),T(a,b)=2/π∫_0~(π/2)(a~2cos~2t+b~2sin~2)~(1/2)tdt分别是两个正数a和b的算术平均,调和平均,几何平均,二次平均,反调和平均和Toader平均.     

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.