Marker automorphisms of the one-sided d-shift

Jonathan Ashley

doi:10.1017/S0143385700005538

Ergodic Theory and Dynamical Systems

Paper

19 Sep 2008

Marker automorphisms of the one-sided d-shift

Download paper

Abstract

We identify a set of generators for the automorphism group of the one-sided d-shift. For the 3-shift, this set of generators has an application to the dynamics of cubic polynomials. © 1990, Cambridge University Press. All rights reserved.

Paper

On the complexity of some geometric problems in unbounded dimension

Nimrod Megiddo

Journal of Symbolic Computation

Paper

The classification of one-sided Markov chains

Jonathan Ashley, Brian Marcus, et al.

Ergodic Theory and Dynamical Systems

Conference paper

On a partial ordering relation derived from redundancy of Slepian-Wolf coding

Da-Ke He, Ashish Jagmohan, et al.

ISIT 2007

Paper

An information statistics approach to data stream and communication complexity

Ziv Bar-Yossef, T.S. Jayram, et al.

Journal of Computer and System Sciences

View all publications

Abstract

Related

On the complexity of some geometric problems in unbounded dimension

The classification of one-sided Markov chains

On a partial ordering relation derived from redundancy of Slepian-Wolf coding

An information statistics approach to data stream and communication complexity