Related papers: Fibonacci-like sequences and shift spaces in symbo…
In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…
We characterize the symbolical dynamical systems which are topologically isomorphic to the Fibonacci dynmaical system. We prove that there are infinitely many injective primitive substitutions generating a dynamical system in the Fibonacci…
A topological dynamical system induces two natural systems, one is on the hyperspace and the other one is on the probability space. The connection among some dynamical properties on the original space and on the induced spaces are…
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…
We initiate the study of correspondences for Smale spaces. Correspondences are shown to provide a notion of a generalized morphism between Smale spaces and are a special case of finite equivalences. Furthermore, for shifts of finite type, a…
Influence diagrams provide a compact graphical representation of decision problems. Several algorithms for the quick computation of their associated expected utilities are available in the literature. However, often they rely on a full…
Chaotic dynamics can be effectively studied by continuation from an anti-integrable limit. We use this limit to assign global symbols to orbits and use continuation from the limit to study their bifurcations. We find a bound on the…
The relationship between period doubling bifurcations and Feigenbaum's constants has been studied for nearly 40 years and this relationship has helped uncover many fundamental aspects of universal scaling across multiple nonlinear dynamical…
In the simple case of a Bernoulli shift on two symbols, zero and one, by permuting the symbols, it is obvious that any two equal entropy shifts are isomorphic. We show that the isomorphism can be realized by a factor that maps a binary…
This paper studies topological definitions of chain recurrence and shadowing for continuous endomorphisms of topological groups generalizing the relevant concepts for metric spaces. It is proved that in this case the sets of chain recurrent…
In this paper, we propose a numerical investigation of topological interactions in flocking dynamics. Starting from a microscopic description of the phenomena, mesoscopic and macroscopic models have been previously derived under specific…
We investigate topological mixing of compatible random substitutions. For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent…
We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the well-known notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of…
We introduce a shifted version of the binomial theorem, and use it to study some remarkable trigonometric integrals and their explicit rewriting in terms of binomial multiple sums. Motivated by the expressions of area generating functions…
We discuss algorithms for estimating the Shannon entropy h of finite symbol sequences with long range correlations. In particular, we consider algorithms which estimate h from the code lengths produced by some compression algorithm. Our…
We propose an algorithm for the detection of recurrence domains of complex dynamical systems from time series. Our approach exploits the characteristic checkerboard texture of recurrence domains exhibited in recurrence plots (RP). In phase…
Using a metric related to the returns correlation, a method is proposed to reconstruct an economic space from the market data. A reduced subspace, associated to the systematic structure of the market, is identified and its dimension related…
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…