Related papers: Real Arnold complexity versus real topological ent…
For any dynamical system $T:X\rightarrow X$ of a compact metric space $X$ with $g-$almost product property and uniform separation property, under the assumptions that the periodic points are dense in $X$ and the periodic measures are dense…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
Let $\Theta$ be a finite alphabet. We consider a bundle of measure preserving transformations $(T_{\theta})_{\theta \in \Theta}$ acting on a probability space $(X,\mu)$, which are chosen randomly according to an ergodic stochastic process…
We present a family of birational transformations in $ CP_2$ depending on two, or three, parameters which does not, generically, preserve meromorphic two-forms. With the introduction of the orbit of the critical set (vanishing condition of…
We explore the relationship between Turing completeness and topological entropy of dynamical systems. We first prove that a natural class of Turing machines that we call "branching Turing machines" (which includes most of the known examples…
The relevance of the algebraic entropy in the study of birational discrete time dynamical systems highlights the need to relate it to other characteristics of these systems. In this letter, two complementary proofs are given that the…
Transfer entropy (TE) captures the directed relationships between two variables. Partial transfer entropy (PTE) accounts for the presence of all confounding variables of a multivariate system and infers only about direct causality. However,…
We study the permutation complexity of finite-state stationary stochastic processes based on a duality between values and orderings between values. First, we establish a duality between the set of all words of a fixed length and the set of…
In this article, we approach the Arnold corank problem, posed by Arnold in 1975, which asks whether the corank of holomorphic functions is an ambient topological invariant. Here, we obtain a complete positive answer to the metric Arnold…
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…
We consider the dynamical behavior of Martin-L\"of random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic…
We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…
A convenient measure of a map or flow's chaotic action is the topological entropy. In many cases, the entropy has a homological origin: it is forced by the topology of the space. For example, in simple toral maps, the topological entropy is…
Topological entropy or spatial entropy is a way to measure the complexity of shift spaces. This study investigates the relationships between the spatial entropy and the various periodic entropies which are computed by skew-coordinated…
We study the iterative behavior of the family of 3-step linear fractional recurrences and the family of birational maps they define. We determine all the possible periodicities within this family or, equivalently, the birational maps of…
A novel heuristic approach is proposed here for time series data analysis, dubbed Generalized weighted permutation entropy, which amalgamates and generalizes beyond their original scope two well established data analysis methods:…
We consider two numerical entropy--type invariants for actions of $\Zk$, invariant under a choice of generators and well-adapted for smooth actions whose individual elements have positive entropy. We concentrate on the maximal rank case,…
We construct an open set of structurally unstable three parameter families whose weak and so called moderate topological classification defined below has a numerical invariant that may take an arbitrary positive value. Here and below…
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…
Let $F$ be a finite field of order $q$ and characteristic $p$. Let $\mathbb{Z}_F=F[t]$, $\mathbb{Q}_F=F(t)$, $\mathbb{R}_F=F((1/t))$ equipped with the discrete valuation for which $1/t$ is a uniformizer, and let…