✦ LIBER ✦

On the weak isomorphism of strictly ergodic homeomorphisms

✍ Scribed by Mariusz Lemańczyk

Publisher: Springer Vienna
Year: 1989
Tongue: English
Weight: 320 KB
Volume: 108
Category: Article
ISSN: 0026-9255
DOI: 10.1007/bf01300065

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On isomorphism of weak Bernoulli transfo

On isomorphism of weak Bernoulli transformations

✍ N.A. Friedman; D.S. Ornstein 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 991 KB

On the Isomorphism Conjecture for Weak R

On the Isomorphism Conjecture for Weak Reducibilities

✍ Manindra Agrawal 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 652 KB

According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each other while according to the encrypted complete set conjecture there is a p-one way function f and an NP-complete set A such that A and f (A) are not polynomial-time isomorphic to each other. In this

On the weak ergodicity of nonhomogeneous

On the weak ergodicity of nonhomogeneous Markov chains

✍ Choon Peng Tan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Measure-preserving homeomorphisms of the

Measure-preserving homeomorphisms of the torus represent all finite entropy ergodic transformations

✍ D. A. Lind; J. -P. Thouvenot 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 619 KB

On the Group of Fuzzy Homeomorphisms

✍ T.P. Johnson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 135 KB

On the cycle-isomorphism of graphs

✍ Xingxing Yu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

## Abstract This paper considers conditions ensuring that cycle‐isomorphic graphs are isomorphic. Graphs of connectivity ⩾ 2 that have no loops were studied in [2] and [4]. Here we characterize all graphs __G__ of connectivity 1 such that every graph that is cycle‐isomorphic to __G__ is also isomor