G‐odometers and their almost one‐to‐one extensions

By María Isabel Cortez, S. Petite. 2006

69 citations recorded by the source corpus.

In this paper we recall the concepts of G‐odometers and G‐subodometers for G‐actions, where G is a discrete finitely generated group; these generalize the notion of an odometer in the case G = ℤ. We characterize the G‐regularly recurrent systems as the minimal almost one‐to‐one extensions of subodometers, from which we deduce that the family of the G‐Toeplitz subshifts coincides with the family of the minimal symbolic almost one‐to‐one extensions of subodometers. We determine the continuous eigenvalues of these systems. When G is amenable and residually finite, a characterization of the G‐invariant measures of these systems is given.

Subfields: Computer Vision and Pattern Recognition, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/c5a877b4018c461635108f41c378dec960d15d5b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

  1. Felipe Garc'ia-Ramos

In Mathematical Physics

  1. Felipe Garc'ia-Ramos
  2. Jian Li
  3. Xiangdong Ye

Citations in the corpus