Related papers: Measure-Theoretically Mixing Subshifts with Low Co…

We prove mixing on a general class of rank-one transformations containing all known examples of rank-one mixing, including staircase transformations and Ornstein's constructions, and a variety of new constructions.

We exhibit subshifts admitting weakly mixing (probability) measures, for arbitrary $\epsilon > 0$, with word complexity $p$ satisfying $\limsup \frac{p(q)}{q} < 1.5 + \epsilon$. For arbitrary $f(q) \to \infty$, said subshifts can be made to…

We resolve a long-standing open question on the relationship between measure-theoretic dynamical complexity and symbolic complexity by establishing the exact word complexity at which measure-theoretic strong mixing manifests: For every…

We introduce high staircase infinite measure preserving transformations and prove that they are mixing under a restricted growth condition. This is used to (i) realize each subset $E\subset\Bbb N\cup\{\infty\}$ as the set of essential…

We prove that a rank one transformation satisfying a condition called restricted growth is a mixing transformation if and only if the spacer sequence for the transformation is uniformly ergodic. Uniform ergodicity is a generalization of the…

We prove that mixing on rank-one transformations is equivalent to the spacer sequence being slice-ergodic. Slice-ergodicity, introduced in this paper, generalizes the notion of ergodic sequence to the uniform convergence of ergodic averages…

We study the notions of weak rational ergodicity and rational weak mixing as defined by Jon Aaronson. We prove that various families of infinite measure-preserving rank-one transformations possess (or do not posses) these properties, and…

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

The communication class $\mathbf{UPP}^{\text{cc}}$ is a communication analog of the Turing Machine complexity class $\mathbf{PP}$. It is characterized by a matrix-analytic complexity measure called sign-rank (also called dimension…

We study multivariate integration of functions that are invariant under permutations (of subsets) of their arguments. We find an upper bound for the $n$th minimal worst case error and show that under certain conditions, it can be bounded…

In a recent paper, Melbourne and Terhesiu [Operator renewal theory and mixing rates for dynamical systems with infinite measure, Invent. Math. 189 (2012), 61-110] obtained results on mixing and mixing rates for a large class of…

There is a well-known upper bound on the growth rate of the merge of two permutation classes. Curiously, there is no known merge for which this bound is not achieved. Using staircases of permutation classes, we provide sufficient conditions…

For a class of irrational numbers, depending on their Diophantine properties, we construct explicit rank-one transformations that are totally ergodic and not weakly mixing. We classify when the measure is finite or infinite. In the finite…

We recall a proof of the mixing for almost all Ornstein's stochastic rank one constructions, replace stochastic spacers by special algebraic ones and prove the mixing in this new situation.

In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…

We prove that if $\Sigma_{\mathbf A}(\mathbb N)$ is an irreducible Markov shift space over $\mathbb N$ and $f:\Sigma_{\mathbf A}(\mathbb N) \rightarrow \mathbb R$ is coercive with bounded variation then there exists a maximizing probability…

A subshift with linear block complexity has at most countably many ergodic measures, and we continue of the study of the relation between such complexity and the invariant measures. By constructing minimal subshifts whose block complexity…

We consider a two-parameter family of random substitutions and show certain combinatorial and topological properties they satisfy. We establish that they admit recognisable words at every level. As a consequence, we get that the subshifts…

For different classes of measure preserving transformations, we investigate collections of sets that exhibit the property of lightly mixing. Lightly mixing is a stronger property than topological mixing, and requires that a lim inf is…

J.-P. Thouvenot and the author showed via different approaches that the centralizer of a mixing rank-one infinite measure preserving transformation was trivial. In this note the author presents his joining proof. We also consider…