Related papers: An approximate logic for measures
Tao has recently proved that if $T_1,...,T_l$ are commuting, invertible, measure-preserving transformations on a dynamical system then for any $L^\infty$ functions $f_1,...,f_l$, the average $\frac{1}{N}\sum_{n=0}^{N-1}\prod_{i\leq…
We investigate ergodic theory of Poisson suspensions. In the process, we establish close connections between finite and infinite measure preserving ergodic theory. Poisson suspensions thus provide a new approach to infinite measure…
Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…
We introduce a new notion of "regularity structure" that provides an algebraic framework allowing to describe functions and / or distributions via a kind of "jet" or local Taylor expansion around each point. The main novel idea is to…
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…
This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…
This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…
The Furstenberg-Zimmer structure theorem for $\mathbb{Z}^d$ actions says that every measure-preserving system can be decomposed into a tower of primitive extensions. Furstenberg and Katznelson used this analysis to prove the…
The idea of a parsing of a stationary process according to a collection of words is introduced, and the basic framework required for the asymptotic analysis of these parsings is presented. We demonstrate how the pointwise ergodic theorem…
We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…
The transference theory for Lp spaces of Calderon, Coifman, and Weiss is a powerful tool with many applications to singular integrals, ergodic theory, and spectral theory of operators. Transference methods afford a unified approach to many…
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…
We give a variation of the Furstenberg Correspondence which preserves the Gowers uniformity norms.
We start by reviewing recent probabilistic results on ergodic sums in a large class of (non-uniformly) hyperbolic dynamical systems. Namely, we describe the central limit theorem, the almost-sure convergence to the gaussian and other stable…
The standard approach to logic in the literature in philosophy and mathematics, which has also been adopted in computer science, is to define a language (the syntax), an appropriate class of models together with an interpretation of…
We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…
An example due to Erdos and Fortet shows that, for a lacunary sequence of integers (q_n) and a trigonometric polynomial f, the asymptotic distribution of normalized sums of f(q_k x) can be a mixture of gaussian laws. Here we give a…
Assuming that a threshold Ornstein-Uhlenbeck process is observed at discrete time instants, we propose generalized moment estimators to estimate the parameters. Our theoretical basis is the celebrated ergodic theorem. To use this theorem we…
We prove almost sure ergodic theorems for a class of systems called quasistatic dynamical systems. These results are needed, because the usual theorem due to Birkhoff does not apply in the absence of invariant measures. We also introduce…
Szemer\'edi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and R\"odl proved an analogue of Szemer\'edi's regularity lemma…