Related papers: Scrambled and distributionally scrambled n-tuples
This paper studies the distribution of chain and maximal chain lengths in a causal set. We first provide a new derivation for these distributions for a causal set uniformly embedded in Minkowski space, for various dimensionalities, which…
Dynamical chaos is a fundamental manifestation of gravity in astrophysical, many-body systems. The spectrum of Lyapunov exponents quantifies the associated exponential response to small perturbations. Analytical derivations of these…
Here I present a review of the work done on the presence and effects of chaos in elliptical galaxies plus some recent results we obtained on this subject. The fact that important fractions of the orbits that arise in potentials adequate to…
Based on newly discovered properties of the shift map (Theorem 1), we believe that chaos should involve not only nearby points can diverge apart but also faraway points can get close to each other. Therefore, we propose to call a continuous…
The scramble number of a graph is an invariant recently developed to aid in the study of divisorial gonality. In this paper we prove that scramble number is NP-hard to compute, also providing a proof that computing gonality is NP-hard even…
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.…
We consider nonautonomous discrete dynamical systems $\{ f_n\}_{n\ge 1}$, where every $f_n$ is a surjective continuous map $[0,1]\to [0,1]$ such that $f_n$ converges uniformly to a map $f$. We show, among others, that if $f$ is chaotic in…
In this paper, we define a new construction of completely scrambled 0-dimensional systems using the inverse limit of sequences of directed graph covers. These examples are transitive and are not locally equicontinuous.
For the past decade there has been a considerable debate about the existence of chaos in the mixmaster cosmological model. The debate has been hampered by the coordinate, or observer dependence of standard chaotic indicators such as…
In this paper we provide examples of topological dynamical systems having either finite or countable scrambled sets. In particular we study conditions for the existence of Li-Yorke, asymptotic and distal pairs in constant--length…
The chaotic properties of some subshift maps are investigated. These subshifts are the orbit closures of certain non-periodic recurrent points of a shift map. We first provide a review of basic concepts for dynamics of continuous maps in…
To prove presence of chaos for fractals, a new mathematical concept of abstract similarity is introduced. As an example, the space of symbolic strings on a finite number of symbols is proved to possess the property. Moreover, Sierpinski…
We are interested in the behavior of particular functionals, in a framework where the only source of randomness is a sampling without replacement. More precisely the aim of this short note is to prove an exponential concentration inequality…
We prove that there exists a topologically mixing homeomorphism which is completely scrambled. We also prove that for any integer $n\geq 1$ there is a continuum of topological dimension $n$ supporting a transitive completely scrambled…
A fractal method to detect, locate and quantify chaos in multi-dimensional-conservative-closed systems, based on the creation of artificial exits, is presented. The method is invariant under space-time changes of coordinates and can be used…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
In this paper, we investigate the distributional chaos of the composition operator $T_{\varphi}:f\mapsto f\circ\varphi$ on $L^{p}(X,\mathcal{B},\mu)$, $1\leq p <\infty$. We provide a characterization and practical sufficient conditions on…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
In this paper we consider relations between distributional chaos in a sequence with distributional chaos, w-chaos, R-T chaos, DC 3, respectively). We give a sufficient condition and prove that the distributional chaos is equivalent to the…
We explore connections among the regional proximal relation, the asymptotic relation and the distal relation for a topological dynamical system with the shadowing property, and show that if a Devaney chaotic system has the shadowing…