树映射的链回归点与拓扑熵

Let f be a tree map,P(f) the set of periodic points of f and CR(f) the set of chain recurrent points of f. In this paper,the notion of division for invariant closed subsets of a tree map is introduced. It is proved that: (1) fhas zero topological entropy if and only if for any x∈CR(f)-P(f) and each natural number s the orbit of x under f^5 has a division; (2) If f has zero topological entropy,then for any xECR(f)--P(f) the w-limit set of x is an infinite minimal set.     

Ergodic Retraction Theorem and Weak Convergence Theorem for Reversible Semigroups of Non-Lipschitzian Mappings

Let G be a semitopological semigroup. Let C be a closed convex subset of a uniformly convex Banaeh space E with a Frechet differentiable norm, and T = {Tt ： t ∈ G} be a continuous representation of G as nearly asymptotically nonexpansive type mappings of C into itself such that the common fixed point set F（T） of T in C is nonempty. It is shown that if G is right reversible, then for each almost-orbit u（.） of T, ∩s∈G ^-CO{u（t） ： t ≥ s} ∩ F（T） consists of at most one point. Furthermore, ∩s∈G ^-CO{Ttx ： t ≥ s} ∩ F（T） is nonempty for each x ∈ C if and only if there exists a nonlinear ergodic retraction P of C onto F（T） such that PTs - TsP = P for all s ∈ G and Px ∈^-CO{Ttx ： s ∈ G} for each x ∈ C. This result is applied to study the problem of weak convergence of the net {u（t） ： t ∈ G} to a common fixed point of T.     

Topological Structure of Non-wandering Set of a Graph Map

Let G be a graph （i.e., a finite one-dimensional polyhedron） and f ： G → G be a continuous map. In this paper, we show that every isolated recurrent point of f is an isolated non-wandering point; every accumulation point of the set of non-wandering points of f with infinite orbit is a two-order accumulation point of the set of recurrent points of f; the derived set of an ω-limit set of f is equal to the derived set of an the set of recurrent points of f; and the two-order derived set of non-wandering set of f is equal to the two-order derived set of the set of recurrent points of f.     

A SIMPLICIAL ALGORITHM FOR COMPUTING AN INTEGER ZERO POINT OF A MAPPING WITH THE DIRECTION PRESERVING PROPERTY

A mapping f:Z~n→R~n is said to possess the direction preserving property if fi(x)>0implies fi(y)≥0 for any integer points x and y with ‖x-y‖∞≤1.In this paper,a simplicial algorithm is developed for computing an integer zero point of a mappingwith the direction preserving property.We assume that there is an integer point x~0 withc≤x~0≤d satisfying that max_(1≤i≤n)(x_i-x_i~0)fi(x)>0 for any integer point x withf(x)≠0 on the boundary of H={x∈R~n|c-e≤x≤d e},where c and d are twofinite integer points with c≤d and e=(1,1,…1)~∈R~n.This assumption is impliedby one of two conditions for the existence of an integer zero point of a mapping with thepreserving property in van der Laan et al.(2004).Under this assumption, starting at x~0,the algorithm follows a finite simplicial path and terminates at an integer zero point ofthe mapping.This result has applications in general economic equilibrium models withindivisible commodities.     

Quasiconformal Mappings and Weakly John Domains

Let D be a bounded domain in R~2 and c(≥1)be a constant.We say that D is a c-Johndomain if there exists x_0∈D such that for any x∈D,there must be a rectifiable curve γDwhich joins x and x_0,satisfying l(γ(x,y))≤cd(y,D)for any y ∈γ,where l(γ(x,y))denotesthe Euclidean length of the subcurce γ between x and y,d(y,D)is the Euclidean distance fromy to the boundary D of D.We say that D is a John domain if D is a c-John domain for some     

The numbers of periodic orbits hidden at fixed points of 2-dimensional holomorphic mappings

Let △n be the ball |x| 1 in the complex vector space C n , let f :△n→ C n be a holomorphic mapping and let M be a positive integer. Assume that the origin 0 = (0, . . . , 0) is an isolated fixed point of both f and the M-th iteration f M of f. Then the (local) Dold index P M (f, 0) at the origin is well defined, which can be interpreted to be the number of virtual periodic points of period M of f hidden at the origin: any holomorphic mapping f 1 :△n→ C n sufficiently close to f has exactly P M (f, 0) distinct periodic points of period M near the origin, provided that all the fixed points of f M 1 near the origin are simple. Therefore, the number O M (f, 0) = P M (f, 0)/M can be understood to be the number of virtual periodic orbits of period M hidden at the fixed point. According to the works of Shub-Sullivan and Chow-Mallet-Paret-Yorke, a necessary condition so that there exists at least one virtual periodic orbit of period M hidden at the fixed point, i.e., O M (f, 0)≥1, is that the linear part of f at the origin has a periodic point of period M. It is proved by the author recently that the converse holds true. In this paper, we will study the condition for the linear part of f at 0 so that O M (f, 0)≥2. For a 2 × 2 matrix A that is arbitrarily given, the goal of this paper is to give a necessary and sufficient condition for A, such that O M (f, 0)≥2 for all holomorphic mappings f :△2 → C 2 such that f(0) = 0, Df(0) = A and that the origin 0 is an isolated fixed point of f M .     

THE ASYMPTOTIC PERIODICITY OF PIECEWISE MONOTONE SELFMAPS OF THE INTERVAL

Let f : I → I be a piecewise monotone interval map. The critical point set C(f) of f consists of all the preimages of its turning points. It is proved that the complex dynamical behaviors of f are all concentrated on the derived set of C(f). f is asymptotically periodic if and only if the derived set of C(f) is countable.     

COMPLETE ACCUMULATION POINTS AND COMPACTNESS OF FUZZY SETS

Let A be a fuzzy set in a fuzzy topological space (X,τ) and β∈(0, 1]. We denote by ζ_x~a the fuzzy point defined by ζ_x~a(x)=a and ζ_x~a(y)=0 for eaoh y≠x, where a is called the height of ζ_x~a. A subfamily u of τ is called an open β-cover of A if each fuzzy point in A with height β is quasi-coincident with ([1]) some member of u. By a β-subcover of the open β-cover u of A is meant any subfamily of u that is also an open β-cover of A. A is called β-compact in (X, τ) if every open β-cover     

WEAK CHEBYSHEV SPACES ON LOCALLY ORDERED TOPOLOGY SPACE AND THE RELATED CONTINUOUS METRIC SELECTIONS

Let C(X)be the space of all continuous real-valued functions on a compact Hausdorffspace X under the uniform norm:‖f‖=max{|f(x)|:x∈X}.For G(?)C(X),defineP_G(f)={g∈G:‖f-g‖=inf{‖f-p‖:p∈G}}.If there exists a continuous mapping S from C(X)to G such that S(f)∈P_G(f)for everyf in C(X),then S is called a continuous selection of the metric projection P_G.And G is called a Z-subspace of C(X),if,for every nonzero g in G,g does not vanishon any open subset of X.In this paper,the author gives several characterizations of Z-subspaces G whose metricprojections P_G have continuous selections.The following results are obtained:If X is locally connected and G is an n-dimensional Z-subspace of C(X),then P_G hasa continuous selection if and only if every nonzero g in G has at most n zeros and has atmost n-1 zeros with sign changes.     

Equicontinuity of maps on a dendrite with finite branch points

Let(T, d) be a dendrite with finite branch points and f be a continuous map from T to T. Denote byω(x,f) and P(f) the ω-limit set of x under f and the set of periodic points of,respectively. Write Ω(x,f) = {y| there exist a sequence of points x_k E T and a sequence of positive integers n_1 n_2 … such that lim_(k→∞)x_k=x and lim_(k→∞)f~(n_k)(x_k) =y}. In this paper, we show that the following statements are equivalent:(1) f is equicontinuous.(2) ω(x, f) = Ω(x,f) for any x∈T.(3) ∩_(n=1)~∞f~n(T) = P(f),and ω(x,f)is a periodic orbit for every x ∈ T and map h : x→ω(x,f)(x ET)is continuous.(4) Ω(x,f) is a periodic orbit for any x∈T.     

有限群在特征为零的任意域上的表示的一些注记

Let G be a finite group and K a field of characteristic zero.It is well-known that if K is a splitting field for G,then G is abelian if and only if any irreducible representation of G has degree 1.In this paper,we generalize this result to the case that K is an arbitrary field of characteristic zero（that is,K need not be a splitting field for G）,and we also obtain the orthogonality relations of irreducible K-characters of G in this case.Our results generalize some well-known theorems.     

Normal families and fixed points of iterates

Let F be a family of holomorphic functions and suppose that there exists ε 0 such that if f ∈ F, then |(f 2 ) (ξ)|≤4-ε for all fixed points ξ of the second iterate f 2 . We show that then F is normal. This is deduced from a result which says that if p is a polynomial of degree at least 2, then p 2 has a fixed point ξ such that |(p 2 ) (ξ)|≥4. The results are motivated by a problem posed by Yang Lo.     

Sensitivity and regionally proximal relation in minimal systems

A topological dynamical system is n-sensitive,if there is a positive constant such that in each non-empty open subset there are n distinct points whose iterates will be apart from the constant at least for a same moment.The properties of n-sensitivity in minimal systems are investigated.It turns out that a minimal system is n-sensitive if and only if the n-th regionally proximal relation Q_n contains a point whose coordinates are pairwise distinct.Moreover,the structure of a minimal system which is n-sensitive but not(n 1)-sensitive(n≥2)is determined.     

On pointwise bounded approximation

Let G be an open subset in the extended complex plane and let A（G） denote the algebra of all functions analytic on G and continuous on G. We call a domain multi-nicely connected if there is a circular domain W and a conformal map ~ from W onto G such that the boundary value function of φ is univalent almost everywhere with respect to the arclength on aW. Suppose that every component of G is finitely connected and none of the components of G have single point boundary components. We show that for every bounded analytic function on G to be the pointwise limit of a bounded sequence of functions in A（G）, it is necessary and sufficient that each component of G is multi-nicely connected and the harmonic measures of G are mutually singular. This generalizes the corresponding result of Davie for the case when the components of G are simply connected.     

A class of antimagic join graphs

A labeling f of a graph G is a bijection from its edge set E(G) to the set {1, 2, . . . , |E(G)|}, which is antimagic if for any distinct vertices x and y, the sum of the labels on edges incident to x is different from the sum of the labels on edges incident to y. A graph G is antimagic if G has an f which is antimagic. Hartsfield and Ringel conjectured in 1990 that every connected graph other than K 2 is antimagic. In this paper, we show that if G 1 is an n-vertex graph with minimum degree at least r, and G 2 is an m-vertex graph with maximum degree at most 2r-1 (m ≥ n), then G1 ∨ G2 is antimagic.     

Vertex-distinguishing IE-total Colorings of Complete Bipartite Graphs K8,n

Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) 6= C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt(G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K8,n are discussed in this paper. Particularly, the VDIET chromatic number of K8,n are obtained.     

On 3-colorings of Plane Graphs

In this paper, we prove that if G is a plane graph without 4-, 5- and 7-circuits and without intersecting triangles, then for each face f of degree at most 11, any 3-coloring of the boundary of f can be extended to G. This gives a positive support to a conjecture of Borodin and Raspaud which claims that each plane graph without 5-circuits and intersecting triangles is 3-colorable.     

On solubility and supersolubility of some classes of finite groups

Let G be a finite group and H a subgroup of G. Then H is said to be S-permutable in G if HP = PH for all Sylow subgroups P of G. Let HsG be the subgroup of H generated by all those subgroups of H which are S-permutable in G. Then we say that H is S-embedded in G if G has a normal subgroup T and an S-permutable subgroup C such that T ∩ H HsG and HT = C. Our main result is the following Theorem A. A group G is supersoluble if and only if for every non-cyclic Sylow subgroup P of the generalized Fitting subgrou...     

DNA labelled graphs with DNA computing

Let k≥2, 1≤i≤k andα≥1 be three integers. For any multiset which consists of some k-long oligonucleotides, a DNA labelled graph is defined as follows: each oligonucleotide from the multiset becomes a point; two points are connected by an arc from the first point to the second one if the i rightmost uucleotides of the first point overlap with the i leftmost nucleotides of the second one. We say that a directed graph D can be(k, i;α)-labelled if it is possible to assign a label(l_1(x),..., l_k(x))to each point x of D such that l_j(x)∈{0,...,a-1}for any j∈{1,...,k}and(x,y)∈E(D)if and only if(l_k-i 1(x),..., l_k(x))=(l_1(y),..., l_i(y)). By the biological background, a directed graph is a DNA labelled graph if there exist two integers k, i such that it is(k, i; 4)-labelled. In this paper, a detailed discussion of DNA labelled graphs is given. Firstly, we study the relationship between DNA labelled graphs and some existing directed graph classes. Secondly, it is shown that for any DNA labelled graph, there exists a positive integer i such that it is(2i, i; 4)-labelled. Furthermore, the smallest i is determined, and a polynomial-time algorithm is introduced to give a(2i, i; 4)-labelling for a given DNA labelled graph. Finally, a DNA algorithm is given to find all paths from one given point to another in a(2i, i; 4)-labelled directed graph.     

Local generalized empirical estimation of regression

Let f(x) be the density of a design variable X and m(x) = E[Y\X = x] the regression function. Then m(x) - G(x)/f(x), where G(x) = m(x)f(x). The Dirac δ-function is used to define a generalized empirical function Gn (x) for G(x) whose expectation equals G(x). This generalized empirical function exists only in the space of Schwartz distributions, so we introduce a local polynomial of order p approximation to Gn(.) which provides estimators of the function G(x) and its derivatives. The density f(x) can be estimated in a similar manner. The resulting local generalized empirical estimator (LGE) of m(x) is exactly the Nadaraya-Watson estimator at interior points when p = 1, but on the boundary the estimator automatically corrects the boundary effect. Asymptotic normality of the estimator is established. Asymptotic expressions for the mean squared errors are obtained and used in bandwidth selection. Boundary behavior of the estimators is investigated in details. We use Monte Carlo simulations to show that the