相关论文: Ergodic Methods in Additive Combinatorics
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…
De Finetti's classical result of [18] identifying the law of an exchangeable family of random variables as a mixture of i.i.d. laws was extended to structure theorems for more complex notions of exchangeability by Aldous [1,2,3], Hoover…
We study the long-time behavior of an additive functional that takes into account the jumps of a symmetric Markov process. This process is assumed to be observed through a biased observation scheme that includes the survival to events of…
We continue the work of Eriksen, Freij, and Wastlund [3], who study derangements that descend in blocks of prescribed lengths. We generalize their work to derangements that ascend in some blocks and descend in others. In particular, we…
Although the G.Birkhoff Ergodic Theorem (BET) is trivial for finite spaces, this does not help in proving it for hyperfinite Loeb spaces. The proof of the BET for this case, suggested by T. Kamae, works, actually, for arbitrary probability…
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 prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…
We formulate an ergodic theory for the (almost sure) limit $\mathcal{P}^\text{co}_{\tilde{\mathcal{E}}}$ of a sequence $(\mathcal{P}^\text{co}_{\mathcal{E}_n})$ of successive dynamic imprecise probability kinematics (DIPK, introduced in…
We provide necessary and sufficient conditions for joint ergodicity results for systems of commuting measure preserving transformations for an iterated Hardy field function of polynomial growth. Our method builds on and improves recent…
We generalize stochastic subgradient descent methods to situations in which we do not receive independent samples from the distribution over which we optimize, but instead receive samples that are coupled over time. We show that as long as…
Ramsey theory and forcing have a symbiotic relationship. At the RIMS Symposium on Infinite Combinatorics and Forcing Theory in 2016, the author gave three tutorials on Ramsey theory in forcing. The first two tutorials concentrated on…
In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…
In additive combinatorics, Erd\"{o}s-Szemer\'{e}di Conjecture is an important conjecture. It can be applied to many fields, such as number theory, harmonic analysis, incidence geometry, and so on. Additionally, its statement is quite easy…
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…
Extended Thermodynamics is a very important theory: for example, it predicts hyperbolicity, finite speeds of propagation waves as well as continuous dependence on initial data. Therefore, it constitutes a significative improvement of…
We show that countable increasing unions preserve a large family of well-studied covering properties, which are not necessarily sigma-additive. Using this, together with infinite-combinatorial methods and simple forcing theoretic methods,…
We study the Furstenberg-entropy realization problem for stationary actions. It is shown that for finitely supported probability measures on free groups, any a-priori possible entropy value can be realized as the entropy of an ergodic…
We study ergodic-theoretic properties of coded shift spaces. A coded shift space is defined as a closure of all bi-infinite concatenations of words from a fixed countable generating set. We derive sufficient conditions for the uniqueness of…
A problem of recent interest has been to study how large subsets of the natural numbers can be while avoiding 3-term geometric progressions. Building on recent progress on this problem, we consider the analogous problem over quadratic…
We present a new approach to the proof of ergodic theorems for actions of free groups based on geometric covering and asymptotic invariance arguments. Our approach can be viewed as a direct generalization of the classical geometric covering…