Related papers: On the Complexity of some Geometrical Objects
For symbolic dynamics with some mild conditions, we solve the lowering topological entropy problem for subsystems and determine the Hausdorff dimension of the level set with given complexity, where the complexity is represented by Hausdorff…
In many interesting situations the size of epsilon-nets depends only on $\epsilon$ together with different complexity measures. The aim of this paper is to give a systematic treatment of such complexity measures arising in Discrete and…
We consider (not self-similar) Cantor sets defined by a sequence of piecewise linear functions. We prove that the dimension of the harmonic measure on such a set is strictly smaller than its Hausdorff dimension. Some Hausdorff measure…
We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…
New notions of the complexity function C(epsilon;t,s) and entropy function S(epsilon;t,s) are introduced to describe systems with nonzero or zero Lyapunov exponents or systems that exhibit strong intermittent behavior with ``flights'',…
In this article we study Cantor sets defined by monotone sequences, in the sense of Besicovitch and Taylor. We classify these Cantor sets in terms of their h-Hausdorff and h-Packing measures, for the family of dimension functions h, and…
We study dynamical systems which have bounded complexity with respect to three kinds metrics: the Bowen metric $d_n$, the max-mean metric $\hat{d}_n$ and the mean metric $\bar{d}_n$, both in topological dynamics and ergodic theory. It is…
We construct a smooth nontrivial mixed partially hyperbolic system and explicitly identify its skeleton. This example shares characteristics with the classical examples. Moreover, the support of each physical measure contains three fixed…
We treat the problem of characterizing the cyclic vectors in the weighted Dirichlet spaces, extending some of our earlier results in the classical Dirichlet space. The absence of a Carleson-type formula for weighted Dirichlet integrals…
We study non-autonomous conformal iterated function systems, with finite or countably infinite alphabet alike. These differ from the usual (autonomous) iterated function systems in that the contractions applied at each step in time are…
We study algorithmic problems on subsets of Euclidean space of low fractal dimension. These spaces are the subject of intensive study in various branches of mathematics, including geometry, topology, and measure theory. There are several…
We present a complexity measure for any finite time series. This measure has invariance under any monotonic transformation of the time series, has a degree of robustness against noise, and has the adaptability of satisfying almost all the…
There is no single universally accepted definition of "Complexity". There are several perspectives on complexity and what constitutes complex behaviour or complex systems, as opposed to regular, predictable behaviour and simple systems. In…
We introduce amorphic complexity as a new topological invariant that measures the complexity of dynamical systems in the regime of zero entropy. Its main purpose is to detect the very onset of disorder in the asymptotic behaviour. For…
We develop a new mathematical model for describing a dynamical system at limited resolution (or finite scale), and we give precise meaning to the notion of a dynamical system having some property at all resolutions coarser than a given…
A bi-Hamiltonian formulation is proposed for triangular systems resulted by perturbations around solutions, from which infinitely many symmetries and conserved functionals of triangular systems can be explicitly constructed, provided that…
Computational mechanics, an approach to structural complexity, defines a process's causal states and gives a procedure for finding them. We show that the causal-state representation--an $\epsilon$-machine--is the minimal one consistent with…
We show that every invertible strong mixing transformation on a Lebesgue space has strictly over-recurrent sets. Also, we give an explicit procedure for constructing strong mixing transformations with no under-recurrent sets. This answers…
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…
We study some measures which are related to the notion of the $\e$-complexity. We prove that measure of $\e$-complexity defined on the base of the notion of $\e$-separability is equivalent to the dual measure that is defined through…