Search for: All records

We present an introduction to the area of computability in dynamical systems. One of the central questions in this area is if relevant dynamical objects can be algorithmically presented by a Turing machine. After providing an overview of the relevant objects we discuss recent results concerning the computability of the entropy for symbolic systems and the computability of Julia sets as well as their Brolin–Lyubich measures. 

We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These algorithms extend the classical trace test in numerical algebraic geometry. Our results rely on both the analysis of the structure of sparse resultants as well as an extension of Esterov’s results on monodromy groups of sparse systems. 

We present numerical homotopy continuation algorithms for solving systems of equations on a variety in the presence of a finite Khovanskii basis. These homotopies take advantage of Anderson’s flat degeneration to a toric variety. When Anderson’s degeneration embeds into projective space, our algorithm is a special case of a general toric two-step homotopy algorithm. When Anderson’s degeneration is embedded in a weighted projective space, we explain how to lift to a projective space and construct an appropriate modification of the toric homotopy. Our algorithms are illustrated on several examples using Macaulay2. 

We investigate the computability (in the sense of computable analysis) of the topological pressure P_top(ϕ) on compact shift spaces X for continuous potentials ϕ:X→R. This question has recently been studied for subshifts of finite type (SFTs) and their factors (sofic shifts). We develop a framework to address the computability of the topological pressure on general shift spaces and apply this framework to coded shifts. In particular, we prove the computability of the topological pressure for all continuous potentials on S-gap shifts, generalised gap shifts, and particular beta-shifts. We also construct shift spaces which, depending on the potential, exhibit computability and non-computability of the topological pressure. We further prove that the generalised pressure function (X,ϕ) ↦P_top(X,ϕ|_X) is not computable for a large set of shift spaces X and potentials ϕ . In particular, the entropy map X↦h_top(X) is computable at a shift spaceXif and only if X has zero topological entropy. Along the way of developing these computability results, we derive several ergodic-theoretical properties of coded shifts which are of independent interest beyond the realm of computability. 

Let $$f:X\rightarrow X$$ be a continuous dynamical system on a compact metric space $$X$$ and let $$\unicode[STIX]{x1D6F7}:X\rightarrow \mathbb{R}^{m}$$ be an $$m$$ -dimensional continuous potential. The (generalized) rotation set $$\text{Rot}(\unicode[STIX]{x1D6F7})$$ is defined as the set of all $$\unicode[STIX]{x1D707}$$ -integrals of $$\unicode[STIX]{x1D6F7}$$ , where $$\unicode[STIX]{x1D707}$$ runs over all invariant probability measures. Analogous to the classical topological entropy, one can associate the localized entropy $$\unicode[STIX]{x210B}(w)$$ to each $$w\in \text{Rot}(\unicode[STIX]{x1D6F7})$$ . In this paper, we study the computability of rotation sets and localized entropy functions by deriving conditions that imply their computability. Then we apply our results to study the case where $$f$$ is a subshift of finite type. We prove that $$\text{Rot}(\unicode[STIX]{x1D6F7})$$ is computable and that $$\unicode[STIX]{x210B}(w)$$ is computable in the interior of the rotation set. Finally, we construct an explicit example that shows that, in general, $$\unicode[STIX]{x210B}$$ is not continuous on the boundary of the rotation set when considered as a function of $$\unicode[STIX]{x1D6F7}$$ and $$w$$ . In particular, $$\unicode[STIX]{x210B}$$ is, in general, not computable at the boundary of $$\text{Rot}(\unicode[STIX]{x1D6F7})$$ .