Related papers: Ergodic Theory Over ${\F}_2[[T]]$

We introduce a class of codes with overlapping code words, that we call SPO-codes. The SPO-codes are related to the Markov codes that were introduced in: G. Keller, J. Combinatorial Theory 56, (1991),pp.\ 75--83. The process of generating a…

In this paper we propose cryptosystems based on subgroup distortion in hyperbolic groups. We also include concrete examples of hyperbolic groups as possible platforms.

In this paper we discuss generic properties of "random subgroups" of a given group G. It turns out that in many groups G (even in most exotic of them) the random subgroups have a simple algebraic structure and they "sit" inside G in a very…

We give a survey of the entropy theory of interval maps as it can be analyzed using ergodic theory, especially measures of maximum entropy and periodic points. The main tools are (i) a version of Hofbauer's Markov diagram, (ii) the…

Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving…

We will present several examples in which ideas from ergodic theory can be useful to study some problems in arithmetic and algebraic geometry.

We apply the methods of ergodic theory to both simplify and significantly extend some classical results due to Stewart, Tijdeman, and Ruzsa. One of the notable features of our approach is the utilization of pointwise ergodic theory.

Let f be a self-map of a compact manifold M, admitting an global SRB measure \mu. For a continuous test function \phi on M and a constant \alpha>0, consider the set of the initial points for which the Birkhoff time averages of the function…

We prove an L^1 subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of universally L^1-good sequences nearly as sparse as the set of squares. In the process, we prove that…

A rather general ergodic type scheme is presented on arbitrary sets X, as they are generated by arbitrary mappings T : X \longrightarrow X. The structures considered on X are given by suitable subsets of the set of all of its finite…

We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…

Let $E$ be an elliptic curve over the rational field $\mathbf{Q}$. Let $K$ be a quadratic extension over $\mathbf{Q}$. Let $\mathrm{ST}(E/K)$ dente the Shafarevich-Tate group of $E$ over $K$. We show that (under mild conditions on $E$) for…

We study in this paper the validity of the mean ergodic theorem along \emph{left} F\o lner sequences in a countable amenable group $G$. Although the \emph{weak} ergodic theorem always holds along \emph{any} left F\o lner sequence in $G$, we…

A famous theorem of Szemer\'edi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the…

Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…

We define a translation based cipher over an arbitrary finite field, and study the permutation group generated by the round functions of such a cipher. We show that under certain cryptographic assumptions this group is primitive. Moreover,…

We prove ergodicity in a class of skew-product extensions of interval exchange transformations given by cocycles with logarithmic singularities. This, in particular, gives explicit examples of ergodic $\mathbb{R}$-extensions of minimal…

Cloud-based and distributed computations are of growing interest in modern control systems. However, these technologies require performing computations on not necessarily trustworthy platforms and, thus, put the confidentiality of sensitive…

This paper presents a new technique for disturbing the algebraic structure of linear codes in code-based cryptography. This is a new attempt to exploit Gabidulin codes in the McEliece setting and almost all the previous cryptosystems of…

We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…