Related papers: Classification complexity of chaotic systems
We provide a classification of random orientation-preserving homeomorphisms of $\mathbb{S}^1$, up to topological conjugacy of the random dynamical systems generated by i.i.d. iterates of the random homeomorphism. This classification covers…
We propose a theory of chaos for discrete systems, based on their representation in a space of ``binary histories'', $ {\cal B^{\infty}} $. We show that $ {\cal B^{\infty}} $ is a metrizable Cantor set which embeds the attractor $\Lambda$,…
We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…
We investigate the descriptive complexity of order convergence in separable Banach lattices. While uniform convergence is Borel and $\sigma$-order convergence is known to be ${\bf \Delta}^1_2$, it is unclear in general when $\sigma$-order…
We recall the definition of the $\epsilon$-distortion complexity of a set defined in \cite{bcc} and the results obtained in this paper for Cantor sets of the interval defined by iterated function systems. We state an analogous definition…
Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear…
A series of recent papers by Bergfalk, Lupini and Panagiotopoulus developed the foundations of a field known as `definable algebraic topology,' in which classical cohomological invariants are enriched by viewing them as groups with a Polish…
We determine topological complexity of a series of finite spaces which is weakly homotopy equivalent to a circle $S^1$, and give a finite space $X$ satisfying the inequality tc$(X) <$ cat$(X {\times} X)$. This answers two conjectures on…
This paper is concerned with Devaney chaos in non-autonomous discrete systems. It is shown that in its definition, the two former conditions, i.e., transitivity and density of periodic points, in a set imply the last one, i.e., sensitivity,…
In this work we present analytical and numerical evidences that classical integrable models possessing infinitely many degrees of freedom unexpectedly exhibit some features that are typical of chaotic systems. By studying how the conserved…
We study the descriptive complexity of sets of points defined by placing restrictions on statistical behaviour of their orbits in dynamical systems on Polish spaces. A particular examples of such sets are the set of generic points of a…
We present a quasi-integrable two-dimensional lattice equation: i.e., a partial difference equation which satisfies a criterion of integrability, singularity confinement, although it has a chaotic aspect in the sense that the degrees of its…
We study generalized indicators of sensitivity to initial conditions and orbit complexity in topological dynamical systems. The orbit complexity is a measure of the asymptotic behavior of the information that is necessary to describe the…
We introduce two numerical conjugacy invariants for dynamical systems -- the complexity and weak complexity indices -- which are well-suited for the study of "completely integrable" Hamiltonian systems. These invariants can be seen as "slow…
Within the framework of generalized combinatorial approach, the complexity is determined for infinite set of self-similar hierarchical ensembles. This complexity is shown to increase with strengthening of the hierarchy coupling to the…
Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…
In this chapter, we consider a class of discrete dynamical systems defined on the homogeneous space associated with a regular tiling of $\R^N$, whose most familiar example is provided by the $N-$dimensional torus $\T ^N$. It is proved that…
We apply a notion of quantum complexity, called "Krylov complexity", to study the evolution of systems from integrability to chaos. For this purpose we investigate the integrable XXZ spin chain, enriched with an integrability breaking…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
This study redefines the analysis of Devaney chaos in multiple mappings from a set-valued perspective and introduces new conditions to characterize their chaotic behavior. As an innovative advancement, we develop computational algorithms to…