Density of the set of positive proper minimal points in the set of minimal points

One of the important problems of vector optimization concerns the density of the set of positive proper minimal points in the set of minimal points. We use the concepts of dentable point and approximating cones to derive sufficient conditions guaranteeing that the set of minimal points is contained in the closure of the set of positive proper minimal points. The result can be applied to obtain a density result for the unit ball in 1 ^p , 1<p<+, which does not follow from any other well-known density theorem.The author would like to thank Professor W. T. Fu for helpful comments. Moreover, the author is grateful to Professor H. P. Benson and the referees for valuable remarks and suggestions concerning a previous draft of this paper.     

正态分布在学生学习成绩评估中的应用

本文将正态分布应用于学生学习成绩评估中，将原始分数转换为标准分数后，各科的分数方可比较或相加，从而改变了将原始分数直接相加比较的那种不够科学也不甚合理的传统做法。     

Comparison of Existence Results for Efficient Points

Existence results of maximal points with respect to general binary relations were stated by Hazen and Morin (Ref. 1) and by Gajek and Zagrodny (Ref. 2). In this paper, we point out that the natural framework for this problem is that of transitive and reflexive relations (preorders). The aim of this paper is to discuss existence results for maximal points with respect to general transitive relations in such a way that, when considering them for preorders defined by convex cones, we are able to recover most known existence results for efficient points; the quasi-totality of them, with their (short) proofs, is presented, too.     

The fractal structures of the exceptional sets of Lévy processes

In this paper we review some results on the fractal geometry properties of the sets of thick points, thin points, fast points and slow points derived from Lévy processes. This work was supported by National Natural Science Foundation of China (Grant No. 10871200)     

Weierstrass points on cyclic covers of the projective line

We are interested in cyclic covers of the projective line which are totally ramified at all of their branch points. We begin with curves given by an equation of the form , where is a polynomial of degree . Under a mild hypothesis, it is easy to see that all of the branch points must be Weierstrass points. Our main problem is to find the total Weierstrass weight of these points, . We obtain a lower bound for , which we show is exact if and are relatively prime. As a fraction of the total Weierstrass weight of all points on the curve, we get the following particularly nice asymptotic formula (as well as an interesting exact formula):

where is the genus of the curve. In the case that (cyclic trigonal curves), we are able to show in most cases that for sufficiently large primes , the branch points and the non-branch Weierstrass points remain distinct modulo .

     

Some Geometrical Aspects of Efficient Points in Vector Optimization

We study efficient point sets in terms of extreme points, positive support points and strongly positive exposed points. In the case when the ordering cone has a bounded base, we prove that the efficient point set of a weakly compact convex set is contained in the closed convex hull of its strongly positive exposed points, thereby extending the Phelps theorem. We study also the density of positive proper efficient point sets. This research was supported by a Central Research Grant of Hong Kong Polytechnic University, Grant G-T 507. Research of the first author was also supported by the National Natural Science Foundation of P.R. China, Grant 10361008, and the Natural Science Foundation of Yunnan Province, China, Grant 2003A002M. Research of the second author was also supported by the Natural Science Foundation of Chongqing. Research of the third author was supported by a research grant from Australian Research Counsil.     

The probability of choosing primitive sets

We generalize a theorem of Nymann that the density of points in Zd that are visible from the origin is 1/ζ(d), where ζ(a) is the Riemann zeta function . A subset S⊂Zd is called primitive if it is a Z-basis for the lattice Zd∩spanR(S), or, equivalently, if S can be completed to a Z-basis of Zd. We prove that if m points in Zd are chosen uniformly and independently at random from a large box, then as the size of the box goes to infinity, the probability that the points form a primitive set approaches 1/(ζ(d)ζ(d−1)?ζ(d−m+1)).     

Global Optimization: Local Minima and Transition Points

We consider the minimization of smooth functions of the Euclidean space with a finite number of stationary points having moderate asymptotic behavior at infinity. The crucial role of transition points of first order (i.e., saddle points of index 1) is emphasized. It is shown that (generically) any two local minima can be connected via an alternating sequence of local minima and transition points of first order. In particular, the graph with local minima as its nodes and first order transition points representing the edges turns out to be connected (Theorem A). On the other hand, any connected (finite) graph can be realized in the above sense by means of a smooth function of three variables having a minimal number of stationary points (Theorem B).     

On the compactly locally uniformly rotund points of Orlicz spaces

In this paper, locally uniformly rotund points and compactly locally uniformly rotund points are introduced. Moreover, criteria for compactly locally uniformly rotund points in Orlicz spaces are given.     

Saddle Points and Pareto Points in Multiple Objective Programming

In this paper relationships between Pareto points and saddle points are studied in convex and nonconvex multiple objective programming. The analysis is based on partitioning the index sets of objectives and constraints and splitting the original problem into subproblems having a special structure. The results are based on scalarizations of multiple objective programs and related linear and augmented Lagrangian functions. In the nonconvex case, a saddle point characterization of Pareto points is possible under assumptions that guarantee existence of Pareto points and stability conditions of single objective problems. Essentially, these conditions are not stronger than those in analogous results for single objective programming.This research was partially supported by ONR Grant N00014-97-1-784AMS Subject Classification: 90C29, 90C26     

Construction of caps by means of caps in complementary subspaces

A construction of caps is given which yields in particular caps with a free pair of points. Applying this construction, we meet the bound of Farr and Lisoněk [J. Farr, P. Lisoněk, Caps with free pairs of points, J. Geom. 85 (2006) 35-41] for caps with a free pair of points in , q even.     

On the location of fixed points on pairs of spaces

Let f: (X, A)→(X, A) be an admissible selfmap of a pair of metrizable ANR's. A Nielsen number of the complement Ñ(f; X, A) and a Nielsen number of the boundary ñ(f; X, A) are defined. Ñ(f; X, A) is a lower bound for the number of fixed points on C1(X - A) for all maps in the homotopy class of f. It is usually possible to homotope f to a map which is fixed point free on Bd A, but maps in the homotopy class of f which have a minimal fixed point set on X must have at least ñ(f; X, A) fixed points on Bd A. It is shown that for many pairs of compact polyhedra these lower bounds are the best possible ones, as there exists a map homotopic to f with a minimal fixed point set on X which has exactly Ñ(f; X - A) fixed points on C1(X−A) and ñ(f; X, A) fixed points on Bd A. These results, which make the location of fixed points on pairs of spaces more precise, sharpen previous ones which show that the relative Nielsen number N(f; X, A) is the minimum number of fixed points on all of X for selfmaps of (X, A), as well as results which use Lefschetz fixed point theory to find sufficient conditions for the existence of one fixed point on C1(X−A).     

Remarks on the descriptive metric characterization of singular sets of analytic functions

This work presents two remarks on the structure of singular boundary sets of functions analytic in the unit diskD: |z|<1. The first remark concerns the conversion of the Plessner theorem. We prove that three pairwise disjoint subsetsE ₁,E ₂, andE ₃ of the unit circle Γ: |z|=1, = Γ, are the setsI(ƒ) of all Plessner points,F(ƒ) of all Fatou points, andE(ƒ) of all exceptional boundary points, respectively, for a function ƒ holomorphic inD if and only ifE ₁ is aG _δ-set andE ₃ is a -set of linear measure zero. In the second part of the paper it is shown that for any -subsetE of the unit circle Γ with a zero logarithmic capacity there exists a one-sheeted function onD whose angular limits do not exist at the points ofE and do exist at all the other points of Γ. Translated fromMatematicheskie Zametki, Vol. 63, No. 1, pp. 56–61, January, 1998.     

拓扑空间中集网收敛性的非标准刻画

在非标准扩大模型下,给出了拓扑空间中集网收敛性的非标准刻画.首先,由非标准扩大模型的充要条件,证明了拓扑空间中集网的极限点和聚点的非标准刻画;然后,利用这些非标准特征,刻画了拓扑空间中集列、网和点列的极限点和聚点;最后,以自然的方式讨论了拓扑空间中集网上极限和下极限的一些重要性质.     

Fixed points of involutive interval-valued negations

Different from involutive negations on [0, 1], the fixed points of an involutive interval-valued negation are uncountable. In this paper, all the fixed points of an involutive interval-valued negation are characterized. Also, it is proved that an involutive interval-valued negation is uniquely determined by its fixed points. Moreover, a constructive representation of involutive interval-valued negations is obtained.     

Global optimality of extremals: An example

The question of the existence and the location of Darboux points (beyond which global optimality is lost) is crucial for minimal sufficient conditions for global optimality and for computation of optimal trajectories. Here, we investigate numerically the Darboux points and their relationship with conjugate points for a problem of minimum fuel, constant velocity, horizontal aircraft turns to capture a line. This simple second-order optimal control problem shows that ignoring the possible existence of Darboux points may play havoc with the computation of optimal trajectories.The authors are indebted to G. Moyer for his constructive comments. This research was supported, for the first author, by a National Research Council Associateship at NASA Ames Research Center.on leave from the Technion, Israel Institute of Technology, Haifa, Israel.     

多目标规划的ak—较多有效点与ak—较多最优点

在[1]中,作引入了多目标规划的较多有效点及较多最优点的概念,并讨论了它们的性质,本首次提出了ak-较多有效点与ak-较多最优点的概念,并讨论了ak-较多有效点,ak-较多最优点、ak-较多有效解,ak-较多最优解的相关性质。     

区间映射的链回归点的可链点集

主要讨论区间映射的链回归点的可链点集与链等价集的关系,证明了:若区间映射的拓扑熵是零,则它的链回归点的可链点集与链等价集相等.此外还得到了区间映射有正拓扑熵的几个等价条件.     

Existence theorems for cone saddle points of vector-valued functions in infinite-dimensional spaces

For vector-valued functions, cone saddle points are defined, and some existence theorems for them are established in infinite-dimensional spaces. Most of our results rely on Condition 2.1, which has been given by Sterna-Karwat. In particular, it shows that the scalarization of vector-valued functions plays an important role for the condition. Some interesting examples in infinite-dimensional spaces are presented. Moreover, necessary conditions for the existence of cone saddle points are investigated.The author would like to thank the referees for their valuable suggestions on the original draft.     

On the absence of cycles for unimodal mappings of the square

Unimodal 2-endomorphisms of a special kind of the unit square are considered. Conditions for the absence of periodic points are presented. Translated fromMatematicheskie Zametki, Vol. 63, No. 3, pp. 370–378, March, 1998.