Related papers: Real Arnold complexity versus real topological ent…
How to measure the complexity of a finite set of vectors embedded in a multidimensional space? This is a non-trivial question which can be approached in many different ways. Here we suggest a set of data complexity measures using universal…
Let $f_{i},i=1,2$ be continuous bundle random dynamical systems over an ergodic compact metric system $(\Omega,\mathcal{F},\mathbb{P},\vartheta)$. Assume that ${\bf a}=(a_{1},a_{2})\in\mathbb{R}^{2}$ with $a_{1}>0$ and $a_{2}\geq0$, $f_{2}$…
We present some (unfortunately not all) known properties on the Cremona group; when it's possible we mentioned links with the most known group of polynomial automorphisms of the affine plane. The mentioned properties are essentially…
Topological entropy measures the number of distinguishable orbits in a dynamical system, thereby quantifying the complexity of chaotic dynamics. One approach to computing topological entropy in a two-dimensional space is to analyze the…
Decimal expansions of classical constants such as $\sqrt2$, $\pi$ and $\zeta(3)$ have long been a source of difficult questions. In the case of Laurent series with coefficients in a finite field, where no carry-over difficulties appear, the…
Let $\Lambda$ be a complex manifold and let $(f_\lambda)_{\lambda\in \Lambda}$ be a holomorphic family of rational maps of degree $d\geq 2$ of $\mathbb{P}^1$. We define a natural notion of entropy of bifurcation, mimicking the classical…
Topological data analysis (TDA), while abstract, allows a characterization of time-series data obtained from nonlinear and complex dynamical systems. Though it is surprising that such an abstract measure of structure - counting pieces and…
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…
We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…
In the classification of real singularities by Arnold et al. (1985), normal forms, as representatives of equivalence classes under right equivalence, are not always uniquely determined. We describe the complete structure of the equivalence…
Noncommutative topological entropy estimates are obtained for polynomial gauge invariant endomorphisms of Cuntz algebras, generalising known results for the canonical shift endomorphisms. Exact values for the entropy are computed for a…
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…
Intrinsic computation refers to how dynamical systems store, structure, and transform historical and spatial information. By graphing a measure of structural complexity against a measure of randomness, complexity-entropy diagrams display…
We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit,…
Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…
Contents 1 Mappings and distortion 2 The mathematics of good behavior much of the time, and the BMO frame of mind 3 Finite polyhedra and combinatorial parameterization problems 4 Quantitative topology, and calculus on singular spaces 5…
We study quasiperiodically forced circle endomorphisms, homotopic to the identity, and show that under suitable conditions these exhibit uncountably many minimal sets with a complicated structure, to which we refer to as `strangely…
This paper is devoted to problems stated by Z. Zhou and F. Li in 2009. They concern relations between almost periodic, weakly almost periodic, and quasi-weakly almost periodic points of a continuous map f and its topological entropy. The…
For a pair of spaces $X$ and $Y$ such that $Y \subseteq X$, we define the relative topological complexity of the pair $(X,Y)$ as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number…
We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the…