Related papers: Maximizing entropy for power-free languages
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…
We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…
Substitution systems evolve in time by generating sequences of symbols from a finite alphabet: At a certain iteration step, the existing symbols are systematically replaced by blocks of $N_{k}$ symbols also within the alphabet (with…
We consider the number of occurrences of subwords (non-consecutive sub-sequences) in a given word. We first define the notion of subword entropy of a given word that measures the maximal number of occurrences among all possible subwords. We…
In [30] different statistical behavior of dynamical orbits without syndetic center are considered. In present paper we continue this project and consider different statistical behavior of dynamical orbits with nonempty syndetic center: Two…
We study the von Neumann entropy asymptotics of pure translation-invariant quasi-free states of d-dimensional fermionic systems. It is shown that the entropic area law is violated by all these states: apart from the trivial cases, the…
Entropy has been a common index to quantify the complexity of time series in a variety of fields. Here, we introduce increment entropy to measure the complexity of time series in which each increment is mapped into a word of two letters,…
We study the problem of entropy calibration, which asks whether a language model's entropy over generations matches its log loss on human text. Past work found that models are miscalibrated, with entropy per step increasing as generations…
We investigate the flexibility of the entropy (topological and metric) for the class of piecewise expanding unimodal maps. We show that the only restrictions for the values of the topological and metric entropies in this class are that both…
In this paper, we study ergodic optimization of continuous functions for flows by concentrating on the entropy spectrum of their maximizing measures. Precisely, over a wide family of flows with non-uniformly hyperbolic structure, we obtain…
We study expansive measures for continuous flows without fixed points on compact metric spaces. We provide a new characterization of expansive measures through dynamical balls that, in contrast to the dynamical balls considered in [\emph{J.…
We construct symbolic dynamics for flows with positive speed in any dimension: for each $\chi>0$, we code a set that has full measure for every invariant probability measure which is $\chi$--hyperbolic. In particular, the coded set contains…
Permutation entropy quantifies the diversity of possible orderings of the values a random or deterministic system can take, as Shannon entropy quantifies the diversity of values. We show that the metric and permutation entropy…
The thermodynamic definition of entropy can be extended to nonequilibrium systems based on its relation to information. To apply this definition in practice requires access to the physical system's microstates, which may be prohibitively…
We show that $C^\infty$ surface diffeomorphisms with positive topological entropy have at most finitely many ergodic measures of maximal entropy in general, and at most one in the topologically transitive case. This answers a question of…
The maximum entropy principle is foundational for statistical analyses of complex dynamics. This principle has been challenged by the findings of a previous work [arXiv:1701.07596], where it was argued that a quantum system driven in time…
The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…
Motivated by the established notion of storage codes, we consider sets of infinite sequences over a finite alphabet such that every $k$-tuple of consecutive entries is uniquely recoverable from its $l$-neighborhood in the sequence. We…
Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not…
The deterministic notions of capacity and entropy are studied in the context of communication and storage of information using square-integrable, bandlimited signals subject to perturbation. The $(\epsilon,\delta)$-capacity, that extends…