Statically tame periodic homeomorphisms of compact connected $3$-manifolds. II. Statically tame implies tame

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tame Triods in 3-space

A triod is a homeomorphic image of the set consisting of three linear intervals which are disjoint except for a single point which is an end point of each interval. The images of the intervals are called branches of the triod and their intersection the branch point. In [3 ] the author presented an example of a wild triod in euclidean 3-space, E3, which has an open 3-cell complement in compactif...

متن کامل

Tame Flows

The tame flows are “nice” flows on “nice” spaces. The nice (tame) sets are the pfaffian sets introduced by Khovanski, and a flow Φ : R×X → X on pfaffian set X is tame if the graph of Φ is a pfaffian subset of R×X×X . Any compact tame set admits plenty tame flows. We prove that the flow determined by the gradient of a generic real analytic function with respect to a generic real analytic metric ...

متن کامل

Tame structures

We study various notions of “tameness” for definably complete expansions of ordered fields. We mainly study structures with locally o-minimal open core, d-minimal structures, and dense pairs of d-minimal structures.

متن کامل

Tame Mappings Are Semismooth

Superlinear convergence of the Newton method for nonsmooth equations requires a “semismoothness” assumption. In this work we prove that locally Lipschitz functions definable in an o-minimal structure (in particular semialgebraic or globally subanalytic functions) are semismooth. Semialgebraic, or more generally, globally subanalytic mappings present the special interest of being γ-order semismo...

متن کامل

Myla Archer / Proving TESLA with TAME 3

The TESLA multicast stream authentication protocol is distinguished from other types of cryptographic protocols in both its key management scheme and its use of timing. It takes advantage of the stream being broadcast to periodically commit to and later reveal keys used by a receiver to verify that packets are authentic, and it uses both inductive reasoning and time arithmetic to allow the rece...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1980

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1980-0561836-1