A $C^{\infty}$ flow on $S^3$ with a Denjoy minimal set
نویسندگان
چکیده
منابع مشابه
A Minimal Irreducible Triangulation of S3
We present a very symmetric triangulation of the 3-sphere, where every edge is in at most five facets but which is not the boundary of a polytope. This shows that not every triangulation of a sphere, where angles around faces of codimension two are less than 2π in the metric pieced together by regular Euclidean simplices, is polytopal. The counterexample presented here is the smallest triangula...
متن کاملWeak Disks of Denjoy Minimal Sets
This paper investigates the existence of Denjoy minimal sets and, more generally, strictly ergodic sets in the dynamics of iterated homeomorphisms. It is shown that for the full two-shift, the collection of such invariant sets with the weak topology contains topological balls of all finite dimensions. One implication is an analogous result that holds for diffeomorphisms with transverse homoclin...
متن کاملDenjoy Minimal Sets Are Far from Affine
Not every Cantor set can arise as the minimal set for a C 1 diieomor-phism of the circle. For example, D. McDuu has shown that the usual \middle thirds" Cantor set cannot arise this way. In this note we exclude a suitable neighborhood of the class of aane Cantor sets.
متن کاملOn The Fractional Minimal Cost Flow Problem of a Belief Degree Based Uncertain Network
A fractional minimal cost flow problem under linear type belief degree based uncertainty is studied for the first time. This type of uncertainty is useful when no historical information of an uncertain event is available. The problem is crisped using an uncertain chance-constrained programming approach and its non-linear objective function is linearized by a variable changing approach. An illus...
متن کاملA Flow shop Production Planning Problem with basic period policy and Sequence Dependent set up times
Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Geometry
سال: 1981
ISSN: 0022-040X
DOI: 10.4310/jdg/1214436103