Related papers: Ergodic Theory Over ${\F}_2[[T]]$
We prove distributional limit theorems for random walk adic transformations obtaining ergodic distributional limits of exponential chi squared form.
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…
Ergodic theory provides a rigorous mathematical description of chaos in classical dynamical systems, including a formal definition of the ergodic hierarchy. How ergodic dynamics is reflected in the energy levels and eigenstates of a quantum…
The present survey reports on the state of the art of the different cryptographic functionalities built upon the ring learning with errors problem and its interplay with several classical problems in algebraic number theory. The survey is…
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the monadic theory of all chains. It is provable from ZFC that the…
In [11], employing the technique of noncommutative interpolation, a maximal ergodic theorem in noncommutative Lp-spaces, 1 < p < infinity, was established and, among other things, corresponding maximal ergodic inequalities and individual…
In the present paper we prove weighted ergodic theorems and multiparameter weighted ergodic theorems for positive contractions acting on $L_p(\hat{\nabla},\hat{\mu})$. Our main tool is the use of methods of measurable bundles of…
Chaotic linear dynamics deals primarily with various topological ergodic properties of semigroups of continuous linear operators acting on a topological vector space. We treat questions of characterizing which of the spaces from a given…
We prove that for every $\epsilon>0$ there exists a minimal diffeomorphism $f:\T^{2}\rightarrow\T^{2}$ of class $C^{3-\epsilon}$ and semiconjugate to an ergodic traslation, and have the following properties: zero entropy, sensitivity with…
We study the thermodynamic formalism for particular types of sub-additive sequences on a class of subshifts over countable alphabets. The subshifts we consider include factors of irreducible countable Markov shifts under certain conditions.…
We investigate continuous time random walks with truncated $\alpha$-stable trapping times. We prove distributional ergodicity for a class of observables; namely, the time-averaged observables follow the probability density function called…
Consider the partial sums {S_t} of a real-valued functional F(Phi(t)) of a Markov chain {Phi(t)} with values in a general state space. Assuming only that the Markov chain is geometrically ergodic and that the functional F is bounded, the…
A pseudorandom code is a keyed error-correction scheme with the property that any polynomial number of encodings appear random to any computationally bounded adversary. We show that the pseudorandomness of any code tolerating a constant…
A theorem due to Hindman states that if $E$ is a subset of $\mathbb{N}$ with $d^*(E)>0$, where $d^*$ denotes the upper Banach density, then for any $\varepsilon>0$ there exists $N \in \mathbb{N}$ such that…
We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like…
Ergodicity is a fundamental issue for a stochastic process. In this paper, we refine results on ergodicity for a general type of Markov chain to a specific type or the $GI/G/1$-type Markov chain, which has many interesting and important…
We discuss Linnik's work on the distribution of integral solutions to $x^2+y^2+z^2 =d$, as $d$ goes to infinity. We give an exposition of Linnik's ergodic method; indeed, by using large-deviation results for random walks on expander graphs,…
We offer a new proof of the Furstenberg-Katznelson multiple recurrence theorem for several commuting probability-preserving transformations T_1, T_2, >..., T_d: \bbZ\curvearrowright (X,\S,\mu), and so, via the Furstenberg correspondence…
Modifications of Markovski quasigroup based crypto-algorithm have been proposed. Some of these modifications are based on the systems of orthogonal n-ary groupoids. T-quasigroups based stream ciphers have been constructed.
Let $f(u)$ be a polynomial of degree $m, m \geq 2,$ which splits into distinct linear factors over a finite field $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u]/\langle f(u)\rangle$ be a finite non-chain ring. In an earlier paper, we…