Search

Let $(X,T)$ and $(Y,S)$ be two topological dynamical systems, where $(X,T)$ has the weak specification property. Let $\xi$ be an invariant measure on the product system $(X\times Y, T\times S)$ with marginals $\mu$ on $X$ and $\nu$ on $Y$, with $\mu$ ergodic. Let $y\in Y$ be quasi-generic for $\nu$. Then there exists a point $x\in X$ generic for $\mu$ such that the pair $(x,y)$ is quasi-generic for $\xi$. This is a generalization of a similar theorem by T.\ Kamae, in which $(X,T)$ and $(Y,S)$ are full shifts on finite alphabets., Comment: 15 pages

We provide a definition of a $\prec$-asymptotic pair in a topological action of a countable group $G$, where $\prec$ is an order on $G$ of type $\mathbb Z$. We then prove that if $G$ is a countable amenable group and $(X,G)$ is a topological $G$-action of positive entropy, then for every multiorder $(\tilde{\mathcal O},\nu,G)$ and $\nu$-almost every order $\prec\,\in\tilde{\mathcal O}$ there exists a $\prec$-asympotic pair in $X$. This result is a generalization of the Blanchard-Host-Ruette Theorem for classical topological dynamical systems (actions of~$\mathbb Z$). We also prove that for every countable amenable group $G$, and every multiorder on $G$ arising from a tiling system, every topological $G$-action of entropy zero has an extension which has no $\prec$-asymptotic pairs for any $\prec$ belonging to this multiorder. Together, these two theorems give a characterization of topological $G$-actions of entropy zero: $(X,G)$ has topological entropy zero if and only if, for any multiorder $\tilde{\mathcal O}_{\boldsymbol{\mathsf T}}$ on $G$ arising from a tiling system of entropy zero, there exists an extension $(Y,G)$ of $(X,G)$, which has no $\prec$-asymptotic pairs for any $\prec\,\in\tilde{\mathcal O}_{\boldsymbol{\mathsf T}}$, equivalently, there exists a multiorder $(\tilde{\mathcal O},\nu,G)$ on $G$, such that for $\nu$-almost any $\prec\,\in\tilde{\mathcal O}$, there are no $\prec$-asymptotic pairs in $(Y,G)$., Comment: 20 pages

In this paper we prove the tail variational principle for actions of countable amenable groups. This allows us to extend some characterizations of asymptotic $h$-expansiveness from $\mathbb{Z}$-actions to actions of countable amenable groups., Comment: to appear in "Israel Journal of Mathematics" (a special volume in honor of Professor Benjamin Weiss)

Let $\mu$ be a shift-invariant measure on $\Lambda^{\mathbb N}$, where $\Lambda$ is a finite or countable alphabet. We say that an infinite subset $S=\{s_1,s_2,\dots\}\subset\mathbb N$ (where $s_1

The paper offers a thorough study of multiorders and their applications to measure-preserving actions of countable amenable groups. By a~{\em multiorder} on a~countable group we mean any probability measure $\nu$ on the collection $\tilde{\mathcal{O}}$ of linear orders of type $\mathbb Z$ on $G$, invariant under the natural action of $G$ on such orders. Every free measure-preserving $G$-action $(X,\mu,G)$ has a~multiorder $(\tilde{\mathcal{O}},\nu,G)$ as a factor and has the same orbits as the $\mathbb Z$-action $(X,\mu,S)$, where $S$ is the \emph{successor map} determined by the multiorder factor. Moreover, the sub-sigma-algebra $\Sigma_{\tilde{\mathcal{O}}}$ associated with the multiorder factor is invariant under $S$, which makes the corresponding $\mathbb Z$-action $(\tilde{\mathcal{O}},\nu,\tilde S)$ a factor of $(X,\mu,S)$. We prove that the entropy of any $G$-process generated by a finite partition of $X$, conditional with respect to $\Sigma_{\tilde{\mathcal{O}}}$, is preserved by the orbit equivalence with $(X,\mu,S)$. Furthermore, this entropy can be computed in terms of the so-called random past, by a formula analogous to $ h(\mu,T,\mathcal P)=H(\mu,\mathcal P|\mathcal{P}^-)$ known for $\mathbb Z$-actions. The above fact is then applied to prove a variant of a result by Rudolph and Weiss. The original theorem states that orbit equivalence between free actions of countable amenable groups preserves conditional entropy with respect to a~sub-sigma-algebra $\Sigma$, as soon as the ``orbit change'' is measurable with respect to $\Sigma$. In our variant, we replace the measurability assumption by a~simpler one: $\Sigma$ should be invariant under both actions and the actions on the resulting factor should be free. In conclusion we provide a characterization of the Pinsker sigma-algebra of any $G$-process in terms of an appropriately defined remote past arising from a multiorder., Comment: 36 pages, 2 figures, Changes: slightly changed formulation and proof of Theorem 7.4, some remarks added

The classical theorem of Jewett and Krieger gives a strictly ergodic model for any ergodic measure preserving system. An extension of this result for non-ergodic systems was given many years ago by George Hansel. He constructed, for any measure preserving system, a strictly uniform model, i.e. a compact space which admits an upper semicontinuous decomposition into strictly ergodic models of the ergodic components of the measure. In this note we give a new proof of a stronger result by adding the condition of purity, which controls the set of ergodic measures that appear in the strictly uniform model., Comment: 5 figures

We establish connections between several properties of topological dynamical systems, such as: - every point is generic for an ergodic measure, - the map sending points to the measures they generate is continuous, - the system splits into uniquely (alternatively, strictly) ergodic subsystems, - the map sending ergodic measures to their topological supports is continuous, - the Cesaro means of every continuous function converge uniformly., Comment: 13 pages, 6 figures

In this survey we will present the symbolic extension theory in topological dynamics, which was built over the past twenty years., Comment: to appear in "Acta Mathematica Sinica, English Series". arXiv admin note: text overlap with arXiv:1901.01457

Assume that a sequence $x=x_0x_1\ldots$ is frequency-typical for a finite-valued stationary stochastic process $\textbf X$. We prove that the function associating to $x$ the entropy-rate $\bar H(\textbf X)$ of $\textbf X$ is uniformly continuous when one endows the set of all frequency-typical sequences with the $\bar f$ pseudometric. As a consequence, we obtain the same result for the $\bar d$ pseudometric. We also give an alternative proof of the Abramov formula for the Kolmogorov-Sinai entropy of the induced measure-preserving transformation., Comment: Accepted to IEEE Transactions on Information Theory

Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the $(F_n)$-normality coincides with the classical notion. We prove that: $\bullet$ If $(F_n)$ is a F{\o}lner sequence in $G$, such that for every $\alpha\in(0,1)$ we have $\sum_n \alpha^{|F_n|}<\infty$, then almost every $x\in\{0,1\}^G$ is $(F_n)$-normal. $\bullet$ For any F{\o}lner sequence $(F_n)$ in $G$, there exists an Cham\-per\-nowne-like $(F_n)$-normal set. $\bullet$ There is a natural class of "nice" F{\o}lner sequences in $(\mathbb N,\times)$. There exists a Champernowne-like set which is $(F_n)$-normal for every nice F{\o}lner \sq. $\bullet$ Let $A\subset\mathbb N$ be a classical normal set. Then, for any F{\o}lner sequence $(K_n)$ in $(\mathbb N,\times)$ there exists a set $E$ of $(K_n)$-density $1$, such that for any finite subset $\{n_1,n_2,\dots,n_k\}\subset E$, the intersection $A/{n_1}\cap A/{n_2}\cap\ldots\cap A/{n_k}$ has positive upper density in $(\mathbb N,+)$. As a consequence, $A$ contains arbitrarily long geometric progressions, and, more generally, arbitrarily long "geo-arithmetic" configurations of the form $\{a(b+ic)^j,0\le i,j\le k\}$. $\bullet$ For any F{\o}lner \sq\ $(F_n)$ in $(\mathbb N,+)$ there exist uncountably many $(F_n)$-normal Liouville numbers. $\bullet$ For any nice F{\o}lner sequence $(F_n)$ in $(\mathbb N,\times)$ there exist uncountably many $(F_n)$-normal Liouville numbers., Comment: 52 pages, 1 figure

Consider a subshift over a finite alphabet, $X\subset \Lambda^{\mathbb Z}$ (or $X\subset\Lambda^{\mathbb N_0}$). With each finite block $B\in\Lambda^k$ appearing in $X$ we associate the empirical measure ascribing to every block $C\in\Lambda^l$ the frequency of occurrences of $C$ in $B$. By comparing the values ascribed to blocks $C$ we define a metric on the combined space of blocks $B$ and probability measures $\mu$ on $X$, whose restriction to the space of measures is compatible with the weak-$\star$ topology. Next, in this combined metric space we fix an open set $\mathcal U$ containing all ergodic measures, and we say that a block $B$ is "ergodic" if $B\in\mathcal U$. In this paper we prove the following main result: Given $\varepsilon>0$, every $x\in X$ decomposes as a concatenation of blocks of bounded lengths in such a way that, after ignoring a set $M$ of coordinates of upper Banach density smaller than $\varepsilon$, all blocks in the decomposition are ergodic. The second main result concerns subshifts whose set of ergodic measures is closed. We show that, in this case, no matter how $x\in X$ is partitioned into blocks (as long as their lengths are sufficiently large and bounded), after ignoring a set $M$ of upper Banach density smaller than $\varepsilon$, all blocks in the decomposition are ergodic. The first half of the paper is concluded by examples showing, among other things, that the small set $M$, in both main theorems, cannot be avoided. The second half of the paper is devoted to generalizing the two main results described above to subshifts $X\subset\Lambda^G$ with the action of a countable amenable group $G$. The role of long blocks is played by blocks whose domains are members of a F\o lner sequence while the decomposition of $x\in X$ into blocks (of which majority is ergodic) is obtained with the help of a congruent system of tilings., Comment: 26 pages, 4 figures

A classical Kamae-Weiss theorem states that an increasing sequence $(n_i)_{i\in\mathbb N}$ of positive lower density is \emph{normality preserving}, i.e. has the property that for any normal binary sequence $(b_n)_{n\in\mathbb N}$, the sequence $(b_{n_i})_{i\in\mathbb N}$ is normal, if and only if $(n_i)_{i\in\mathbb N}$ is a deterministic sequence. Given a countable cancellative amenable semigroup $G$, and a F\o lner sequence $\mathcal F=(F_n)_{n\in\mathbb N}$ in $G$, we introduce the notions of normality preservation, determinism and subexponential complexity for subsets of $G$ with respect to $\mathcal F$, and show that for sets of positive lower $\mathcal F$-density these three notions are equivalent. The proof utilizes the apparatus of the theory of tilings of amenable groups and the notion of tile-entropy. We also prove that under a natural assumption on $\mathcal F$, positive lower $\mathcal F$-density follows from normality preservation. Finally, we provide numerous examples of normality preserving sets in various semigroups, Comment: 58 pages, 0 figures

A recent result of Downarowicz and Serafin (DS) shows that there exist positive entropy subshifts satisfying the assertion of Sarnak's conjecture. More precisely, it is proved that if $y=(y_n)_{n\ge 1}$ is a bounded sequence with zero average along every infinite arithmetic progression (the M\"obius function is an example of such a \sq\ $y$) then for every $N\ge 2$ there exists a subshift $\Sigma$ over $N$ symbols, with entropy arbitrarily close to $\log N$, uncorrelated to $y$. In the present note, we improve the result of (DS). First of all, we observe that the uncorrelation obtained in (DS) is \emph{uniform}, i.e., for any continuous function $f:\Sigma\to {\mathbb R}$ and every $\epsilon>0$ there exists $n_0$ such that for any $n\ge n_0$ and any $x\in\Sigma$ we have $$ \left|\frac1n\sum_{i=1}^{n}f(T^ix)\,y_i\right|<\epsilon. $$ More importantly, by a fine-tuned modification of the construction from (DS) we create a \emph{strictly ergodic} subshift, with all the desired properties of the example in (DS) (uniformly uncorrelated to $y$ and with entropy arbitrarily close to $\log N$). The question about these two additional properties (uniformity of uncorrelation and strict ergodicity) has been posed by Mariusz Lemanczyk in the context of the so-called strong MOMO (M\"obius Orthogonality on Moving Orbits) property. Our result shows, among other things, that strong MOMO is essentially stronger than uniform uncorrelation, even for strictly ergodic systems.

Symbolic Extension Entropy Theorem (SEET) describes the possibility of a lossless digitalization of a dynamical system by extending it to a subshift. It gives an estimate on the entropy of symbolic extensions (and the necessary number of symbols). Unlike in the measure-theoretic case, where Kolmogorov--Sinai entropy is the estimate, in the topological setup the task reaches beyond the classical theory of entropy. Tools from an extended theory of entropy structures are needed. The main goal of this paper is to prove the SEET for actions of countable amenable groups: Let a countable amenable group $G$ act by homeomorphisms on a compact metric space $X$ and let $\mathcal M_G(X)$ denote the simplex of $G$-invariant probability measures on $X$. A function $E $ on $\mathcal M_G(X)$ equals the extension entropy function $h^\pi$ of a symbolic extension $\pi:(Y,G)\to (X,G)$, where $h^\pi(\mu)=\sup\{h_\nu(Y,G): \nu\in\pi^{-1}(\mu)\}$ ($\mu\in\mathcal M_G(X)$), if and only if $E $ is an affine superenvelope of the entropy structure of $(X,G)$. The statement is preceded by presentation of the concepts of an entropy structure and superenvelopes, adapted from $\mathbb Z$-actions. In full generality we prove a slightly weaker version of SEET, in which symbolic extensions are replaced by quasi-symbolic extensions, i.e., extensions in form of a joining of a subshift with a zero-entropy tiling system. The notion of a tiling system is a subject of earlier works and in this paper we review and complement the theory developed there. The full version of the SEET is proved for groups which are either residually finite or enjoy the comparison property. In order to describe the range of our theorem, we devote a large portion of the paper to the comparison property. Our main result in this aspect shows that all subexponential groups have the comparison property (and thus satisfy the SEET)., Comment: 89 pages. arXiv admin note: text overlap with arXiv:1712.05129

We study atomic measures on $[0,1]$ which are invariant both under multiplication by $2\mod 1$ and by $3\mod 1$, since such measures play an important role in deciding Furstenberg's $\times 2, \times 3$ conjecture. Our specific focus was finding atomic measures whose supports are far from being uniformly distributed, and we used computer software to discover a number of such measures (which we call \emph{outlier measures}). The structure of these measures indicates the possibility that a sequence of atomic measures may converge to a non-Lebesgue measure; likely one which is a combination of the Lebesgue measure and one or more atomic measures.

By an \emph{assignment} we mean a mapping from a Choquet simplex $K$ to probability measure-preserving systems, obeying some natural restrictions. We prove that if $\Phi$ is an aperiodic assignment on a Choquet simplex $K$ such that the set of extreme points $\mathsf{ex}K$ is a countable union $\bigcup_n E_n$, where each set $E_n$ is compact, zero-dimensional, and the restriction of $\Phi$ to the Bauer simplex $K_n$ spanned by $E_n$ can be `embedded' in some topological dynamical system, then $\Phi$ can be `realized' in a zero-dimensional system., Comment: 15 pages, 1 figure

Let a countable amenable group $G$ act on a \zd\ compact metric space $X$. For two clopen subsets $\mathsf A$ and $\mathsf B$ of $X$ we say that $\mathsf A$ is \emph{subequivalent} to $\mathsf B$ (we write $\mathsf A\preccurlyeq \mathsf B$), if there exists a finite partition $\mathsf A=\bigcup_{i=1}^k \mathsf A_i$ of $\mathsf A$ into clopen sets and there are elements $g_1,g_2,\dots,g_k$ in $G$ such that $g_1(\mathsf A_1), g_2(\mathsf A_2),\dots, g_k(\mathsf A_k)$ are disjoint subsets of $\mathsf B$. We say that the action \emph{admits comparison} if for any clopen sets $\mathsf A, \mathsf B$, the condition, that for every $G$-invariant probability measure $\mu$ on $X$ we have the sharp inequality $\mu(\mathsf A)<\mu(\mathsf B)$, implies $\mathsf A\preccurlyeq \mathsf B$. Comparison has many desired consequences for the action, such as the existence of tilings with arbitrarily good F{\o}lner properties, which are factors of the action. Also, the theory of symbolic extensions, known for $\mathbb z$-actions, extends to actions which admit comparison. We also study a purely group-theoretic notion of comparison: if every action of $G$ on any zero-dimensional compact metric space admits comparison then we say that $G$ has the \emph{comparison property}. Classical groups $\mathbb z$ and $\mathbb z^d$ enjoy the comparison property, but in the general case the problem remains open. In this paper we prove this property for groups whose every finitely generated subgroup has subexponential growth., Comment: overlapped by arXiv:1901.01457, and so will not be published separately (note that we have not changed the file)

For a topological dynamical system $(X, T)$ we define a uniform generator as a finite measurable partition such that the symmetric cylinder sets in the generated process shrink in diameter uniformly to zero. The problem of existence and optimal cardinality of uniform generators has lead us to new challenges in the theory of symbolic extensions. At the beginning we show that uniform generators can be identified with so-called symbolic extensions with an embedding, i.e., symbolic extensions admitting an equivariant measurable selector from preimages. From here we focus on such extensions and we strive to characterize the collection of the corresponding extension entropy functions on invariant measures. For aperiodic zero-dimensional systems we show that this collection coincides with that of extension entropy functions in arbitrary symbolic extensions, which, by the general theory of symbolic extensions, is known to coincide with the collection of all affine superenvelopes of the entropy structure of the system. In particular, we recover, after [Bu16], that an aperiodic zero-dimensional system is asymptotically h- expansive if and only if it admits an isomorphic symbolic extension. Next we pass to systems with periodic points, and we introduce the notion of a period tail structure, which captures the local growth rate of periodic orbits. Finally, we succeed in precisely identifying the wanted collection of extension entropy functions in symbolic extensions with an embedding: these are all the affine superenvelopes of the usual entropy structure which lie above certain threshold function determined by the period tail structure. This characterization allows us, among other things, to give estimates (and in examples to compute precisely) the optimal cardinality of a uniform generator., Comment: 44 Pages

We prove that for any compact zero-dimensional metric space $X$ on which an infinite countable amenable group $G$ acts freely by homeomorphisms, there exists a dynamical quasitiling with good covering, continuity, F{\o}lner and dynamical properties, i.e to every $x\in X$ we can assign a quasitiling $\mathcal{T}_x$ of $G$ (with all the $\mathcal{T}_x$ using the same, finite set of shapes) such that the tiles of $\mathcal{T}_x$ are disjoint, their union has arbitrarily high lower Banach Density, all the shapes of $\mathcal{T}_x$ are large subsets of an arbitrarily large F{\o}lner set, and if we consider $\mathcal{T}_x$ to be an element of a shift space over a certain finite alphabet, then the mapping $x\mapsto \mathcal{T}_x$ is a factor map.

We show that if $y=(y_n)_{n\ge 1}$ is a bounded sequence with zero average along every infinite arithmetic progression then for every $N\ge 2$ there exist (unilateral or bilateral) subshifts $\Sigma$ over $N$ symbols, with entropy arbitrarily close to $\log N$, uncorrelated to $y$. In particular, for $y=\mu$ being the M\"obius function, we get that there exist subshifts as above which satisfy the assertion of Sarnak's conjecture. The existence of positive entropy systems uncorrelated to the M\"obius function is claimed in Sarnak's survey \cite{sarnak} (and attributed to Bourgain), however, to our knowledge no examples have ever been published. We fill in this gap and by the way we show that this has nothing to do with more advanced algebraic properties (for instance multiplicativity) of the considered sequence., Comment: 10 pages

The goal of this paper is to put together several techniques in handling dynamical systems on zero-dimensional spaces, such as array representation, inverse limit representation, or Bratteli-Vershik representation. We describe how one can switch from one representation to another. We also briefly review some more recent related notions: symbolic extensions, symbolic extensions with an embedding, and uniform generators. We devote a great deal of attention to marker techniques and we use them to prove two types of results: one concerning entropy and vertical data compression, and another, about the existence of isomorphic minimal models for aperiodic systems. We also introduce so-called decisiveness of Bratteli--Vershik systems and give for it a sufficient condition., Comment: 30 pages, 8 figures; introduction, comments and references are added

The main subject of the paper, motivated by a question raised by Boshernitzan, is to give criteria for a bounded complex-valued sequence to be uncorrelated to any strictly ergodic sequence. As a tool developed to study this problem we introduce the notion of correlation between two shift-invariant measures supported by the symbolic space with complex symbols. We also prove a "lifting lemma" for generic points: given a joining $\xi$ of two shift-invariant measures $\mu$ and $\nu$, every point $x$ generic for $\mu$ lifts to a pair $(x,y)$ generic for $\xi$ (such $y$ exists in the full symbolic space). This lemma allows us to translate correlation between bounded sequences to the language of correlation of measures. Finally, to establish that the property of an invariant measure being uncorrelated to any ergodic measure is essentially weaker than the property of being disjoint from any ergodic measure, we develop and apply criteria for ergodicity of four-jump cocycles over irrational rotations. We believe that apart from the applications to studying the notion of correlation, the two developed tools: the lifting lemma and the criteria for ergodicity of four-jump cocycles, are of independent interest. This is why we announce them also in the title. In the Appendix we also introduce the notion of conditional disjointness., Comment: 21 pages

There are two main subjects in this paper. 1) For a topological dynamical system $(X,T)$ we study the topological entropy of its "functional envelopes" (the action of $T$ by left composition on the space of all continuous self-maps or on the space of all self-homeomorphisms of $X$). In particular we prove that for zero-dimensional spaces $X$ both entropies are infinite except when $T$ is equicontinuous (then both equal zero). 2) We call $Slovak$ $space$ any compact metric space whose homeomorphism group is cyclic and generated by a minimal homeomorphism. Using Slovak spaces we provide examples of (minimal) systems $(X,T)$ with positive entropy, yet, whose functional envelope on homeomorphisms has entropy zero (answering a question posed by Kolyada and Semikina). Finally, also using Slovak spaces, we resolve a long standing open problem whether the circle is a unique non-degenerate continuum admitting minimal continuous transformations but only invertible: No, some Slovak spaces are such, as well., Comment: 17 pages, 1 figure

We review subbadditivity properties of Shannon entropy, in particular, from the Shearer's inequality we derive the "infimum rule" for actions of amenable groups. We briefly discuss applicability of the "infimum formula" to actions of other groups. Then we pass to topological entropy of a cover. We prove Shearer's inequality for disjoint covers and give counterexamples otherwise. We also prove that, for actions of amenable groups, the supremum over all open covers of the "infimum fomula" gives correct value of topological entropy., Comment: 12 pages

If $\pi:(X,T)\to(Z,S)$ is a topological factor map between uniquely ergodic topological dynamical systems, then $(X,T)$ is called an isomorphic extension of $(Z,S)$ if $\pi$ is also a measure-theoretic isomorphism. We consider the case when the systems are minimal and we pay special attention to equicontinuous $(Z,S)$. We first establish a characterization of this type of isomorphic extensions in terms of mean equicontinuity, and then show that an isomorphic extension need not be almost one-to-one, answering questions of Li, Tu and Ye., Comment: 16 pages

We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K; \epsilon)$-invariant. Moreover, our tiling has topological entropy zero (i.e., subexponential complexity of patterns). As an application, we construct a free action of $G$ (in the sense that the mappings, associated to different from unity elements of $G$, have no fixpoints), on a zero-dimensional space, and which has topological entropy zero., Comment: 23 pages

Although Sarnak's conjecture holds for compact group rotations (irrational rotations, odometers), it is not even known whether it holds for all Jewett-Krieger models of such rotations. In this paper we show that it does, as long as the model is at the same a topological extension. In particular, we reestablish (after [AKL]) that regular Toeplitz systems satisfy Sarnak's conjecture, and, as another consequence, so do all generalized Sturmian subshifts (not only the classical Sturmian subshift). We also give an example of an irregular Toeplitz subshift which fits our criterion. We give an example of a model of an odometer which is not even Toeplitz (it is weakly mixing), hence does not fit our criterion. However, for this example, we manage to produce a separate proof of Sarnak's conjecture. Next, we provide a class of Toeplitz sequences which fail Sarnak's conjecture (in a weak sense); all these examples have positive entropy. Finally, we examine the example of a Toeplitz sequence from [AKL] (which fails Sarnak's conjecture in the strong sense) and prove that it has positive entropy, as well (this proof has been announced in [AKL]). This paper can be considered a sequel to [AKL], it also fills some gaps of [D]., Comment: 23 pages, four figures (two diagrams, two color figures)

We establish certain topological properties of rank understood as a function on the set of invariant measures on a topological dynamical system. To be exact, we show that rank is of Young class LU (i.e., it is the limit of an increasing sequence of upper semicontinuous functions)

We define new isomorphism-invariants for ergodic measure-preserving systems on standard probability spaces, called measure-theoretic chaos and measure-theoretic$^+$ chaos. These notions are analogs of the topological chaoses {\rm DC2} and its slightly stronger version (which we denote by {\rm DC}{\small$1\tfrac12$}). We prove that: 1. If a \tl\ system is measure-theoretically (measure-theoretically$^+$) chaotic with respect to at least one of its ergodic measures then it is \tl ly {\rm DC2} ({\rm DC}{\small$1 \tfrac12$}) chaotic. 2. Every ergodic system with positive Kolmogorov--Sinai entropy is measure-theoretically$^+$ chaotic (even in a bit stronger uniform sense). We provide an example showing that the latter statement cannot be reversed, a system of entropy zero with uniform measure-theoretic$^+$ chaos. \bigskip \centerline{\bf R\'esum\'e} Nous introduisons de nouveaux invariants pour les syst\`emes dynamiques d\'efinis sur des espaces probabilis\'es standards, appel\'es respectivement {\rm chaos mesur\'e} et {\rm chaos$^+$ mesur\'e}. Ces notions sont des analogues du chaos topologique {\rm DC2} et de l'une de ses variantes, renforc\'ee, que nous appelons {\rm DC}{\small$1 \tfrac12$}. Nous montrons d'une part que si un syst\`eme dynamique topologique est chaotique (resp. chaotique$^+$) au sens da la mesure relativement \`a\ l'une de ses mesures invariantes ergodiques, alors il l'est du point de vue topologique au sens correspondant. Nous montrons que tout syst\`eme ergodique d'entropie m\'etrique positive est chaotique$^+$ au sens de la mesure (m\^eme en un sens plus fort, i.e. {\rm uniform\'ement}). Nous donnons enfin un exemple de syst\`eme dynamique topologique d'entropie nulle qui pr\'esente pour l'une de ses mesures invariantes ergodiques un chaos$^+$ mesur\'e uniforme., Comment: 24 pages

Using methods of ergodic theory we prove as in the title.

In a stationary ergodic process, clustering is defined as the tendency of events to appear in series of increased frequency separated by longer breaks. Such behavior, contradicting the theoretical "unbiased behavior" with exponential distribution of the gaps between appearances, is commonly observed in experimental processes and often difficult to explain. In the last section we relate one such empirical example of clustering, in the area of marine technology. In the theoretical part of the paper we prove, using ergodic theory and the notion of category, that clustering (even very strong) is in fact typical for "rare events" defined as long cylinder sets in processes generated by a finite partition of an arbitrary (infinite aperiodic) ergodic measure preserving transformation., Comment: 9 pages, 2 figures

We consider an ergodic process on finitely many states, with positive entropy. Our first main result asserts that the distribution function of the normalized waiting time for the first visit to a small (i.e., over a long block) cylinder set $B$ is, for majority of such cylinders and up to epsilon, dominated by the exponential distribution function $1-e^{-t}$. That is, the occurrences of so understood "rare event" $B$ along the time axis can appear either with gap sizes of nearly exponential distribution (like in the independent Bernoulli process), or they "attract" each-other. Our second main result states that a {\it typical} ergodic process of positive entropy has the following property: the distribution functions of the normalized hitting times for the majority of cylinders $B$ of lengths $n'$ converge to zero along a \sq\ $n'$ whose upper density is 1. The occurrences of such a cylinder $B$ "strongly attract", i.e., they appear in "series" of many frequent repetitions separated by huge gaps of nearly complete absence. These results, when properly and carefully interpreted, shed some new light, in purely statistical terms, independently from physics, on a century old (and so far rather avoided by serious science) common-sense phenomenon known as {\it the law of series}, asserting that rare events in reality, once occurred, have a mysterious tendency for untimely repetitions., Comment: 21 pages, 1 figure

Rado's Theorem characterizes the systems of homogenous linear equations having the property that for any finite partition of the positive integers one cell contains a solution to these equations. Furstenberg and Weiss proved that solutions to those systems can in fact be found in every central set. (Since one cell of any finite partition is central, this generalizes Rado's Theorem.) We show that the same holds true for the larger class of $D$-sets. Moreover we will see that the conclusion of Furstenberg's Central Sets Theorem is true for all sets in this class.

We prove a general ergodic-theoretic result concerning the return time statistic, which, properly understood, sheds some new light on the common sense phenomenon known as {\it the law of series}. Let \proc be an ergodic process on finitely many states, with positive entropy. We show that the distribution function of the normalized waiting time for the first visit to a small cylinder set $B$ is, for majority of such cylinders and up to epsilon, dominated by the exponential distribution function $1-e^{-t}$. This fact has the following interpretation: The occurrences of such a "rare event" $B$ can deviate from purely random in only one direction -- so that for any length of an "observation period" of time, the first occurrence of $B$ "attracts" its further repetitions in this period.