每个点都是链回归点的树映射

设f是端点数为n的树T上的连续自映射且T上的每一点都是f的链回归点.本文证明了: (1)如果T的某个端点是f的不动点,那么,T上的每个点都是f的周期为r≤n-1的周期点,或存在自然数r ≤ n-1,使得fr含有湍流; (2)如果f的不动点都在T的内部,那么,T上的每个点都是f的周期为r≤n的周期点,或存在自然数r≤n,使得,fr含有湍流.     

点集Bézier曲线

提出了点集Bézier曲线的概念,给出了点集Bézier曲线的性质及细分算法.按照点集算术的定义,当点集是长方形闭域或圆盘时,点集Bézier曲线就是区间Bézier曲线或圆盘Bézier曲线,因此,点集Bézier曲线是对区间Bézier曲线和圆盘Bézier曲线的推广.     

Fundamental results for pointfree convex geometry

Inspired by locale theory, we propose “pointfree convex geometry”. We introduce the notion of convexity algebra as a pointfree convexity space. There are two notions of a point for convexity algebra: one is a chain-prime meet-complete filter and the other is a maximal meet-complete filter. In this paper we show the following: (1) the former notion of a point induces a dual equivalence between the category of “spatial” convexity algebras and the category of “sober” convexity spaces as well as a dual adjunction between the category of convexity algebras and the category of convexity spaces; (2) the latter notion of point induces a dual equivalence between the category of “m-spatial” convexity algebras and the category of “m-sober” convexity spaces. We finally argue that the former notion of a point is more useful than the latter one from a category theoretic point of view and that the former notion of a point actually represents a polytope (or generic point) and the latter notion of a point properly represents a point. We also remark on the close relationships between pointfree convex geometry and domain theory.     

Distortion and stability of the fixed point property for non-expansive mappings

Let X be a Banach space. We say that X satisfies the fixed point property (weak fixed point property) if every non-expansive mapping defined from a convex closed bounded (convex weakly compact) subset of X into itself has a fixed point. We say that X satisfies the stable fixed point property (stable weak fixed point property) if the same is true for every equivalent norm which is close enough to the original one. Denote by P(X) the set formed by all equivalent norms with the topology of the uniform convergence on the unit ball of X. We prove that the subset of P(X) formed by the norms failing the fixed point property is dense in P(X) when X is a non-distortable space which fails the fixed point property. In particular, no renorming of ?₁ can satisfy the stable fixed point property. Furthermore, we show some examples of distortable spaces failing the weak fixed point property, which can be renormed to satisfy the stable weak fixed point property. As a consequence we prove that every separable Banach space can be renormed to satisfy the stable weak fixed point property.     

单位圆内拟亚纯映射的Nevanlinna点

该文定义了单位圆内拟亚纯映射的Nevanlinna点与Borel点，并证明了单位圆内满足条件~lim_{r→1}{T(r)/{log1/(1-r)}}=∞的拟亚纯映射的Nevanlinna点与Borel点的存在性。     

AnN-person noncooperative discounted vector-valued dynamic game with a metric space

AnN-person noncooperative discounted vector-valued game with a metric space is investigated. We define aD-convex equilibrium point and prove that aD-convex equilibrium point exists in this game system. A modified version of the original game system is formulated so that an equilibrium point of the modified version is aD-convex equilibrium point of the original game system. Under appropriate conditions, the converse holds in the sense that aD-convex equilibrium point is also an equilibrium point of the modified game system.     

A variational inequality formulation for unconfined seepage problems in porous media

In the existing variational inequality formulations for the unconfined seepage problem in porous media, the seepage point, namely the exit point of the free surface, is a singular point and how to locate the seepage point exactly has been an open issue. By generalizing Darcy’s law applied solely to the saturated zone in an earth dam to the entire dam including the no-flow zone, a new variational inequality formulation is presented. The new formulation imposes a boundary condition of Signorini’s type on the potential seepage boundary and the seepage point turns out to be such a point that makes both inequalities in Signorini’s complementary condition become equalities. Singularity of the seepage point is accordingly eliminated. A strategy is developed for overcoming the mesh-dependency in the finite element implementation.     

A fixed point theorem for the infinite-dimensional simplex

We define the infinite-dimensional simplex to be the closure of the convex hull of the standard basis vectors in R^∞, and prove that this space has the fixed point property: any continuous function from the space into itself has a fixed point. Our proof is constructive, in the sense that it can be used to find an approximate fixed point; the proof relies on elementary analysis and Sperner's lemma. The fixed point theorem is shown to imply Schauder's fixed point theorem on infinite-dimensional compact convex subsets of normed spaces.     

Strengthened fixed point property and products in ordered sets

Strengthened fixed point property for ordered sets is formulated. It is weaker than the strong fixed point property due to Duffus and Sauer and stronger than the product property meaning that A × Y has the fixed point property whenever A has the former and Y has the latter. In particular, doubly chain complete ordered sets with no infinite antichain have the strengthened fixed point property whenever they have the fixed point property, which yields a transparent proof of the well-known theorem saying that doubly chain complete ordered sets with no infinite antichain have the product property whenever they have the fixed point property. The new proof does not require the axiom of choice. Presented at the Summer School on General Algebra and Ordered Sets, Malá Morávka, 4–10 September 2005.     

Maximal integral point sets in affine planes over finite fields

Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane over a finite field F_q, where the formally defined squared Euclidean distance of every pair of points is a square in F_q. It turns out that integral point sets over F_q can also be characterized as affine point sets determining certain prescribed directions, which gives a relation to the work of Blokhuis. Furthermore, in one important sub-case, integral point sets can be restated as cliques in Paley graphs of square order.In this article we give new results on the automorphisms of integral point sets and classify maximal integral point sets over F_q for q≤47. Furthermore, we give two series of maximal integral point sets and prove their maximality.     

Peak point theorems for uniform algebras on smooth manifolds

It was once conjectured that if A is a uniform algebra on its maximal ideal space X, and if each point of X is a peak point for A, then A = C(X). This peak point conjecture was disproved by Brian Cole in 1968. However, Anderson and Izzo showed that the peak point conjecture does hold for uniform algebras generated by smooth functions on smooth two-manifolds with boundary. The corresponding assertion for smooth three-manifolds is false, but Anderson, Izzo, and Wermer established a peak point theorem for polynomial approximation on real-analytic three-manifolds with boundary. Here we establish a more general peak point theorem for real-analytic three-manifolds with boundary analogous to the two-dimensional result. We also show that if A is a counterexample to the peak point conjecture generated by smooth functions on a manifold of arbitrary dimension, then the essential set for A has empty interior.     

Remarks on Caristi’s fixed point theorem and Kirk’s problem

Without assumptions on the continuity and the subadditivity of η, by means of Caristi’s fixed point theorem, we investigated the existence of fixed points for a Caristi type mapping which partially answered Kirk’s problem and improved Caristi’s fixed point theorem, Jachymski’s fixed point theorem and Khamsi’s fixed point theorem since φ is not necessarily assumed to be bounded below on X.     

Simulated annealing for constrained global optimization

Hide-and-Seek is a powerful yet simple and easily implemented continuous simulated annealing algorithm for finding the maximum of a continuous function over an arbitrary closed, bounded and full-dimensional body. The function may be nondifferentiable and the feasible region may be nonconvex or even disconnected. The algorithm begins with any feasible interior point. In each iteration it generates a candidate successor point by generating a uniformly distributed point along a direction chosen at random from the current iteration point. In contrast to the discrete case, a single step of this algorithm may generateany point in the feasible region as a candidate point. The candidate point is then accepted as the next iteration point according to the Metropolis criterion parametrized by anadaptive cooling schedule. Again in contrast to discrete simulated annealing, the sequence of iteration points converges in probability to a global optimum regardless of how rapidly the temperatures converge to zero. Empirical comparisons with other algorithms suggest competitive performance by Hide-and-Seek.This material is based on work supported by a NATO Collaborative Research Grant, no. 0119/89.     

Upward straight-line embeddings of directed graphs into point sets

In this paper we study the problem of computing an upward straight-line embedding of a planar DAG (directed acyclic graph) G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction. In particular, we show that no biconnected DAG admits an upward straight-line embedding into every point set in convex position. We provide a characterization of the family of DAGs that admit an upward straight-line embedding into every convex point set such that the points with the largest and the smallest y-coordinate are consecutive in the convex hull of the point set. We characterize the family of DAGs that contain a Hamiltonian directed path and that admit an upward straight-line embedding into every point set in general position. We also prove that a DAG whose underlying graph is a tree does not always have an upward straight-line embedding into a point set in convex position and we describe how to construct such an embedding for a DAG whose underlying graph is a path. Finally, we give results about the embeddability of some sub-classes of DAGs whose underlying graphs are trees on point set in convex and in general position.     

Asymptotic fixed point theory and the beer barrel theorem

In Sections 2 and 3 of this paper we refine and generalize theorems of Nussbaum (see [42]) concerning the approximate fixed point index and the fixed point index class. In Section 4 we indicate how these results imply a wide variety of asymptotic fixed point theorems. In Section 5 we prove a generalization of the mod p theorem: if p is a prime number, f belongs to the fixed point index class and f satisfies certain natural hypothesis, then the fixed point index of f ^p is congruent mod p to the fixed point index of f. In Section 6 we give a counterexample to part of an asymptotic fixed point theorem of A. Tromba [55]. Sections 2, 3, and 4 comprise both new and expository material. Sections 5 and 6 comprise new results. This paper is dedicated to Felix Browder on the occasion of his eightieth birthday and in recognition of his many contributions to nonlinear analysis     

Two point sets with additional properties

A subset of the plane is called a two point set if it intersects any line in exactly two points. We give constructions of two point sets possessing some additional properties. Among these properties we consider: being a Hamel base, belonging to some σ-ideal, being (completely) nonmeasurable with respect to different σ-ideals, being a κ-covering. We also give examples of properties that are not satisfied by any two point set: being Luzin, Sierpiński and Bernstein set. We also consider natural generalizations of two point sets, namely: partial two point sets and n point sets for n = 3, 4, …, ?₀, ?₁. We obtain consistent results connecting partial two point sets and some combinatorial properties (e.g. being an m.a.d. family).     

On coincidence point and fixed point theorems for nonlinear multivalued maps

Several characterizations of MT-functions are first given in this paper. Applying the characterizations of MT-functions, we establish some existence theorems for coincidence point and fixed point in complete metric spaces. From these results, we can obtain new generalizations of Berinde-Berinde?s fixed point theorem and Mizoguchi-Takahashi?s fixed point theorem for nonlinear multivalued contractive maps. Our results generalize and improve some main results in the literature.     

Proximal Point Algorithm for Quasi-Convex Minimization Problems in Metric Spaces

In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove Δ-convergence of the generated sequence to a critical point (which is defined in the text) of an objective quasi-convex, proper and lower semicontinuous function with at least a minimum point as well as some strong convergence results to a minimum point with some additional conditions. The results extend the recent results of the proximal point algorithm in Hadamard manifolds and CAT(0) spaces.