| 000 | 02454nam a22003858i 4500 | ||
|---|---|---|---|
| 001 | CR9780511549908 | ||
| 003 | UkCbUP | ||
| 005 | 20200124160238.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 090511s2002||||enk o ||1 0|eng|d | ||
| 020 | _a9780511549908 (ebook) | ||
| 020 | _z9780521807951 (hardback) | ||
| 020 | _z9780521183857 (paperback) | ||
| 040 |
_aUkCbUP _beng _erda _cUkCbUP |
||
| 050 | 0 | 0 |
_aQA613.7 _b.K36 2002 |
| 082 | 0 | 0 |
_a515/.42 _221 |
| 100 | 1 |
_aKammeyer, Janet Whalen, _d1963- _eauthor. |
|
| 245 | 1 | 0 |
_aRestricted orbit equivalence for actions of discrete amenable groups / _cJanet Whalen Kammeyer, Daniel J. Rudolph. |
| 264 | 1 |
_aCambridge : _bCambridge University Press, _c2002. |
|
| 300 |
_a1 online resource (vi, 201 pages) : _bdigital, PDF file(s). |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 1 |
_aCambridge tracts in mathematics ; _v146 |
|
| 500 | _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015). | ||
| 505 | 0 | _a1. Introduction -- 2. Definitions and Examples -- 3. The Ornstein-Weiss Machinery -- 4. Copying Lemmas -- 5. m-entropy -- 6. m-joinings -- 7. The Equivalence Theorem. | |
| 520 | _aThis 2002 monograph offers a broad investigative tool in ergodic theory and measurable dynamics. The motivation for this work is that one may measure how similar two dynamical systems are by asking how much the time structure of orbits of one system must be distorted for it to become the other. Different restrictions on the allowed distortion will lead to different restricted orbit equivalence theories. These include Ornstein's Isomorphism theory, Kakutani Equivalence theory and a list of others. By putting such restrictions in an axiomatic framework, a general approach is developed that encompasses all these examples simultaneously and gives insight into how to seek further applications. The work is placed in the context of discrete amenable group actions where time is not required to be one-dimensional, making the results applicable to a much wider range of problems and examples. | ||
| 650 | 0 | _aMeasure-preserving transformations. | |
| 650 | 0 | _aEntropy (Information theory) | |
| 700 | 1 |
_aRudolph, Daniel J., _eauthor. |
|
| 776 | 0 | 8 |
_iPrint version: _z9780521807951 |
| 830 | 0 |
_aCambridge tracts in mathematics ; _v146. |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1017/CBO9780511549908 |
| 999 |
_c518235 _d518233 |
||