Related papers: A note on Furstenberg's filtering problem
The Furstenberg recurrence theorem (or equivalently, Szemer\'edi's theorem) can be formulated in the language of von Neumann algebras as follows: given an integer $k \geq 2$, an abelian finite von Neumann algebra $(\M,\tau)$ with an…
We establish conditions for an exponential rate of forgetting of the initial distribution of nonlinear filters in $V$-norm, path-wise along almost all observation sequences. In contrast to previous works, our results allow for unbounded…
We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…
The Furstenberg-S\'ark\"ozy theorem asserts that the difference set $E-E$ of a subset $E \subset \mathbb{N}$ with positive upper density intersects the image set of any polynomial $P \in \mathbb{Z}[n]$ for which $P(0)=0$. Furstenberg's…
We generalize the celebrated Fr\"{o}berg's theorem to embedded joins of copies of a simplicial complex, namely higher secant complexes to the simplicial complex, in terms of property $N_{q+1,p}$ due to Green and Lazarsfeld. Furthermore, we…
Since their introduction by Furstenberg in 1967, joinings have proved a very powerful tool in ergodic theory. We present here some aspects of the use of joinings in the study of measurable dynamical systems, emphasizing on - the links…
Furstenberg's $\times 2 \times 3$ conjecture has remained a central open problem in ergodic theory for over $50$ years, and it serves as the basic test case for a broad class of rigidity phenomena which are believed to hold in…
The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…
Shortly after Szemer\'edi's proof that a set of positive upper density contains arbitrarily long arithmetic progressions, Furstenberg gave a new proof of this theorem using ergodic theory. This gave rise to the field of ergodic Ramsey…
Furstenberg's flow on the infinite-dimensional torus $\mathbb{T}^\omega$ is defined by \[ T (x_1, x_2, \ldots, x_\nu, \ldots) = (x_1 + \alpha, x_2 + h(x_1), \ldots, x_\nu + h(x_1 + (\nu-2)\beta), \ldots) \] with $\alpha\in \mathbb{R}$…
This text is addressed to students. It is a short story about some problems in ergodic theory, both related and independent. We discuss the factorization of transformations into the product of three involutions; Furstenberg's theorem on…
We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.
A very simple but useful almost sure convergence theorem of probability is given.
Using morphic cohomology, we produce a sequence of conjectures, called morphic conjectures, which terminates at the Grothendieck standard conjecture A. A refinement of Hodge structures is given, and with the assumption of morphic…
We introduce the notion of additive filter and present a new proof of the existence of idempotent ultrafilters on N without any use of Zorn's Lemma, and where one only assumes the Ultrafilter Theorem for the continuum.
Proposed derivations of the Born rule for Everettian theory are controversial. I argue that they are unnecessary but may provide justification for a simplified version of the Principal Principle. It's also unnecessary to replace Everett's…
A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…
Given a probability density $P({\bf x}|{\boldsymbol \lambda})$, where $\bf x$ represents continuous degrees of freedom and $\lambda$ a set of parameters, it is possible to construct a general identity relating expectations of observable…
When is a nonlinear filter stable with respect to its initial condition? In spite of the recent progress, this question still lacks a complete answer in general. Currently available results indicate that stability of the filter depends on…
Distributed signal processing algorithms have become a hot topic during the past years. One class of algorithms that have received special attention are particles filters (PFs). However, most distributed PFs involve various heuristic or…