Recurrence in Ergodic Theory and Combinatorial Number Theory

  title={Recurrence in Ergodic Theory and Combinatorial Number Theory},
  author={Harry Furstenberg},
Topological dynamics and ergodic theory usually have been treated independently. H. Furstenberg, instead, develops the common ground between them by applying the modern theory of dynamical systems to combinatories and number theory.Originally published in 1981.The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These paperback editions preserve the original… 

Applications of Ultrafilters in Ergodic Theory and Combinatorial Number Theory

Ultrafilters are very useful and versatile objects with applications throughout mathematics: in topology, analysis, combinarotics, model theory, and even theory of social choice. Proofs based on

Dimension Groups and Dynamical Systems

This book is the first self-contained exposition of the fascinating link between dynamical systems and dimension groups and the algebraic structures associated with them, with an emphasis on symbolic systems, particularly substitution systems.

Characteristic Factors for Multiple Recurrence and Combinatorial Applications

Since Furstenberg’s proof of Szemerédi’s theorem in the 1970s a mutually beneficial relationship has blossomed between ergodic theory and density Ramsey theory. In this thesis we contribute to this

Multiple recurrence and finding patterns in dense sets

Szemeredi’s Theorem asserts that any positive-density subset of the integers must contain arbitrarily long arithmetic progressions. It is one of the central results of additive combinatorics. After

Twelve Different Statistical Future of Dynamical Orbits: Empty Syndetic Center

In this paper we introduce a new criteria for classification of dynamical orbits in order to study the complexity theory of dynamical systems. And then we find that there exist twelve different orbit

Dynamical generalizations of the prime number theorem and disjointness of additive and multiplicative semigroup actions

We establish two ergodic theorems which have among their corollaries numerous classical results from multiplicative number theory, including the Prime Number Theorem, a theorem of Pillai-Selberg, a

Fractals in Probability and Analysis

Central topics such as Hausdorff dimension, self-similar sets and Brownian motion are introduced, as are more specialized topics, including Kakeya sets, capacity, percolation on trees and the traveling salesman theorem.

Direct and inverse results for popular differences in trees of positive dimension

Kneser-type inverse theorems for sets of return times in measure-preserving systems and a correspondence principle of Furstenberg and Weiss which relates combinatorial data on a tree to the dynamics of a Markov process are formalised.

Partition regular polynomial patterns in commutative semigroups

In 1933 Rado characterized all systems of linear equations with rational coefficients which have a monochromatic solution whenever one finitely colors the natural numbers. A natural follow-up problem

Closed Ideals in the Stone-Cech Compactification of a Countable Semigroup and Some Applications to Ergodic Theory and Topological Dynamics

We study the relationship between algebra in the Stone-Čech compactification βS of a countable semigroup and dynamics. In particular, we establish a correspondence between the closed subsets of βS