Skip to content
Register Sign in Wishlist

Restricted Orbit Equivalence for Actions of Discrete Amenable Groups

Part of Cambridge Tracts in Mathematics

  • Date Published: February 2011
  • availability: Available
  • format: Paperback
  • isbn: 9780521183857

Paperback

Add to wishlist

Other available formats:
Hardback, eBook


Looking for an inspection copy?

This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact asiamktg@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This 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.

    • Comprehensive and modern treatment of the area
    • Substantial list of examples and research directions
    Read more

    Reviews & endorsements

    Review of the hardback: '… this profound book … gives an attractive overview and backward look at the restricted orbit equivalence theory for single transformations and other 'small' groups.' Zentralblatt für Mathematik

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: February 2011
    • format: Paperback
    • isbn: 9780521183857
    • length: 208 pages
    • dimensions: 229 x 152 x 12 mm
    • weight: 0.31kg
    • availability: Available
  • Table of Contents

    1. Preface
    2. Definitions and examples
    3. The Ornstein–Weiss machinery
    4. Copying lemmas
    5. m-entropy
    6. m-joinings
    7. The equivalence theorem
    8. Appendix.

  • Authors

    Janet Whalen Kammeyer

    Daniel J. Rudolph, University of Maryland, College Park

Related Books

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon
×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×