Related papers: Classification complexity of chaotic systems
Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…
Chaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field. In this paper, a comprehensive study of its…
We conjecture that in one-dimensional spatially extended systems the propagation velocity of correlations coincides with a zero of the convective Lyapunov spectrum. This conjecture is successfully tested in three different contexts: (i) a…
We prove the holding of chaos in the sense of Li-Yorke for a family of four-dimensional discrete dynamical systems that are naturally associated to ODE systems describing coupled oscillators subject to an external non-conservative force,…
While the notion of chaos is well established for dynamical systems on manifolds, it is not so for dynamical systems over discrete spaces with $ N $ variables, as binary neural networks and cellular automata. The main difficulty is the…
We give a definition of chaos for a continuous self-map of a general topological space. This definition coincides with the Devanney definition for chaos when the topological space happens to be a metric space. We show that in a uniform…
Chaos and turbulence are complex physical phenomena, yet a precise definition of the complexity measure that quantifies them is still lacking. In this work we consider the relative complexity of chaos and turbulence from the perspective of…
We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…
We investigate the orbits of compact binary systems during the final inspiral period before coalescence by integrating numerically the second-order post-Newtonian equations of motion. We include spin-orbit and spin-spin coupling terms,…
We consider classification problems for manifolds and discrete subgroups of Lie groups from a descriptive set-theoretic point of view. This work is largely foundational in conception and character, recording both a framework for general…
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…
We give a definition of generalized indicators of sensitivity to initial conditions and orbit complexity (a measure of the information that is necessary to describe the orbit of a given point). The well known Ruelle-Pesin and Brin-Katok…
We consider the relative configurational entropy per cell S_Delta as a measure of the degree of spatial disorder for systems of finite-sized objects. It is highly sensitive to deviations from the most spatially ordered reference…
Time-independent Hamiltonian flows are viewed as geodesic flows in a curved manifold, so that the onset of chaos hinges on properties of the curvature two-form entering into the Jacobi equation. Attention focuses on ensembles of orbit…
We give, for each level of complexity L, a Hurewicz-like characterization of the Borel subsets with countable sections of a product of two Polish spaces that cannot become in L by changing the two Polish topologies.
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…
We show that a zero-dimensional chain transitive dynamical system can be embedded into a densely uniformly chaotic system, with dense uniformly chaotic set $K$. We concretely construct a Mycielski set $K$ that is also invariant.…
Characterizing complexity and criticality in quantum systems requires diagnostics that are both computationally tractable and physically insightful. We apply a measure of quantum state complexity for n-qubit systems, defined as the…
The description complexity of a model is the length of the shortest formula that defines the model. We study the description complexity of unary structures in first-order logic FO, also drawing links to semantic complexity in the form of…
We study complexity measures on subsets of the boolean hypercube and exhibit connections between algebra (the Hilbert function) and combinatorics (VC theory). These connections yield results in both directions. Our main complexity-theoretic…