Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-12-02T20:53:59.948Z Has data issue: false hasContentIssue false
  • English
  • Français

Recurrence in Ergodic Theory and Combinatorial Number Theory By H. Furstenberg: pp. 199. Princeton University Press: Princeton, New Yersey, 1981

Published online by Cambridge University Press:  19 September 2008

W. Parry
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Book Reviews
Information
Ergodic Theory and Dynamical Systems , Volume 3 , Issue 1 , March 1983 , pp. 162 - 166
Copyright
Copyright © Cambridge University Press 1983

References

REFERENCES

[1]Furstenberg, H.. Stationary Processes and Prediction Theory. Princeton Univ. Press: Princeton, 1960.Google Scholar
[2]Furstenberg, H.. Strict ergodicity and transformations of the torus. Amer. J. Math. 83 (1961), 573–601.Google Scholar
[3]Furstenberg, H.. The structure of distal flows. Amer. J. Math. 85 (1963), 477–515.Google Scholar
[4]Furstenberg, H.. Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation. Math. Syst. Th. Vol. 1. No. 1 (1967), 1–49.CrossRefGoogle Scholar