WM PROPERTY OF ORLICZ SPACES WITH ORLICZ NORM

ＷＭＰＲＯＰＥＲＴＹＯＦＯＲＬＩＣＺＳＰＡＣＥＳＷＩＴＨＯＲＬＩＣＺＮＯＲＭＣｈｅｎＳｈｕｔａｏ（陈述涛）（Ｄｅｐｔ．ｏｆＭａｔｈ．，ＨａｒｂｉｎＮｏｒｍ．Ｕｎｉ．，Ｈａｒｂｉｎ１５００８０，Ｃｈｉｎａ）ＤｕａｎＹａｎｚｈｅｎｇ（段延正）（Ｄｅｐ．ｏ...     

几类不具有捏制轨道系列完整性的单峰函数族

本文证明，存在着由单峰函数构成的Ｃｏ－函数族｛ｆλ），｛ｇλ｝及具有下列性质：（ｉ）各ｆλ均是分段线性的单峰平顶函数，各ｇλ及均是Ｃ∞－单峰平顶函数．但族｛ｆλ｝，｛ｇλ｝及均非一致平顶；（ｉｉ）族｛ｆλ｝及｛ｇλ｝均满足一致的Ｌｉｐｓｃｈｉｔｚ条件，但在峰顶处均非一致地可微；（ｉｉｉ）族在峰顶处一致地可微，但不满足一致的Ｌｉｐｓｃｈｉｔｚ条件；（ｉｖ）当０≤λ≤７／８时捏制序列Ｋ（ｆλ），Ｋ（ｇλ）及以均不大于ＲＬＣ，当７／８＜λ－≤１时Ｋ（ｆλ），Ｋ（ｇλ）及Ｋ均不小于ＲＬＬ（ＲＬＲ）∞，因而族｛ｆλ｝，｛ｇλ｝及均不具有捏制轨道系列的完整性．本文的结果解答了文［５］中提出的两个猜测．     

第39届IMO-5的简证

题目　设Ｉ为△ＡＢＣ的内心,Ｋ、Ｌ、Ｍ分别为△ＡＢＣ的内切圆在ＢＣ、ＣＡ、ＡＢ上的切点,已知通过点Ｂ与ＭＫ平行的直线分别与直线ＬＭ及ＬＫ交于Ｒ、Ｓ两点,求证∠ＲＩＳ为锐角．证明　记△ＡＢＣ的内切圆半径为ｒ,∵　ＲＳ∥ＭＫ且△ＭＫＬ为切点三角形,故　∠ＲＳＫ＝∠ＭＫＬ＝∠ＬＭＡ,∴　Ｓ、Ｌ、Ｍ、Ｂ四点共圆．故　ＲＢ·ＲＳ＝ＲＭ·ＲＬ．但Ｒ是圆Ｉ外一点,ＲＭ·ＲＬ＝ＲＩ２－ｒ２,∴　　ＲＢ·ＲＳ＝ＲＩ２－ｒ２（１）同理可知　ＳＢ·ＳＲ＝ＳＩ２－ｒ２（２）由（１）、（２）有ＲＩ２＋ＳＩ２－２ｒ２＝ＲＳ…     

ON INCLUSION RELATIONS BETWEEN BERS-ORLICZ SPACES

ＯＮＩＮＣＬＵＳＩＯＮＲＥＬＡＴＩＯＮＳＢＥＴＷＥＥＮＢＥＲＳ－ＯＲＬＩＣＺＳＰＡＣＥＳＺｈａｏＲｕｈａｎ（赵如汉）（Ｉｎｓｔ．ｏｆＭａｔｈ．Ｓａｃ．，ＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｄ，Ｗｕｈａｎ４３００７１，Ｃｈｉｎａ）Ａｂｓｔｒａ...     

关于poe—半群的双理想

推广正则半群中的双理想到ｐｏ－半群之中，利用ｐｏ－半群中的双理想研究了正则ｐｏｅ－半群、内正则ｐｏｅ－半群。得到了如下主要结果：①Ｓ为正则ｄｕｏ的充要条件是：Ｂ（ａｂ）＝Ｂ（ａ）∩Ｂ（ｂ），Ａ↓ａ、ｂ∈Ｓ；②Ｓ正则ｄｕｏ的充要条件为Ｓ为Ｂ－单序半群的半格；③Ｓ内正则的充要条件为：Ｒ∩Ｂ∩Ｌ包含于（ＬＢＲ］；④Ｓ正则且内正则的充要条件为：Ｒ∩Ｂ∩Ｌ包含于（ＢＲＬ］。     

数学问题解答

数学问题解答１９９５年１０月号问题解答（解答由问题提供人给出）９７６己知。是锐角，则（１＋——）（１＋——）＞ｆ。证明，原不等式即为４．作ＲＬＡＡＢＣ，如图，使斜边上的高ＣＤ—１，且又ＡＢ上的中线大于或等于ＤＣ—１，于是ＡＢ三２，又由ＢＣ＋ＡＣ＞ＡＢ...     

用CROUZEIX－RAVIART元解非自共轭椭圆型问题的重叠型区域分解算法

用ＣＲＯＵＺＥＩＸ－ＲＡＶＩＡＲＴ元解非自共轭椭圆型问题的重叠型区域分解算法顾金生（北京航空航天大学动力系）胡显承（清华大学应用数学系）ＯＶＥＲＬＡＰＰＩＮＧＤＯＭＡＩＮＤＥＣＯＭＰＯＳＩＴＩＯＮＭＥＴＨＯＤＦＯＲＮＯＮＳＥＬＦＡＤＪＯＩＮＴＥＬＬＩ...     

用CROUZEIX－RAVIART元解非自共轭椭圆型问题的重叠型区域分解算法

用ＣＲＯＵＺＥＩＸ－ＲＡＶＩＡＲＴ元解非自共轭椭圆型问题的重叠型区域分解算法顾金生（北京航空航天大学动力系）胡显承（清华大学应用数学系）ＯＶＥＲＬＡＰＰＩＮＧＤＯＭＡＩＮＤＥＣＯＭＰＯＳＩＴＩＯＮＭＥＴＨＯＤＦＯＲＮＯＮＳＥＬＦＡＤＪＯＩＮＴＥＬＬＩ...     

强正则环的刻划

强正则环的刻划胡卫群（安徽省滁州师范专科学校）Ａｕｓｌａｎｄｅｒ在［３］中证明了：环Ａ是ＶｏｎＮｅｕｍａｎｎ正则的对于Ａ的任意左理想Ｌ与Ａ的任意右理想Ｒ，，总有ＲｎＬ＝ＲＬ．Ｒ．ＹｕｅＣｈｉＭｉｎｇ在［２］中推广了Ａｕｓｌａｎｄｅｒ［３］的结果，证明...     

DECOMPOSITION FOR BERS-ORLICZ SPACES

ＤＥＣＯＭＰＯＳＩＴＩＯＮＦＯＲＢＥＲＳ－ＯＲＬＩＣＺＳＰＡＣＥＳＺｈａｏＲｕｈａｎ（赵如汉）（ＷｕｈａｎＩｕｓｔ．ｏｆＭａｔｈ．Ｓｃｉ．，ＡｃａｄｒｍｉａＳｉｎｄａ．，Ｗｕｈａｎ４３００７１，Ｃｈｉｎａ．）ＤＥＣＯＭＰＯＳＩＴＩＯＮＦＯＲＢＥＲＳ－...     

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.     

A New Pareto Optimal Solution in a Lagrange Decomposable Multi-Objective Optimization Problem

In this paper a committee decision-making process of a convex Lagrange decomposable multi-objective optimization problem, which has been decomposed into various subproblems, is studied. Each member of the committee controls only one subproblem and attempts to select the optimal solution of this subproblem most desirable to him, under the assumption that all the constraints of the total problem are satisfied. This procedure leads to a new solution concept of a Lagrange decomposable multi-objective optimization problem, called a preferred equilibrium set. A preferred equilibrium point of a problem, for a committee, may or may not be a Pareto optimal point of this problem. In some cases, a non-Pareto optimal preferred equilibrium point of a problem, for a committee, can be considered as a special type of Pareto optimal point of this problem. This fact leads to a generalization of the Pareto optimality concept in a problem.     

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.     

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.     

Diads and their Application to Topoi

It is well known that the category of coalgebras for a finite-limit preserving comonad on a topos is again a topos, and the category of algebras for a finite-limit preserving monad is a topos if the monad is idempotent, but not in general. A generalisation of this result (Paré et al., Bull Aus Math Soc 39(3):421–431, 1989) is that the full subcategory of fixed points for any idempotent finite-limit preserving endofunctor is again a topos (and indeed a subquotient in the category of topoi and geometric morphisms). Here, we present a common generalisation of all the above results, based on a notion which we call a diad, which is a common generalisation of a monad and a comonad. Many of the constructions that can be applied to monads and comonads can be extended to all diads. In particular, the category of algebras or coalgebras can be generalised to a category of dialgebras for a diad. The generalisation we present here is that the category of dialgebras for a finite-limit preserving left diad (for example, the diad corresponding to a comonad, or any idempotent endofunctor) on a topos is again a topos.     

U-标算子的结构分析

类似与标型谱算子,U-标算子是否拟仿射相似于自伴算子是一“公开问题”．尽管对具纯离散谱的U-标算子答案是肯定的,但一般情况下并不成立．本文继续探讨这一问题,证明了U-标算子在一强范数拓扑意义下是Hermite算子,或者说U-标算子拟仿射相似于Hermite算子,并给出U-标算子是标型谱算子的充要条件．     

A Priori and A Posteriori: A Bootstrapping Relationship

The distinction between a priori and a posteriori knowledge has been the subject of an enormous amount of discussion, but the literature is biased against recognizing the intimate relationship between these forms of knowledge. For instance, it seems to be almost impossible to find a sample of pure a priori or a posteriori knowledge. In this paper, it will be suggested that distinguishing between a priori and a posteriori is more problematic than is often suggested, and that a priori and a posteriori resources are in fact used in parallel. We will define this relationship between a priori and a posteriori knowledge as the bootstrapping relationship. As we will see, this relationship gives us reasons to seek for an altogether novel definition of a priori and a posteriori knowledge. Specifically, we will have to analyse the relationship between a priori knowledge and a priori reasoning, and it will be suggested that the latter serves as a more promising starting point for the analysis of aprioricity. We will also analyse a number of examples from the natural sciences and consider the role of a priori reasoning in these examples. The focus of this paper is the analysis of the concepts of a priori and a posteriori knowledge rather than the epistemic domain of a posteriori and a priori justification.     

The weighted complexity and the determinant functions of graphs

The complexity of a graph can be obtained as a derivative of a variation of the zeta function [S. Northshield, A note on the zeta function of a graph, J. Combin. Theory Ser. B 74 (1998) 408-410] or a partial derivative of its generalized characteristic polynomial evaluated at a point [D. Kim, H.K. Kim, J. Lee, Generalized characteristic polynomials of graph bundles, Linear Algebra Appl. 429 (4) (2008) 688-697]. A similar result for the weighted complexity of weighted graphs was found using a determinant function [H. Mizuno, I. Sato, On the weighted complexity of a regular covering of a graph, J. Combin. Theory Ser. B 89 (2003) 17-26]. In this paper, we consider the determinant function of two variables and discover a condition that the weighted complexity of a weighted graph is a partial derivative of the determinant function evaluated at a point. Consequently, we simply obtain the previous results and disclose a new formula for the complexity from a variation of the Bartholdi zeta function. We also consider a new weighted complexity, for which the weights of spanning trees are taken as the sum of weights of edges in the tree, and find a similar formula for this new weighted complexity. As an application, we compute the weighted complexities of the product of the complete graphs.