Related papers: Ergodic Theory Over ${\F}_2[[T]]$
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 ergodic hypothesis is examined for energetically open fluid systems represented by the barotropic Navier--Stokes equations with general inflow/outflow boundary conditions. We show that any globally bounded trajectory generates a…
This survey is focused on the results related to topologies on the groups of transformations in ergodic theory, Borel, and Cantor dynamics. Various topological properties (density, connectedness, genericity) of these groups and their…
Recent results of L. Zsido, based on his previous work with C. P. Niculescu and A. Stroh, on actions of topological semigroups on von Neumann algebras, give a Jacobs-de Leeuw-Glicksberg splitting theorem at the von Neumann algebra (rather…
Let $\mathcal L_1$ be the set of all mappings $f\colon\Z_p\Z_p$ of the space of all $p$-adic integers $\Z_p$ into itself that satisfy Lipschitz condition with a constant 1. We prove that the mapping $f\in\mathcal L_1$ is ergodic with…
We survey some recent developments and give a list of open problems regarding multiple recurrence and convergence phenomena of $\mathbb{Z}^d$ actions in ergodic theory and related applications in combinatorics and number theory.
Recent results by Alagic and Russell have given some evidence that the Even-Mansour cipher may be secure against quantum adversaries with quantum queries, if considered over other groups than $(\mathbb{Z}/2)^n$. This prompts the question as…
We prove a ratio ergodic theorem for amenable equivalence relations satisfying a strong form of the Besicovich covering property. We then use this result to study general non-singular actions of non-abelian free groups and establish a ratio…
Dynamical systems that are contracting on a subspace are said to be semicontracting. Semicontraction theory is a useful tool in the study of consensus algorithms and dynamical flow systems such as Markov chains. To develop a comprehensive…
This paper studies the task of two-sources randomness extractors for elliptic curves defined over finite fields $K$, where $K$ can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which…
We discuss limit distributions for hitting-time functions of certain exceptional families of asymptotically rare events for ergodic probability preserving transformations. The abstract core is an inducing argument. The latter applies, for…
We prove that for any bounded functions $f_1, f_2$ on a measure-preserving dynamical system $(X,T)$ and any distinct integers $a_1, a_2$, for almost every $x$ the sequence $$ f_1(T^{a_1 n}x) f_2(T^{a_2 n}x) $$ is a good weight for the…
We study, from the viewpoint of metrical number theory and (infinite) ergodic theory, the probabilistic laws governing the occurrence of prime numbers as digits in continued fraction expansions of real numbers.
This paper introduces a newly developed private key cryptosystem and a public key cryptosystem. In the first one, each letter is encrypted with a different key. Therefore, it is a kind of a one-time pad. The second one is inspired by the…
Local mean and individual (with respect to almost uniform convergence in Egorov's sense) ergodic theorems are established for actions of the semigroup $\mathbb R_+^d$ in symmetric spaces of measurable operators associated with a semifinite…
We give an algorithmic proof for the existence of tight Hamilton cycles in a random r-uniform hypergraph with edge probability p=n^{-1+eps} for every eps>0. This partly answers a question of Dudek and Frieze [Random Structures Algorithms],…
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…
Making topological authentication from theory to practical application is an important and challenging task. More and more researchers pay attention on coming quantum computation, privacy data protection, lattices and cryptography. Research…
According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable $k$-sparse hypergraphs. In the…
A directed acyclic graph G = (V, E) is pseudo-transitive with respect to a given subset of edges E1, if for any edge ab in E1 and any edge bc in E, we have ac in E. We give algorithms for computing longest chains and demonstrate geometric…