No label defined (Q3784209)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4045866 |
Statements
1987
0 references
Furstenberg's correspondence principle
0 references
upper asymptotic density
0 references
Banach density
0 references
invertible measure-preserving transformation
0 references
density Ramsey theory
0 references
Szemerédi's theorem on arithmetic progressions
0 references
existence of monochromatic affine subspaces
0 references
finite coloring
0 references
0.8117914199829102
0 references
0.8057755827903748
0 references
0.8041862845420837
0 references
[For the entire collection see Zbl 0619.00005.] \textit{H. Furstenberg} [J. Anal. Math. 31, 204-256 (1977; Zbl 0347.28016)] found the following ``correspondence principle'': To any set \(E\subseteq {\mathbb{N}}\) with Banach density \(d^*(E)>0\) there corresponds a probability space (X,\({\mathfrak B},\mu)\), a set \(A\in {\mathfrak B}\) with \(\mu (A)=d^*(E)\) and an invertible measure-preserving transformation T such that, for any \(n_ 1,n_ 2,...,n_ k\in {\mathbb{N}},\) \(d^*(E\cap (E-n_ 1)\cap... \cap (E-n_ k))\geq \mu (A\cap T^{n_ 1}A\cap... \cap T^{n_ k}A).\)The author gives an exposition of the development of density Ramsey theory as initiated by this correspondence principle, beginning with Furstenberg's proof of Szemerédi's theorem on arithmetic progressions and various refinements and generalizations of it. The paper also describes analogous results concerning the existence of monochromatic affine subspaces for a given finite coloring of the countably infinite- dimensional vector space \(F^{\infty}\) over a finite field F. The emphasis lies on explaining the superiority of the ergodic-theoretic approach to density problems as compared to the classical combinatorial methods.
0 references