树映射迭代下的非游荡点集

设T为树且Ω( f )为连续自映射 f : T→T的非游荡点集.对于树T上的连续自映射 f :T→T证明了： (1) 如果x∈Ω( f )具有无限轨道,则对每一个n∈N有x∈Ω( f ⁿ). (2) 如果映射 f 的拓扑熵为零,则对每一个n∈N有Ω( f )=∈Ω( f ⁿ). 进一步地,对每一个k ∈N给出了使得对树T上的任意连续自映射 f 均有Ω( f ^k)=Ω( f ^nk)成立的自然数n的一个完全刻画.     

树映射的非游荡集与拓扑混合性

设 T是个树 ,C0 ( T)表示 T上所有的连续自映射 (即 :树映射 )的集合 ,W={ fn:n≥ 2是自然数 ,f∈ C0 ( T) } .讨论了每一点都是非游荡点的树映射的性质 ,并证明了 :若混合映射 f∈ W( W在 C0 ( T)内的闭包 )且 T的每个端点都不是 f的不动点 ,则存在 g∈ C0 ( T)及自然数 k>1使 f=gk.     

连续树映射非游荡集的拓扑结构

本文研究树（即不含有圈的一维紧致连通的分支流形）上连续自映射的非游荡集的拓扑结构．证明了孤立的周期点都是孤立的非游荡点；具有无限轨道的非游荡点集的聚点都是周期点集的二阶聚点，以及ω－极限集的导集等于周期点集的导集和非游荡集的二阶导集等于周期点集的二阶导集．     

Coven和Hedlund一个定理的较简单的证明

Coven和Hedlund在[1]中证明：若区间映射的周期集为有限集,则它的每一个非游荡点都是周期点。本给出了这一定理的一个较简单的证明。此外,我们还用“同伦”的方法简化了该的一个关键引理的证明。     

Automorphisms of Maps with a Given Underlying Graph and Their Application to Enumeration

A graph is called a semi-regular graph if its automorphism group action on its ordered pair of adjacent vertices is semi-regular. In this paper, a necessary and sufficient condition for an automorphism of the graph F to be an automorphism of a map with the underlying graph F is obtained. Using this result, all orientation-preserving automorphisms of maps on surfaces (orientable and non-orientable) or just orientable surfaces with a given underlying semi-regular graph F are determined. Formulas for the numbers of non-equivalent embeddings of this kind of graphs on surfaces (orientable, non-orientable or both) are established, and especially, the non-equivalent embeddings of circulant graphs of a prime order on orientable, non-orientable and general surfaces are enumerated.     

树映射的不稳定流形,非游荡集与拓扑熵

设f是个端点数为n的树T上的连续自映射.本文得到了f的单侧不稳定流形与拓扑熵的关系,并证明了:（1）如果x∈i=0∞fi（Ω（f））-P（f）,那么,x的轨道是无限的;（2）如果f有一组可循环的不动点,那么h（f）≥In2（n-1）.     

The global dynamics of a class of vector fields in ℝ<Superscript>3</Superscript>

In this paper, we find a bridge connecting a class of vector fields in ℝ³ with the planar vector fields and give a criterion of the existence of closed orbits, heteroclinic orbits and homoclinic orbits of a class of vector fields in ℝ³. All the possible nonwandering sets of this class of vector fields fall into three classes: (i) singularities; (ii) closed orbits; (iii) graphs of unions of singularities and the trajectories connecting them. The necessary and sufficient conditions for the boundedness of the vector fields are also obtained.     

Graph maps whose periodic points form a closed set

A continuous map f from a graph G to itself is called a graph map. Denote by P(f), R(f), ω(f), Ω(f) and CR(f) the sets of periodic points, recurrent points, ω-limit points, non-wandering points and chain recurrent points of f respectively. It is well known that P(f)⊂R(f)⊂ω(f)⊂Ω(f)⊂CR(f). Block and Franke (1983) [5] proved that if f:I→I is an interval map and P(f) is a closed set, then CR(f)=P(f). In this paper we show that if f:G→G is a graph map and P(f) is a closed set, then ω(f)=R(f). We also give an example to show that, for general graph maps f with P(f) being a closed set, the conclusion ω(f)=R(f) cannot be strengthened to Ω(f)=R(f) or ω(f)=P(f).     

树映射的单侧γ-极限点集与拓扑熵

本文讨论了树映射的单侧γ-极限点集与吸引中心的关系，得到了树映射具有正拓扑熵的几个等价条件．此外，还得到了树映射是强非混沌以及逐片单调树映射的拓扑熵为零的几个等价条件．     

Set packing relaxations of some integer programs

This paper is about set packing relaxations of combinatorial optimization problems associated with acyclic digraphs and linear orderings, cuts and multicuts, and set packings themselves. Families of inequalities that are valid for such a relaxation as well as the associated separation routines carry over to the problems under investigation. Received: September 1997 / Accepted: November 1999?Published online June 8, 2000     

The Inflated Attractors of Non-autonomous Strongly Damped Wave Equations

We investigate the existence and the continuity of the inflated attractors for a class of nonautonomous strongly damped wave equations through differential inclusion.     

Bifurcations of Fine 3-point-loop in Higher Dimensional Space

By using the linear independent fundamental solutions of the linear variational equation along the heteroclinic loop to establish a suitable local coordinate system in some small tubular neighborhood of the heteroclinic loop, the Poincaré map is constructed to study the bifurcation problems of a fine 3–point loop in higher dimensional space. Under some transversal conditions and the non–twisted condition, the existence, coexistence and incoexistence of 2–point–loop, 1–homoclinic orbit, simple 1–periodic orbit and 2–fold 1–periodic orbit, and the number of 1–periodic orbits are studied. Moreover, the bifurcation surfaces and existence regions are given. Lastly, the above bifurcation results are applied to a planar system and an inside stability criterion is obtained. This work is supported by the National Natural Science Foundation of China (10371040), the Shanghai Priority Academic Disciplines and the Scientific Research Foundation of Linyi Teacher’s University     

The Convexity Number of a Graph

 For two vertices u and v of a connected graph G, the set I[u,v] consists of all those vertices lying on a u−v shortest path in G, while for a set S of vertices of G, the set I[S] is the union of all sets I[u,v] for u,v∈S. A set S is convex if I[S]=S. The convexity number con(G) of G is the maximum cardinality of a proper convex set of G. The clique number ω(G) is the maximum cardinality of a clique in G. If G is a connected graph of order n that is not complete, then n≥3 and 2≤ω(G)≤con(G)≤n−1. It is shown that for every triple l,k,n of integers with n≥3 and 2≤l≤k≤n−1, there exists a noncomplete connected graph G of order n with ω(G)=l and con(G)=k. Other results on convex numbers are also presented. Received: August 19, 1998 Final version received: May 17, 2000     

Applications of k-covers

We investigate a role of k-covers in selection principles theory. Some results about relationships between Ramsey theory and game theory and selection principles that involve k-covers are also given.     

Continuity properties of the Karush-Kuhn-Tucker point set in quadratic programming problems

Received March 18, 1996 / Revised version received August 8, 1997 Published online November 24, 1998     

An Arc as the Inverse Limit of a Single Bonding Map of Type N on [0,1]

Let I = [0, 1], c ₁, c ₂ ∈ (0, 1) with c ₁ < c ₂ and f : I⊸I be a continuous map satisfying: are both strictly increasing and is strictly decreasing. Let A = {x ∈ [0, c ₁]∣f(x) = x}, a=max A, a ₁ =max(A\{a}), and B = {x ∈ [c ₂, 1]∣f(x) = x}, b=minB, b ₁ =min(B\{b}). Then the inverse limit (I, f) is an arc if and only if one of the following three conditions holds: (1) If c ₁ < f (c ₁) ≤ c ₂ (resp. c ₁ ≤ f (c ₂) < c ₂), then f has a single fixed point, a period two orbit, but no points of period greater than two or f has more than one fixed point but no points of other periods, furthermore, if A≠φ and B≠φ, then f (c ₂) > a (resp. f (c ₁) < b). (2) If f (c ₁) ≤ c ₁ (resp. f (c ₂) ≥ c ₂), then f has more than one fixed point, furthermore, if B≠φ and A\ {a} ≠φ, f (c ₂) ≥ a or if a ₁ < f (c ₂) < a, f ² (c ₂) > f (c ₂), (resp. f has more than one fixed point, furthermore, if A≠φ and B\{b}≠φ, f (c ₁) ≤ b or if b < f (c ₂) < b ₁, f ² (c ₁) < f (c ₁)). (3) If f (c ₁) > c ₂ and f (c ₂) < c ₁, then f has a single fixed point, a single period two orbit lying in I\(u, v) but no points of period greater than two, where u, v ∈ [c ₁, c ₂] such that f (u) = c ₂ and f (v) = c ₁. Supported by the National Natural Science Foundation of China (No. 19961001, No. 60334020) and Outstanding Young Scientist Research Fund. (No. 60125310)     

Primal and dual convergence of a proximal point exponential penalty method for linear programming

We consider the diagonal inexact proximal point iteration where f(x,r)=c ^T x+r∑exp[(A _i x-b _i )/r] is the exponential penalty approximation of the linear program min{c ^T x:Ax≤b}. We prove that under an appropriate choice of the sequences λ _k , ε _k and with some control on the residual ν ^k , for every r _k →0⁺ the sequence u ^k converges towards an optimal point u ^∞ of the linear program. We also study the convergence of the associated dual sequence μ _i ^k =exp[(A _i u ^k -b _i )/r _k ] towards a dual optimal solution. Received: May 2000 / Accepted: November 2001?Published online June 25, 2002