Abstract

We define rectangle exchange transformations analogously to interval exchange transformations. An interval exchange transformation is a mapping of the unit interval onto itself obtained by cutting the interval up into a finite number of subintervals and rearranging the pieces. A rectangle exchange transformation is a mapping of the unit square onto itself obtained by cutting the square up into a finite number of rectangular pieces and rearranging the pieces. We give a minimality condition for rectangle exchange transformations. We deal with various examples of ergodic rectangle exchange transformations. Related questions are discussed.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call