Related papers: Characteristic measures for language stable subshi…
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 equivalence of the characteristic function approach and the probabilistic approach to monotone and boolean convolutions is proven for non-compactly supported probability measures. A probabilistically motivated definition of the…
Let $(X,\mu)$ be a standard probability space. An automorphism $T$ of $(X,\mu)$ has the weak Pinsker property if for every $\varepsilon > 0$ it has a splitting into a direct product of a Bernoulli shift and an automorphism of entropy less…
We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…
We show that in a topological dynamical system $(X,T)$ of positive entropy there exist proper (positively) asymptotic pairs, that is, pairs $(x,y)$ such that $x\not= y$ and $\lim_{n\to +\infty} d(T^n x,T^n y)=0$. More precisely we consider…
The main aim of the paper is to introduce a new class of (semigroup-valued) measures that are ultrahomogeneous on the Boolean algebra of all clopen subsets of the Cantor space and to study their automorphism groups. A characterisation, in…
Transfer entropy is used to establish a measure of causal relationships between two variables. Symbolic transfer entropy, as an estimation method for transfer entropy, is widely applied due to its robustness against non-stationarity. This…
When quantifying the mixing properties of a quantum dynamical system in terms of dynamical entropy, the following scheme appears natural: observe the state of the system at regular time intervals while it evolves and determine the entropy…
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 study finitely additive extensions of the asymptotic density to all the subsets of natural numbers. Such measures are called density measures. We consider a class of density measures constructed from free ultrafilters on $\mathbb{N}$ and…
Let $\lambda$ be a probability measure on $\mathbb T^{n-1}$ where $n=2$ or 3. Suppose $\lambda$ is invariant, ergodic and has positive entropy with respect to the linear transformation defined by a hyperbolic matrix. We get a measure $\mu $…
We investigate local entropy theory, particularly the property of having completely positive entropy (CPE), from a descriptive set-theoretic point of view. We aim to determine descriptive complexity of different families of dynamical…
For upper semi-continuous potentials defined on shifts over countable alphabets, this paper ensures sufficient conditions for the existence of a maximizing measure. We resort to the concept of blur shift, introduced by T. Almeida and M.…
The (e,n)-complexity functions describe total instability of trajectories in dynamical systems. They reflect an ability of trajectories going through a Borel set to diverge on the distance $\epsilon$ during the time interval n. Behavior of…
In this work, on the one hand, we survey and amplify old results concerning tame dynamical systems and, on the other, prove some new results and exhibit new examples of such systems. In particular, we study tame symbolic systems and…
We show the existence of a bounded Borel measurable saturated compensation function for a factor map between subshifts. As an application, we find the Hausdorff dimension and measures of full Hausdorff dimension for a compact invariant set…
A popular view in contemporary Boltzmannian statistical mechanics is to interpret the measures as typicality measures. In measure-theoretic dynamical systems theory measures can similarly be interpreted as typicality measures. However, a…
Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…
We initiate the study of finite characterizations and exact learnability of modal languages. A finite characterization of a modal formula w.r.t. a set of formulas is a finite set of finite models (labelled either positive or negative) which…
In a previous paper the authors developed an operator-algebraic approach to Lewis Bowen's sofic measure entropy that yields invariants for actions of countable sofic groups by homeomorphisms on a compact metrizable space and by…