共查询到10条相似文献,搜索用时 78 毫秒
1.
Let f :X→X be a continuous map of a compact metric space to itself. We prove that f is topologically conjugate to an adding machine map if and only if X is an infinite minimal set for f and each point of X is regularly recurrent. Moreover, if X is an infinite minimal set for f and one point of X is regularly recurrent, then f is semiconjugate to an adding machine map. 相似文献
2.
Ying-xuan Niu 《高校应用数学学报(英文版)》2009,24(2):230-236
Let X be a compact metric space studies some relationships between stochastic and f : X→ X be a continuous map. This paper and topological properties of dynamical systems. It is shown that if f satisfies the central limit theorem, then f is topologically ergodic and / is sensitively dependent on initial conditions if and only if / is neither minimal nor equicontinuous. 相似文献
3.
Let I be a compact interval of real axis R, and(I, H) be the metric space of all nonempty closed subintervals of I with the Hausdorff metric H and f : I → I be a continuous multi-valued map. Assume that Pn =(x_0, x_1,..., xn) is a return tra jectory of f and that p ∈ [min Pn, max Pn] with p ∈ f(p). In this paper, we show that if there exist k(≥ 1) centripetal point pairs of f(relative to p)in {(x_i; x_i+1) : 0 ≤ i ≤ n-1} and n = sk + r(0 ≤ r ≤ k-1), then f has an R-periodic orbit, where R = s + 1 if s is even, and R = s if s is odd and r = 0, and R = s + 2 if s is odd and r 0. Besides,we also study stability of periodic orbits of continuous multi-valued maps from I to I. 相似文献
4.
拓扑遍历与拓扑双重遍历 总被引:24,自引:1,他引:23
令X为紧致度量空间,f:X→X为连续映射,U,V为X的任意非空开集,若{n>0|fn(U)∩V≠ )为正上密度集,则称f拓扑遍历.f拓扑双重遍历意味着f×f拓扑遍历.本文在[2]的基础上进一步讨论拓扑遍历与拓扑双重遍历映射的性质. 相似文献
5.
Let
be a smooth map of a closed n-dimensional manifold (n2) into the plane and let
be an orthogonal projection. We say that f has the standard lifting property, if every embedding
with
is standard in a certain sense. In this paper we give some sufficient conditions for a generic smooth map f to have the standard lifting property when M is a closed surface or an n-dimensional homotopy sphere. 相似文献
6.
In this paper we classify linear maps preserving commutativity in both directions on the space N(F) of strictly upper triangular (n+1)×(n+1) matrices over a field F. We show that for n3 a linear map on N(F) preserves commutativity in both directions if and only if =′+f where ′ is a product of standard maps on N(F) and f is a linear map of N(F) into its center. 相似文献
7.
It is known that if f is a multiplicative increasing function on
, then either f(n)=0 for all
or f(n)=n for some 0. It is very natural to ask if there are similar results in other algebraic systems. In this paper, we first study the multiplicative increasing functions over nonnegative square matrices with respect to tensor product and then restrict our result to multidigraphs and loopless multidigraphs. 相似文献
8.
Let k be a field of characteristic 0, and let f : kn→kn be a polynomial map with components of the form fi=xi+hi, where the hi are monomials. If the Jacobian determinant of the map f is a nonzero constant, then f is a tame automorphism. If, in addition, each hi is either constant or of degree 2 or more, then f is linearly triangularizable. 相似文献
9.
W
adys
aw Kulpa 《Topology and its Applications》2003,130(3):33-258
If f maps continuously a compact subset X of Rn into Rn and x is a point whose distance from the boundary ∂X is greater than double diameter of the fibres of the points in f(∂X) then f(x) is in the interior of f(X). This theorem extends some results due to Borsuk and Sitnikov. 相似文献
10.
Let G be a graph and f : V(G)→{1,3,5,…}. Then a subgraph H of G is called a (1,f)-odd subgraph if degH(x){1,3,…,f(x)} for all xV(H). If f(x)=1 for all xV(G), then a (1,f)-odd subgraph is nothing but a matching. A (1,f)-odd subgraph H of G is said to be maximum if G has no (1,f)-odd subgraph K such that |K|>|H|. We show that (1,f)-odd subgraphs have some properties similar to those of matchings, in particular, we give a formula for the order of a maximum (1,f)-odd subgraph, which is similar to that for the order of a maximum matching. 相似文献